Device Discovery in Short-Range Wireless Ad Hoc Networks
|
|
- Roderick Gilmore
- 8 years ago
- Views:
Transcription
1 Device Discovery in Short-Range Wireless Ad Hoc Networks Petar Popovski Tatiana Kozlova Liljana Gavrilovska Ramjee Prasad Center for Personkommunikation, Aalborg University Fredrik Bajers Vej 7A5, DK-922 Aalborg, Denmark {petarp, tatiana, liljanag, Abstract The performance of many envisioned applications in shortrange wireless ad hoc networking will critically rely on the promptness of the self-configuring network procedures In that sense, a fundamental problem in ad hoc networks, is the device discovery and/or network initialization In this paper we propose a randomized distributed algorithm for rapid device discovery during the deployment of ad hoc network The algorithm uses the approach of the nonblocked stack algorithm to resolve the collisions, which ensures time-efficient execution when the number of devices in the network is large The self-starting concepts used in this algorithm may be significant for inferring other self-configuring algorithms for ad hoc networks Keywords Device discovery, network initialization, randomized distributed algorithms, collision resolution INTRODUCTION The wireless networking evolves towards adaptive ad hoc structures, providing pervasive connections among users and resources Wireless ad hoc network is a communication architecture formed without any central administration or infrastructure [] As foreseen in fourth generation (4G) wireless [2], the ad hoc networks will tend to provide seamless radio connectivity within a small physical distance The short-range ad hoc networking received significant attention in relation with Personal Area Networking (PAN) [3] [4] and Bluetooth [5] Some farreaching applications of short-range networking include autonomous networks, smart sensor dust, and amorphous computing The ad hoc networks are rapidly deployed and maintained by the self-organizing actions of the participating devices The overall performance of many envisioned applications in pervasive computing will heavily rely on the promptness of the self-configuring network procedures For example, there will be applications that require fast connection establishment and exchange of relatively small data volume (eg to sensors, actuators etc) In addition, the devices in ad hoc networks are battery-powered, which makes the energy a scarce resource; therefore, all self-configuring actions should be performed under a condition of minimized power consumption By definition, ad hoc networks are started by the constituent devices as anonymous networks, such that when a node is activated, it is not aware of the other active participants Prior to any useful communication, the device should learn the identities (IDs) of the devices within its radio range ie its neighbors Unique ID can be, for example, MAC address, assigned to the device in the manufacturing The procedure, by which each node announces its presence to each neighbor and also detects the presence of all neighbors, is referred to as device discovery (DD) However, when the wireless devices are small, inexpensive, or bulk-produced, they may not possess unique MAC addresses Thus a device announces its presence in a way that is indistinguishable from other devices, eg by sending predefined inquiry packet In such case, the DD procedure should assign unique ad hoc ID to each participating device This procedure is referred to as network initialization [6] As a fundamental task in ad hoc networks, the network initialization has more general implications, since ad hoc IDs may be needed even if the devices possess unique MAC addresses Namely, the ad hoc IDs can be used for further structured access to the communication medium, eg as broadcasting tokens In the following text, the notions device discovery and network initialization will be used interchangeably Compared to the topics in ad hoc networking that traditionally received most attention (eg routing, mobility), the investigation of the device discovery intensified recently, mainly in relation with the topology construction in Bluetooth The proposed discovery procedures [7] [8] are created atop the Bluetooth random-access inquiry mechanisms, which consist of collision avoidance (CA) with fixed random backoff Similar CA method has also been considered for wireless sensor networks [9] The usage of CA with fixed random backoff does not adapt to the number of devices N, whichisassumedtobeapriori unknown in all cases considered here If the fixed backoff window is large, then the delay introduced by DD protocol for small N is excessive; if it is short, the number of collisions for large N is excessive In both cases the energy of the batteries is wasted due to the non-optimal activity of the devices related to the network control functions Another approach to the random access problem, inherently adaptive to the number of participating devices, is the collision-resolution (CR) by stack algorithm (or splitting tree) [] Time-efficient network initialization that uses stack algorithm is reported in [6] However, both in case with and without collision detection capability, the communication model used in [6] assumes that a device is always able to assess its own successful transmission
2 without subsequent acknowledgement Such assumption is viable if the stack algorithm is used as MAC protocol [] in that case, it is always considered that, after a successful reception of the packet, the receiver sends short acknowledgement packet This cannot be assumed for discovery problem, since a transmission of an undiscovered device does not have an intended recipient and the announcement of its presence (by transmission of its ID or inquiry packet) is broadcasted to all active devices In this paper we introduce device discovery protocol based on stack algorithm that solves the problem of broadcast acknowledgements Our proposed algorithm does not require the devices to start the protocol jointly, as considered in [6] As soon as a device becomes active, it gathers information about the current status of the protocol The arriving device joins the network initialization in a way that minimizes the number of collisions in which that device is involved This self-starting property is an important contribution brought by the proposed algorithm, since it should be an essential ingredient of all protocols intended for ad hoc networks PROBLEM STATEMENT, SYSTEM DESCRIPTION AND NOTATION Target applications and scenarios for the short-range wireless ad hoc networks in question include collaborative computing, multimedia classroom, fast initialization of large set of wireless sensors etc Stated more generally, we consider scenarios where a set of N devices is activated within a small spatial range and in a short time interval Hence, it is reasonable to assume a single-hop ad hoc network, such that each device is within a radio range of any other device [6] [7] [8] A newly activated device is uncertain about the total number of devices in the network N as well as the activation instants of still inactive devices The proposed device discovery algorithm is executed in a quasistatic environment, such that an activated device participates in the protocol until its termination At the end of the protocol each device is assigned an ad hoc ID - unique number from o N A device with assigned ad hoc ID will be referred as discovered or initialized In single-hop networks all devices share the same channel and a device announces its presence broadcast on the channel Due to the time-division duplex (TDD) operation of the devices in short-range wireless systems, a successful transmission should be acknowledged by the devices that were in receiving mode during that transmission The proposed protocol is based on the election of a leader the first discovered device, that takes ad hoc ID=, is used to acknowledge the transmissions of non-discovered devices The physical radio channel used for initialization is assumed slotted and all transmissions take place at the slot boundaries [6] The synchrony can be obtained, eg by interfacing a GPS system However, the requirement for synchrony is not restrictive, because the approach presented here can be extended to the non-slotted channel, as it will be seen in the discussion further The propagation delay in the short-range systems is negligible The channel is assumed errorless and the errors in the received packets are always caused by the collision with other packet Let t denote a time slot Each packet used during the protocol has length of a single slot The set of devices that transmit in slot t is denoted by T(t) and the set of devices that listen the channel by R (t) S denotes the number of devices in the set S Let c(t) denote the state of the initialization channel at time slot t, as perceived by the devices in R (t) The TDD operation implies that the devices in T(t) know nothing about c (t) There are two different packet classes that are transmitted during the discovery protocol: inquiry packet (Q-packet) and Acknowledgement packet (A-packet) Q-packet is transmitted by undiscovered device, while A-packets are transmitted by an already elected leader The value of Q- packet may depend on the specific device that sends it eg, it can contain its unique MAC address For the purpose of this algorithm the value of Q-packet is irrelevant; it is only important that it can be differentiated from the A- packets There are 7 different types of A-packets, denoted by A, A,, A 6, which are used by the leader as a feedback information to uninitialized devices The leader uses A-packets to convey network-related information to the devices, such as assigned IDs In total, there are 8 types of packets, such that only 3 bits are needed to discriminate the packet type Adevicein R(t) can perceive c(t) as follows: Idle channel c( t ) = I occurs when no device is transmitting, ie T ( t) = ; Successful reception occurs when T ( t) = In this case c(t) may obtain values Q, A, A,,A 6 ; Collision c( t ) = C occurs when T ( t) > ; The proposed protocol is a randomized distributed algorithm, since at certain instants the participating devices are using coin flipping to make decisions related to the protocol It is assumed that each device has a capability of flipping fair coin independently The outcomes of flipping are denoted and If a set of devices S is allowed to flip fair coin at the beginning of the same slot, then the devices from S are said to belong to the same collision group ALGORITHM DESCRIPTION As soon as a device is activated during the formation of the ad hoc network, it tries to announce its presence and to Three bits can be robustly protected by redundancy (large Hamming distance) and inserted in the packet preamble This justifies the assumption that if there is a single transmission on the channel, the packet type is recognized without error
3 obtain ad hoc ID In the scenarios considered it becomes highly probable that more than two devices will try to transmit Q-packet in the same slot, yielding collision on the channel To cope with this situation, our initialization protocol applies the approach of the non-blocked stack algorithm [] The stack algorithm is only a part of the discovery protocol; the overall algorithm should solve the following problems: () (feedback problem) Since there is not a particular destination, how a successful Q-packet is acknowledged? (2) How a newly activated device learns which are the addresses of already initialized devices? (3) How the devices know when to end the protocol? All three problems are solved by electing the first initialized device (ad hoc ID=) to be leader in the network The leader sends feedback to the devices that attempt to broadcast their presence on the channel and assigns ad hoc ID to the ones that successfully transmit It also keeps track of the discovered MAC addresses as well as the assigned ad hoc IDs The termination of the protocol is handled by the leader by using timeout mechanism: after a device is initialized, if there is no sign of the presence of undiscovered devices for a certain predefined timeout interval, the leader sends special packet on the channel to announce the protocol termination After that, the leader can broadcast all known MAC addresses on the channel, such that each discovered device discovers all other initialized devices The modified stack algorithm is applied after the leader is elected Therefore the overall initialization protocol should be designed in a way that allows a newly activated device to detect the current state of the protocol prior to joining to it The current state refers to whether leader is elected and, if it is, what is the current phase of the stack algorithm If the leader is not elected, then this newly activated device may be a candidate for leader; if the leader is already elected, the device should join to the ongoing stack algorithm to announce itself and to obtain ad hoc ID Although the leader election precedes the stack algorithm, it is more convenient to describe the latter first Stack Algorithm with Elected Leader Assume that leader with ID= is elected The leader keeps track how many devices are already initialized and which ad hoc ID should be assigned next At the time slot t, the devices that are activated, but still not initialized, are grouped in collision groups S (t), S 2 (t), The groups are ordered in a distributed stack, such that S i (t) hasthei-th position in the stack Each activated device determines its collision group by maintaining a marker µ(t) All devices form the collision group S i (t) haveµ(t)=i To illustrate the stack algorithm, suppose that at the start of time slot t all undiscovered devices flip a fair coin in order to decide whether to transmit the Q-packet in t Accordingly, all undiscovered devices belong to the same collision group S (t), having µ ( t) = By flipping a fair coin, the devices start a trial For the purpose of this explanation, the undiscovered devices know that leader is elected and they expect feedback from it We assume that S( t) and the flipping outcome splits the set S (t) intotwosubsets S ( ) and S ( ) The devices from S ( ) transmit Q-packet in the slot t, such that T ( t ) = S ( t ) and S ( t ) R ( t ) Note that the leader is listening the channel whenever it is not sending A-packets If c ( t ) = I, all devices from R(t) conclude that S ( t) = and the splitting of S (t) is considered unsuccessful This fact is announced by the leader in the slot (t+) with c( t + ) = A and the trial ends after two slots If c ( t) I, T ( t + ) = S ( t ) and S ( t ) R ( t + ) Now the leader sends A-packet in slot (t+2), which serves as a feedback to the devices from S ( t ) and S ( t) Based on the type of A packet received, the devices from S ( t ) and S ( t) are either initialized or continue to participate in the stack protocol If a device is initialized (single device in S ( ) or S ( ) ), it takes the ad hoc ID (assigned to it via the A- Table Description of the possible trial outcomes S ( ) S ( ) c(t) c(t+) c(t+2) The effect on the devices in the stack: initialization or change of marker > I A next trial i, S i (t+2)= S i (t) or, equivalently, µ ( t + 2) = µ ( t) for all devices Q I A S ( ) is initialized If µ ( t) >, µ ( t + 3) = µ ( t) Q Q A 2 Both devices from S (t) are initialized If µ ( t) >, µ ( t + 3) = µ ( t) > Q C A 3 S ( ) is initialized, S t + 3) = S ( ) If µ ( t) >, µ ( t + 3) = µ ( t) ( > C I A 4 Unsuccessful trial, µ ( t + 3) = µ ( t) for all devices in the stack > C Q A 5 S ( ) is initialized, S t + 3) = S ( ) If µ ( t) >, µ ( t + 3) = µ ( t) ( 2 > > C C A 6 S ( t + 3) = S ( ), S ( t + 3) = S ( ) If µ ( t) >, µ ( t + 3) = µ ( t) +
4 packet) and leaves the initialization protocol Table describes the possible outcomes of a trial New group in the stack, S 2 (t+3), is created only after A 6 The packets of A, A 3, and A 5, contain a single ad hoc ID, assigned by the leader and the leader increments its ID counter by The packet A 2 contains 2 IDs and the leader s ID counter is incremented by 2 It will be seen from the leader election that the stack algorithm always starts with nonempty group S (t) Now assume that the stack consists of ordered collision groups S (t), S 2 (t),, S K (t) where S ( t) > and S ( t) = for i > K If the trial that starts in t ends with A or A 2,the higher groups from the stack decrease the markers and S 2 (t) starts a trial in (t+3) Using table, it can be proved by induction that if S k ( t) >,then Si ( t) > for all i < k This implies that the algorithm cannot enter into a deadlock it cannot happen that S ( t) while S ( t) > for K = i > If the stack is empty, the unsuccessful trial I, A will repeatedly occur on the channel until a new device arrives Otherwise, the leader timeouts and decides to end the discovery protocol Leader Election Procedure Here we describe the leader election procedure isolated from the whole discovery protocol In the next section the election procedure and the stack algorithm will be merged Assume that election is started in t by a set of devices E(t ), where E ( t ) > Each device from E(t ) is a candidate for leader The device that will first succeed in transmitting Q-packet without collision on a channel will be elected a leader At start of t devices flip a coin and split the set E(t )intotwosetse (t ) and E (t ) Analogously to the stack algorithm, this is a start of election trial Devices from E (t )transmitint,iet(t )=E (t )whiler(t )= E (t ) The following may occur: c(t )=I Devices from E (t ) conclude that E ( t) = and they start a new election trial E(t +)=E (t ); 2 c(t )=Q ThesingledevicefromE (t ) transmits in t and listens the channel in (t +) On the other hand, the device(s) from E (t ), after hearing the Q-packet, they transmit their Q-packets in the slot (t +), to confirm the leadership to the device from E (t ) The device from E (t ) will elect itself a leader after hearing c ( t + ) I, since, by assumption, E (t ) contains at least one device; 3 c(t )=C This implies E ( t) >, such that the devices from E (t ) (if such device exists) will stay silent in slot (t +) Having heard c ( t + ) = I, the devices from E (t ) conclude that E ( t) > and start a new election trial in (t +2) by setting E(t +2)=E (t ) Note that, it may happen that E (t )isempty,ifallfrome(t ) flip Conversely, if E ( t ) >, the device(s) from E (t ) resign from the i i election trial and join to the waiting set W until they hear the first A-packet, since in E (t ) there are enough elements for electing and confirming the leader The start of the stack algorithm is interleaved with the leader election Suppose a leader is elected in a trial that started in t Thenc(t )=Q and the following may occur: c(t +)=Q The leader sends A 2 in slot (t +2), initializing the device that confirmed its leadership Then the devices from W set µ(t +3)= and start a trial from the stack algorithm in (t +3) c(t +)=C The leader sends A 3 in slot (t +2) Then the devices from E (t ) become the first collision group in the stack algorithm at (t +3), ie S (t +3)= E (t ) The devices from W set µ(t +3)=2 become S 2 (t +3) Putting the Pieces Together From the description of the stack algorithm it follows that the A-packets appear as a beaconing on the channel A newly arrived device listens the channel for at most 3 slots: if it does not hear A-packet, it concludes that a leader is not elected and joins to the leader election procedure The device D activates and listens the channel for at least and at most 3 slots in order to make decision how to join the protocol Due to the lack of space, we omit the complete description of the possible channel states that D can detect as well as the proof of correctness for the algorithm Nevertheless, we illustrate the mechanism with example Let s denote the activation slot of D by t 2 Then, if both t 2 and (t 2 +) are idle slots, D starts a leader election process Now suppose that D detects Q-packet in the slot t 2 Having heard only c(t 2 )=Q, the device cannot determine the exact status of the protocol Table 2 describes the actions of D after listening the slots (t 2 +) and (t 2 +2) Table 2 Example rules for joining the initialization c(t 2 ) c(t 2 +) c(t 2 +2) Action Q A 5 joined Set µ(t 2 +2)=2, since S (t 2 +2) > Q A 2 Already Set µ(t 2 +2)= Q I I Join E(t 2 +3) (leader candidate) Q I Q Join E (t 2 +2) (confirm in t 2 +3) Q I C Join W (waiting set) Q I A Set µ(t 2 +2)= Q Q A 2 Set µ(t 2 +2)= Q C A 3 Set µ(t 2 +2)=2 RESULTS Fig depicts the simulation results for the proposed discovery protocol The performance results are represented by the average duration of the discovery protocol, measured in time slots, as a function of the total number of devices in the network - N The activation time of each device, measured relatively to the activation of the first device in
5 Average number of time slots τ= τ=5 τ= Number of devices N Figure Average duration of the discovery protocol as a function of the number of devices the system, is exponentially distributed random variable [7] with mean value τ (in slots) The three curves represent three different values for τ ;whenτ =, all devices are activated in the same slot The timeout value, T out was experimentally chosen to be T out = 5τ, but not less than slots Such choice achieves extremely low probability that the protocol will fail to initialize all devices The results from Fig show that, for low values of τ the average number of time slots needed to execute the discovery protocol depends linearly on the number of the devices As τ grows, this linear function retains the slope for higher values of N Forτ =,atlown the duration of the protocol exhibit slower changes; this is due to the fact that the activations and initializations occur more sparsely in time, such that it is highly probable that a newly activated device will encounter empty stack CONCLUSIONS AND FUTURE WORK The device discovery (network initialization) is a fundamental task in ad hoc network It deploys the network without any predefined infrastructure - a defining property of the ad hoc networks In this paper we have proposed a self-starting discovery protocol The protocol uses leader election in order to solve the problem of broadcast acknowledgement in anonymous networks The collisions among the devices that occur on the shared initialization channel are resolved by modified stack algorithm The stack algorithm is non-blocked, since the devices are allowed to activate in the network at arbitrary instant The simulation results show that the proposed protocol initializes the network in a time that depends linearly on the number of devices in the network Hence, the protocol fulfills its basic task: rapid deployment of the ad hoc network The algorithm presented in this paper is in a basic variant and many issues can be further elaborated Here we sketch a solution for the algorithm if the assumption for slotted channel is removed Then, the leader takes a role of synchronizer - when the leader is elected, the devices that confirm the leadership will synchronize their transmissions with the correctly received Q-packet After that, newly arrived devices will be synchronized by the A-packets The device discovery issue poses challenging questions for further research, just to mention some of them: How the protocol should be modified to work with frequency hopping channels, like in Bluetooth? How to extend the protocol to the multihop radio networks, where all devices do not share the same channel? Will the introduction of channel errors make the protocol design very difficult? The approach used in this self-organizing protocol can be extended beyond the discovery problem to the problem of self-organization at MAC layer in general That is, it is very important how this result can be used for other networkcontrol operations in ad hoc networks, such as hellomessaging, broadcasting etc REFERENCES [] Perkins,CE(Editor),Ad Hoc Networks, Addison- Wesley, (2) [2] Frodigh, M et al, Future-generation wireless networks, IEEE Pers Comm, Vol 8, No5, pp 7, (2) [3] Prasad, R and Gavrilovska, L, Personal Area Networks, EUROCON'2 Intl Conf on Trends in Comm, Slovakia, July (2) [4] Gavrilovska, L and Prasad, R, B-PAN a New Network Paradigm, Proc WPMC, Vol 2, pp 35-4, Aalborg, Denmark, September, (2) [5] Johansson, P et al, Bluetooth: An Enabler For Personal Area Networking, IEEE Network, Vol 5, No 5, pp 28-37, (2) [6] Nakano, K and Olariu, S, Randomized Initialization Protocols for Ad-hoc Networks, IEEE Trans Parallel Distrib Sys, Vol, No 7, pp , (2) [7] Salonidis, T et al, Distributed Topology Construction of Bluetooth Personal Area Networks Proc INFOCOM, Vol 3, pp , (2) [8] C Law and K-Y Siu, A Bluetooth Scatternet Formation Algorithm, Proc GLOBECOM, Vol5, pp , (2) [9] Sohrabi K, et al, Protocols for Self-Organization of a Wireless Sensor Network, IEEE Pers Comm, Vol 7, No 5, pp 6-27, (2) []Bertsekas, D P and Gallager, R G, Data Networks, 2 nd ed, Prentice-Hall, Inc, (99) []Tsybakov, B, "Survey of USSR Contributions to Random Multiple-Access Communications", IEEE Trans Inform Th, Vol IT-3, No 2, pp , (985)
- Cognitive Radio (CR) technology is a promising emerging technology that enables a more efficient usage of
An Asynchronous Neighbor Discovery Algorithm for Cognitive Radio Networks Short Paper Chanaka J. Liyana Arachchige, S. Venkatesan and Neeraj Mittal Erik Jonsson School of Engineering and Computer Science
More informationPerformance of Symmetric Neighbor Discovery in Bluetooth Ad Hoc Networks
Performance of Symmetric Neighbor Discovery in Bluetooth Ad Hoc Networks Diego Bohman, Matthias Frank, Peter Martini, Christoph Scholz Institute of Computer Science IV, University of Bonn, Römerstraße
More informationA Slow-sTart Exponential and Linear Algorithm for Energy Saving in Wireless Networks
1 A Slow-sTart Exponential and Linear Algorithm for Energy Saving in Wireless Networks Yang Song, Bogdan Ciubotaru, Member, IEEE, and Gabriel-Miro Muntean, Member, IEEE Abstract Limited battery capacity
More informationBLUETOOTH is a low-power, open standard for implementing
Proceedings of the 39th Hawaii International Conference on System Sciences - 26 Bluetooth Discovery with Multiple Inquirers Brian S. Peterson, Rusty O. Baldwin, and Richard A. Raines Department of Electrical
More informationPEDAMACS: Power efficient and delay aware medium access protocol for sensor networks
PEDAMACS: Power efficient and delay aware medium access protocol for sensor networks Sinem Coleri and Pravin Varaiya Department of Electrical Engineering and Computer Science University of California,
More informationCSMA/CA. Information Networks p. 1
Information Networks p. 1 CSMA/CA IEEE 802.11 standard for WLAN defines a distributed coordination function (DCF) for sharing access to the medium based on the CSMA/CA protocol Collision detection is not
More informationISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 5, September
Analysis and Implementation of IEEE 802.11 MAC Protocol for Wireless Sensor Networks Urmila A. Patil, Smita V. Modi, Suma B.J. Associate Professor, Student, Student Abstract: Energy Consumption in Wireless
More informationLoad Balancing Routing Algorithm for Data Gathering Sensor Network
Load Balancing Routing Algorithm for Data Gathering Sensor Network Evgeny Bakin, Grigory Evseev State University of Aerospace Instrumentation Saint-Petersburg, Russia {jenyb, egs}@vu.spb.ru Denis Dorum
More informationProtocol Design for Neighbor Discovery in AD-HOC Network
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174 Volume 7, Number 9 (2014), pp. 915-922 International Research Publication House http://www.irphouse.com Protocol Design for
More informationImproving Bluetooth Network Performance Through A Time-Slot Leasing Approach
Improving Bluetooth Network Performance Through A Time-Slot Leasing Approach Wensheng Zhang, Hao Zhu, and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University University
More informationPerformance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc
(International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com
More informationTCOM 370 NOTES 99-12 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL
1. Local Area Networks TCOM 370 NOTES 99-12 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL These are networks spanning relatively short distances (e.g. within one building) for local point-to-point and point-to-multipoint
More informationReal-Time (Paradigms) (51)
Real-Time (Paradigms) (51) 5. Real-Time Communication Data flow (communication) in embedded systems : Sensor --> Controller Controller --> Actor Controller --> Display Controller Controller Major
More informationEPL 657 Wireless Networks
EPL 657 Wireless Networks Some fundamentals: Multiplexing / Multiple Access / Duplex Infrastructure vs Infrastructureless Panayiotis Kolios Recall: The big picture... Modulations: some basics 2 Multiplexing
More informationLocal Area Networks transmission system private speedy and secure kilometres shared transmission medium hardware & software
Local Area What s a LAN? A transmission system, usually private owned, very speedy and secure, covering a geographical area in the range of kilometres, comprising a shared transmission medium and a set
More informationTHE development of media access control (MAC) protocols
710 IEEE JOURNAL OF OCEANIC ENGINEERING, VOL. 32, NO. 3, JULY 2007 UWAN-MAC: An Energy-Efficient MAC Protocol for Underwater Acoustic Wireless Sensor Networks Min Kyoung Park, Member, IEEE, and Volkan
More informationWBAN Beaconing for Efficient Resource Sharing. in Wireless Wearable Computer Networks
Contemporary Engineering Sciences, Vol. 7, 2014, no. 15, 755-760 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2014.4686 WBAN Beaconing for Efficient Resource Sharing in Wireless Wearable
More informationPerformance Evaluation of The Split Transmission in Multihop Wireless Networks
Performance Evaluation of The Split Transmission in Multihop Wireless Networks Wanqing Tu and Vic Grout Centre for Applied Internet Research, School of Computing and Communications Technology, Glyndwr
More informationSELECTIVE ACTIVE SCANNING FOR FAST HANDOFF IN WLAN USING SENSOR NETWORKS
SELECTIVE ACTIVE SCANNING FOR FAST HANDOFF IN WLAN USING SENSOR NETWORKS Sonia Waharte, Kevin Ritzenthaler and Raouf Boutaba University of Waterloo, School of Computer Science 00, University Avenue West,
More informationA Catechistic Method for Traffic Pattern Discovery in MANET
A Catechistic Method for Traffic Pattern Discovery in MANET R. Saranya 1, R. Santhosh 2 1 PG Scholar, Computer Science and Engineering, Karpagam University, Coimbatore. 2 Assistant Professor, Computer
More informationEnhanced Power Saving for IEEE 802.11 WLAN with Dynamic Slot Allocation
Enhanced Power Saving for IEEE 802.11 WLAN with Dynamic Slot Allocation Changsu Suh, Young-Bae Ko, and Jai-Hoon Kim Graduate School of Information and Communication, Ajou University, Republic of Korea
More informationResearch Article ISSN 2277 9140 Copyright by the authors - Licensee IJACIT- Under Creative Commons license 3.0
INTERNATIONAL JOURNAL OF ADVANCES IN COMPUTING AND INFORMATION TECHNOLOGY An international, online, open access, peer reviewed journal Volume 2 Issue 2 April 2013 Research Article ISSN 2277 9140 Copyright
More informationAttenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction
Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit
More informationCollision of wireless signals. The MAC layer in wireless networks. Wireless MAC protocols classification. Evolutionary perspective of distributed MAC
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?
More informationAutoconfiguration and maintenance of the IP address in ad-hoc mobile networks
1 Autoconfiguration and maintenance of the IP address in ad-hoc mobile networks M. Fazio, M. Villari, A. Puliafito Università di Messina, Dipartimento di Matematica Contrada Papardo, Salita Sperone, 98166
More informationADV-MAC: Advertisement-based MAC Protocol for Wireless Sensor Networks
ADV-MAC: Advertisement-based MAC Protocol for Wireless Sensor Networks Surjya Ray, Ilker Demirkol and Wendi Heinzelman Department of Electrical and Computer Engineering University of Rochester, Rochester,
More informationAn Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks *
An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks * Inwhee Joe College of Information and Communications Hanyang University Seoul, Korea iwj oeshanyang.ac.kr Abstract. To satisfy the user requirements
More informationStudent, Haryana Engineering College, Haryana, India 2 H.O.D (CSE), Haryana Engineering College, Haryana, India
Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A New Protocol
More informationDynamic Source Routing in Ad Hoc Wireless Networks
Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3891 dbj@cs.cmu.edu Abstract
More informationVHICLE-TO-VEHICLE (V2V) communication can promote
THE IEEE FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS Space Division Multiple Access (SDMA) for Robust Ad hoc Vehicle Communication Networks Soheila V. Bana, Pravin Varaiya Abstract
More informationA Non-beaconing ZigBee Network Implementation and Performance Study
A Non-beaconing ZigBee Network Implementation and Performance Study Magnus Armholt Email: magnus.armholt@tut.fi Sakari Junnila Email: sakari.junnila@tut.fi Irek Defee Email: irek.defee@tut.fi Abstract
More informationBluetooth networking to get data to a central data sink
Bluetooth networking to get data to a central data sink By: Bradley Clayton Supervised by: Alfredo Terzoli and Peter Wentworth http://www.cs.ru.ac.za/research/students/g01c2974/ g01c2974@campus.ru.ac.za
More informationFRIEND: A PREHANDSHAKING NEIGHBOR DISCOVERY PROTOCOL FOR WIRELESS AD HOC NETWORKS
FRIEND: A PREHANDSHAKING NEIGHBOR DISCOVERY PROTOCOL FOR WIRELESS AD HOC NETWORKS 1 Ramya S, Research scholar, M.Tech CNE (PT), NIE, Mysore 2 Dr. Phaneendra H D, Professor, Dept. of ISE, NIE, Mysore ABSTRACT-
More informationRole of Clusterhead in Load Balancing of Clusters Used in Wireless Adhoc Network
International Journal of Electronics Engineering, 3 (2), 2011, pp. 283 286 Serials Publications, ISSN : 0973-7383 Role of Clusterhead in Load Balancing of Clusters Used in Wireless Adhoc Network Gopindra
More informationA research perspective on the adaptive protocols' architectures and system infrastructures to support QoS in wireless communication systems
Workshop on Quality of Service in Geographically Distributed Systems A research perspective on the adaptive protocols' architectures and system infrastructures to support QoS in wireless communication
More informationWireless Home Networks based on a Hierarchical Bluetooth Scatternet Architecture
Wireless Home Networks based on a Hierarchical Bluetooth Scatternet Architecture W. Lilakiatsakun'. 2, A. Seneviratne' I School of Electrical Engineering and Telecommunication University of New South Wales,
More informationAdaptive DCF of MAC for VoIP services using IEEE 802.11 networks
Adaptive DCF of MAC for VoIP services using IEEE 802.11 networks 1 Mr. Praveen S Patil, 2 Mr. Rabinarayan Panda, 3 Mr. Sunil Kumar R D 1,2,3 Asst. Professor, Department of MCA, The Oxford College of Engineering,
More informationPrediction of DDoS Attack Scheme
Chapter 5 Prediction of DDoS Attack Scheme Distributed denial of service attack can be launched by malicious nodes participating in the attack, exploit the lack of entry point in a wireless network, and
More informationAccelerating Service Discovery in Ad-hoc Zero Configuration Networking
Accelerating Service Discovery in Ad-hoc Zero Configuration Networking Se Gi Hong, Suman Srinivasan and Henning Schulzrinne Columbia University, New York, NY {segihong, sumans, hgs}@cs.columbia.edu Abstract
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey on
More informationMetrics for Detection of DDoS Attacks
Chapter 3 Metrics for Detection of DDoS Attacks The DDoS attacks are trying to interfere with the physical transmission and reception of wireless communications. Attacks are caused by jamming, exhaustion,
More informationRobust protocols for the Industrial Internet of Things
Robust protocols for the Industrial Internet of Things Elvis Vogli Politecnico di Bari,Telematics Lab - Dipartimento di Ingegneria Elettrica e dell Informazione Via Edoardo Orabona 4, 70125 Bari, Italy
More informationLOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS
LOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS Saranya.S 1, Menakambal.S 2 1 M.E., Embedded System Technologies, Nandha Engineering College (Autonomous), (India)
More informationRandom Access Protocols
Lecture Today slotted vs unslotted ALOHA Carrier sensing multiple access Ethernet DataLink Layer 1 Random Access Protocols When node has packet to send transmit at full channel data rate R. no a priori
More informationBehavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols
Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols Purvi N. Ramanuj Department of Computer Engineering L.D. College of Engineering Ahmedabad Hiteishi M. Diwanji
More informationEnergy Effective Routing Protocol for Maximizing Network Lifetime of WSN
Energy Effective Routing Protocol for Maximizing Network Lifetime of WSN Rachana Ballal 1, S.Girish 2 4 th sem M.tech, Dept.of CS&E, Sahyadri College of Engineering and Management, Adyar, Mangalore, India
More informationENHANCING MOBILE PEER-TO-PEER ENVIRONMENT WITH NEIGHBORHOOD INFORMATION
ENHANCING MOBILE PEER-TO-PEER ENVIRONMENT WITH NEIGHBORHOOD INFORMATION Arto Hämäläinen and Jari Porras Lappeenranta University of Technology Laboratory of Communications Engineering P.O. Box 20 53851
More informationA Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks
A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.
More informationEntropy-Based Collaborative Detection of DDoS Attacks on Community Networks
Entropy-Based Collaborative Detection of DDoS Attacks on Community Networks Krishnamoorthy.D 1, Dr.S.Thirunirai Senthil, Ph.D 2 1 PG student of M.Tech Computer Science and Engineering, PRIST University,
More informationRapid Prototyping of a Frequency Hopping Ad Hoc Network System
Rapid Prototyping of a Frequency Hopping Ad Hoc Network System Martin Braun, Nico Otterbach, Jens Elsner, and Friedrich K. Jondral Communications Engineering Lab, Karlsruhe Institute of Technology (KIT),
More informationTransport layer issues in ad hoc wireless networks Dmitrij Lagutin, dlagutin@cc.hut.fi
Transport layer issues in ad hoc wireless networks Dmitrij Lagutin, dlagutin@cc.hut.fi 1. Introduction Ad hoc wireless networks pose a big challenge for transport layer protocol and transport layer protocols
More informationHosts Address Auto Configuration for Mobile Ad Hoc Networks
Hosts Address Auto Configuration for Mobile Ad Hoc Networks Sudath Indrasinghe, Rubem Pereira, Hala Mokhtar School of Computing and Mathematical Sciences Liverpool John Moores University M.P.Indrasinghe@2004.ljmu.ac.uk,
More informationComparison of WCA with AODV and WCA with ACO using clustering algorithm
Comparison of WCA with AODV and WCA with ACO using clustering algorithm Deepthi Hudedagaddi, Pallavi Ravishankar, Rakesh T M, Shashikanth Dengi ABSTRACT The rapidly changing topology of Mobile Ad hoc networks
More informationRT-QoS for Wireless ad-hoc Networks of Embedded Systems
RT-QoS for Wireless ad-hoc Networks of Embedded Systems Marco accamo University of Illinois Urbana-hampaign 1 Outline Wireless RT-QoS: important MA attributes and faced challenges Some new ideas and results
More informationInfluences of Communication Disruptions on Decentralized Routing in Transport Logistics
Influences of Communication Disruptions on Decentralized Routing in Transport Logistics Bernd Scholz-Reiter, Christian Zabel BIBA Bremer Institut für Produktion und Logistik GmbH University of Bremen Hochschulring
More informationCOMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 5 May, 2013 Page No. 1680-1684 COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK ABSTRACT: Mr.Upendra
More informationFigure 1. The Example of ZigBee AODV Algorithm
TELKOMNIKA Indonesian Journal of Electrical Engineering Vol.12, No.2, February 2014, pp. 1528 ~ 1535 DOI: http://dx.doi.org/10.11591/telkomnika.v12i2.3576 1528 Improving ZigBee AODV Mesh Routing Algorithm
More informationA NOVEL OVERLAY IDS FOR WIRELESS SENSOR NETWORKS
A NOVEL OVERLAY IDS FOR WIRELESS SENSOR NETWORKS Sumanta Saha, Md. Safiqul Islam, Md. Sakhawat Hossen School of Information and Communication Technology The Royal Institute of Technology (KTH) Stockholm,
More informationEthernet. Ethernet Frame Structure. Ethernet Frame Structure (more) Ethernet: uses CSMA/CD
Ethernet dominant LAN technology: cheap -- $20 for 100Mbs! first widely used LAN technology Simpler, cheaper than token rings and ATM Kept up with speed race: 10, 100, 1000 Mbps Metcalfe s Etheret sketch
More informationCustomer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4
Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4 Michael Binhack, sentec Elektronik GmbH, Werner-von-Siemens-Str. 6, 98693 Ilmenau, Germany Gerald Kupris, Freescale Semiconductor
More informationCSE331: Introduction to Networks and Security. Lecture 6 Fall 2006
CSE331: Introduction to Networks and Security Lecture 6 Fall 2006 Open Systems Interconnection (OSI) End Host Application Reference model not actual implementation. Transmits messages (e.g. FTP or HTTP)
More informationLANs. Local Area Networks. via the Media Access Control (MAC) SubLayer. Networks: Local Area Networks
LANs Local Area Networks via the Media Access Control (MAC) SubLayer 1 Local Area Networks Aloha Slotted Aloha CSMA (non-persistent, 1-persistent, p-persistent) CSMA/CD Ethernet Token Ring 2 Network Layer
More informationHow To Make A Multi-User Communication Efficient
Multiple Access Techniques PROF. MICHAEL TSAI 2011/12/8 Multiple Access Scheme Allow many users to share simultaneously a finite amount of radio spectrum Need to be done without severe degradation of the
More informationEETS 8316 Wireless Networks Fall 2013
EETS 8316 Wireless Networks Fall 2013 Lecture: WiFi Discovery, Powersave, and Beaconing http://lyle.smu.edu/~skangude/eets8316.html Shantanu Kangude skangude@lyle.smu.edu Discovery and Beaconing Discovery?
More informationDesign and Implementation of Ad-hoc Communication and Application on Mobile Phone Terminals
Design and Implementation of Ad-hoc Communication and Application on Mobile Phone Terminals Yujin Noishiki Hidetoshi Yokota Akira Idoue KDDI R&D Laboratories, Inc. 2-1-15 Ohara, Fujimino-Shi, Saitama,
More informationMedium Access Control with Dynamic Frame Length in Wireless Sensor Networks
Journal of Information Processing Systems, Vol.6, No.4, December 2010 DOI : 10.3745/JIPS.2010.6.4.501 Medium Access Control with Dynamic Frame Length in Wireless Sensor Networks Dae-Suk Yoo* and Seung
More informationAn Overview of ZigBee Networks
An Overview of ZigBee Networks A guide for implementers and security testers Matt Hillman Contents 1. What is ZigBee?... 3 1.1 ZigBee Versions... 3 2. How Does ZigBee Operate?... 3 2.1 The ZigBee Stack...
More informationAn Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs
An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs G.Michael Assistant Professor, Department of CSE, Bharath University, Chennai, TN, India ABSTRACT: Mobility management
More informationCS698T Wireless Networks: Principles and Practice
CS698T Wireless Networks: Principles and Practice Topic 10 IEEE 802.15.4 Bhaskaran Raman, Department of CSE, IIT Kanpur http://www.cse.iitk.ac.in/users/braman/courses/wless-spring2007/ Personal Area Networks
More informationNOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS
NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper
More informationIRMA: Integrated Routing and MAC Scheduling in Multihop Wireless Mesh Networks
IRMA: Integrated Routing and MAC Scheduling in Multihop Wireless Mesh Networks Zhibin Wu, Sachin Ganu and Dipankar Raychaudhuri WINLAB, Rutgers University 2006-11-16 IAB Research Review, Fall 2006 1 Contents
More informationFrom reconfigurable transceivers to reconfigurable networks, part II: Cognitive radio networks. Loreto Pescosolido
From reconfigurable transceivers to reconfigurable networks, part II: Cognitive radio networks Loreto Pescosolido Spectrum occupancy with current technologies Current wireless networks, operating in either
More informationwww.mindteck.com 6LoWPAN Technical Overview
www.mindteck.com 6LoWPAN Technical Overview 6LoWPAN : Slide Index Introduction Acronyms Stack Architecture Stack Layers Applications IETF documents References Confidential Mindteck 2009 2 6LoWPAN - Introduction
More informationECE 358: Computer Networks. Homework #3. Chapter 5 and 6 Review Questions 1
ECE 358: Computer Networks Homework #3 Chapter 5 and 6 Review Questions 1 Chapter 5: The Link Layer P26. Let's consider the operation of a learning switch in the context of a network in which 6 nodes labeled
More informationEECS 122: Introduction to Computer Networks Multiaccess Protocols. ISO OSI Reference Model for Layers
EECS 122: Introduction to Computer Networks Multiaccess Protocols Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720-1776
More informationCS 5480/6480: Computer Networks Spring 2012 Homework 4 Solutions Due by 1:25 PM on April 11 th 2012
CS 5480/6480: Computer Networks Spring 2012 Homework 4 Solutions Due by 1:25 PM on April 11 th 2012 Important: The solutions to the homework problems from the course book have been provided by the authors.
More information802.11 Wireless LAN Protocol CS 571 Fall 2006. 2006 Kenneth L. Calvert All rights reserved
802.11 Wireless LAN Protocol CS 571 Fall 2006 2006 Kenneth L. Calvert All rights reserved Wireless Channel Considerations Stations may move Changing propagation delays, signal strengths, etc. "Non-transitive"
More informationSurvey on Load balancing protocols in MANET S (mobile ad-hoc networks)
Survey on Load balancing protocols in MANET S (mobile ad-hoc networks) Ramandeep Kaur 1, Gagandeep Singh 2, Sahil Vashist 3 1 M.tech Research Scholar, Department of Computer Science & Engineering, Chandigarh
More informationCROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING
CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility
More informationTask-based Self-Organization in Large Smart Spaces: Issues and Challenges 1
Task-based Self-Organization in Large Smart Spaces: Issues and Challenges 1 P. Basu and T.D.C. Little Department of Electrical and Computer Engineering Boston University, Boston, Massachusetts 02215, USA
More informationECE 333: Introduction to Communication Networks Fall 2002
ECE 333: Introduction to Communication Networks Fall 2002 Lecture 14: Medium Access Control II Dynamic Channel Allocation Pure Aloha In the last lecture we began discussing medium access control protocols
More informationA Novel Multi Ring Forwarding Protocol for Avoiding the Void Nodes for Balanced Energy Consumption
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-4 E-ISSN: 2347-2693 A Novel Multi Ring Forwarding Protocol for Avoiding the Void Nodes for Balanced Energy
More informationPerformance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using Directional Antennas
I.J.Computer Network and Information Security, 21, 2, 26-32 Published Online December 21 in MECS (http://www.mecs-press.org/) Performance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using
More informationA Survey: High Speed TCP Variants in Wireless Networks
ISSN: 2321-7782 (Online) Volume 1, Issue 7, December 2013 International Journal of Advance Research in Computer Science and Management Studies Research Paper Available online at: www.ijarcsms.com A Survey:
More informationQUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
More informationDSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks David B. Johnson David A. Maltz Josh Broch Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213-3891
More informationA UBIQUITOUS PROTOCOL FOR ADDRESS DYNAMICALLY AUTO CONFIGURATION FOR MOBILE AD HOC NETWORKS
A UBIQUITOUS PROTOCOL FOR ADDRESS DYNAMICALLY AUTO CONFIGURATION FOR MOBILE AD HOC NETWORKS Chandanpreet Kaur Global Institute of Management and Emerging Technologies, Amritsar, Punjab, India, lpu_chandan@yahoo.co.in
More informationIII. Our Proposal ASOP ROUTING ALGORITHM. A.Position Management
Secured On-Demand Position Based Private Routing Protocol for Ad-Hoc Networks Ramya.R, Shobana.K, Thangam.V.S ramya_88@yahoo.com, k shobsi@yahoo.co.in,thangam_85@yahoo.com Department of Computer Science,
More informationVoice Service Support over Cognitive Radio Networks
Voice Service Support over Cognitive Radio Networks Ping Wang, Dusit Niyato, and Hai Jiang Centre For Multimedia And Network Technology (CeMNeT), School of Computer Engineering, Nanyang Technological University,
More informationIntelligent Agents for Routing on Mobile Ad-Hoc Networks
Intelligent Agents for Routing on Mobile Ad-Hoc Networks Y. Zhou Dalhousie University yzhou@cs.dal.ca A. N. Zincir-Heywood Dalhousie University zincir@cs.dal.ca Abstract This paper introduces a new agent-based
More informationAnalysis of Minimum-Energy Path-Preserving Graphs for Ad-hoc Wireless Networks
Analysis of Minimum-Energy Path-Preserving Graphs for Ad-hoc Wireless Networks Mahmuda Ahmed, Mehrab Shariar, Shobnom Zerin and Ashikur Rahman Department of Computer Science and Engineering Bangladesh
More informationA Novel Approach for Load Balancing In Heterogeneous Cellular Network
A Novel Approach for Load Balancing In Heterogeneous Cellular Network Bittu Ann Mathew1, Sumy Joseph2 PG Scholar, Dept of Computer Science, Amal Jyothi College of Engineering, Kanjirappally, Kerala, India1
More informationOverview of Network Hardware and Software. CS158a Chris Pollett Jan 29, 2007.
Overview of Network Hardware and Software CS158a Chris Pollett Jan 29, 2007. Outline Scales of Networks Protocol Hierarchies Scales of Networks Last day, we talked about broadcast versus point-to-point
More informationMedium Access Control (MAC) Protocols for Ad hoc Wireless Networks - III
Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks - III CS: 647 Advanced Topics in Wireless Networks Drs. Baruch Awerbuch & Amitabh Mishra Department of Computer Science Johns Hopkins
More informationNetworkPathDiscoveryMechanismforFailuresinMobileAdhocNetworks
Global Journal of Computer Science and Technology: E Network, Web & Security Volume 14 Issue 3 Version 1.0 Year 2014 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals
More informationAnalysis of Bluetooth Device Discovery and Some Speedup Mechanisms
Analysis of Bluetooth Device Discovery and Some Speedup Mechanisms Jehn-Ruey Jiang, Bing-Rong Lin, and Yu-Chee Tseng Department of Computer Science and Information Engineering National Central University,
More informationAPPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM
152 APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM A1.1 INTRODUCTION PPATPAN is implemented in a test bed with five Linux system arranged in a multihop topology. The system is implemented
More informationEKSAMEN / EXAM TTM4100 18 05 2007
1.1 1.1.1...... 1.1.2...... 1.1.3...... 1.1.4...... 1.1.5...... 1.1.6...... 1.1.7...... 1.1.8...... 1.1.9...... 1.1.10.... 1.1.11... 1.1.16.... 1.1.12... 1.1.17.... 1.1.13... 1.1.18.... 1.1.14... 1.1.19....
More informationBased on Computer Networking, 4 th Edition by Kurose and Ross
Computer Networks Ethernet Hubs and Switches Based on Computer Networking, 4 th Edition by Kurose and Ross Ethernet dominant wired LAN technology: cheap $20 for NIC first widely used LAN technology Simpler,
More informationHalmstad University Post-Print
Halmstad University Post-Print Wireless Sensor Networks for Surveillance Applications - A Comparative Survey of MAC Protocols Mahmood Ali, Annette Böhm and Magnus Jonsson N.B.: When citing this work, cite
More information