13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Probabilistic Protocols for Node Discovery<strong>in</strong> Ad Hoc Multi-channel Broadcast NetworksG. Alonso 1 , E. Kranakis 2 , C. Sawchuk 2 , R. Wattenhofer 1 , and P. Widmayer 11 Department of <strong>Computer</strong> <strong>Science</strong>, Swiss Federal Institute of Technology, ETHZurich, Switzerland2 School of <strong>Computer</strong> <strong>Science</strong>, Carleton University, Ottawa, ON, K1S 5B6, CanadaAbstract. Ad hoc networks consist of wireless, self-organiz<strong>in</strong>g nodesthat can communicate with each other <strong>in</strong> order to establish decentralizedand dynamically chang<strong>in</strong>g network topologies. Node discovery is afundamental procedure <strong>in</strong> the establishment of an ad hoc network, asa given node needs to discover what other nodes are <strong>in</strong> its communicationrange. Exist<strong>in</strong>g multi-channel node discovery protocols are typicallyconstra<strong>in</strong>ed <strong>by</strong> the network configuration that will be imposed on thenodes once they are discovered. We present a communication model thatis <strong>in</strong>dependent of the network configuration that will be established afternode discovery. We present a pair of node discovery protocols fork ≥ 2 nodes <strong>in</strong> a multi-channel system and analyze them us<strong>in</strong>g the givencommunication model.1 IntroductionAd hoc networks consist of wireless, self-organiz<strong>in</strong>g nodes that can communicatewith each other <strong>in</strong> order to establish decentralized and dynamically chang<strong>in</strong>gnetwork topologies. S<strong>in</strong>ce these networks are an <strong>in</strong>tegral part of the new wirelesssolutions sought for home or personal area networks, sensor networks, and variousother commercial and educational networks, elim<strong>in</strong>at<strong>in</strong>g the shortcom<strong>in</strong>gsof ad hoc networks is an important goal <strong>in</strong> network research [12].Before a node can communicate with the other nodes <strong>in</strong> its communicationrange, it must be aware of those nodes and thus node discovery is an essentialpart of the rendezvous layer for any node that engages <strong>in</strong> ad hoc network formation[16]. Efficient network formation requires that the rendezvous layer beable to f<strong>in</strong>d all nodes <strong>in</strong> communication range <strong>in</strong> the shortest time and withthe smallest energy expenditure possible. Obviously, the complexity of node discoveryis a function of both the number of nodes present and the number ofcommunication channels available to these nodes. Until recently, nearly all adhoc networks were formed <strong>by</strong> nodes that used s<strong>in</strong>gle channel technology such as802.11 or IR LANs and thus most of the research about node discovery <strong>in</strong> ad hocnetworks assumes there is a s<strong>in</strong>gle broadcast channel [15]. The <strong>in</strong>troduction ofBluetooth [8], however, has boosted <strong>in</strong>terest <strong>in</strong> node discovery <strong>in</strong> multi-channelsystems with frequency-hopp<strong>in</strong>g. Such research is especially important s<strong>in</strong>ce theS. Pierre, M. Barbeau, and E. Kranakis (Eds.): ADHOC-NOW 2003, LNCS <strong>2865</strong>, pp. 104–115, 2003.c○ Spr<strong>in</strong>ger-Verlag Berl<strong>in</strong> Heidelberg 2003

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!