An asynchronous neighbor discovery algorithm for wireless sensor networks

We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are ''neighbors'' in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is presented that permits each node in the network to develop a list of its neighbors, which may be incomplete. The algorithm is analyzed and parameter settings are derived which maximize the fraction of neighbors discovered in a fixed running time. A companion distributed algorithm is also described which allows all the nodes in the network to execute that neighbor discovery algorithm without the need to agree on a common start time.

[1]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[2]  Donald F. Towsley,et al.  On neighbor discovery in wireless networks with directional antennas , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Steven A. Borbash.  Design considerations in wireless sensor networks , 2004 .

[4]  Stephan Olariu,et al.  Energy-efficient initialization protocols for radio networks with no collision detection , 2000, Proceedings 2000 International Conference on Parallel Processing.

[5]  Stephan Olariu,et al.  Randomized Initialization Protocols for Ad Hoc Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[6]  Steven A. Borbash,et al.  Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks , 2001, MobiHoc '01.

[7]  Thomas Narten,et al.  Neighbor Discovery for IP Version 6 (IPv6) , 1996, RFC.

[8]  G. Grisetti,et al.  Further Reading , 1984, IEEE Spectrum.

[9]  Stephan Olariu,et al.  Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection , 2000, IEEE Trans. Parallel Distributed Syst..

[10]  Thomas Narten,et al.  Neighbor Discovery for IP Version 6 , 1998 .

[11]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[13]  Bernard Fino,et al.  Multiuser detection: , 1999, Ann. des Télécommunications.

[14]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[15]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[16]  Steve Vinoski.  Service discovery 101 , 2003, IEEE Internet Computing.

[17]  Gregory J. Pottie,et al.  Performance of a novel self-organization protocol for wireless ad-hoc sensor networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[18]  Rong Zheng,et al.  Asynchronous wakeup for ad hoc networks , 2003, MobiHoc '03.