Survey: Discovery in Wireless Sensor Networks

Neighbor discovery is a component of communication and access protocols for ad hoc networks. Wireless sensor networks often must operate under a more severe low-power regimen than do traditional ad hoc networks, notably by turning off radio for extended periods. Turning off a radio is problematic for neighbor discovery, and a balance is needed between adequate open communication for discovery and silence to conserve power. This paper surveys recent progress on the problems of neighbor discovery for wireless sensor networks. The basic ideas behind these protocols are explained, which include deterministic schedules of waking and sleeping, randomized schedules, and combinatorial methods to ensure discovery.

[1]  Rafail Ostrovsky,et al.  Near-Optimal Radio Use for Wireless Network Synchronization , 2009, ALGOSENSORS.

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

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

[4]  Karthik Lakshmanan,et al.  U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol , 2010, IPSN '10.

[5]  Matt Welsh,et al.  Simulating the power consumption of large-scale sensor network applications , 2004, SenSys '04.

[6]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[7]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[8]  David E. Culler,et al.  Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications , 2008, SenSys '08.

[9]  David E. Culler,et al.  Versatile low power media access for wireless sensor networks , 2004, SenSys '04.

[10]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[11]  Yu-Chee Tseng,et al.  Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks , 2003, Comput. Networks.

[12]  David E. Culler,et al.  The dynamic behavior of a data dissemination protocol for network programming at scale , 2004, SenSys '04.

[13]  Robin Kravets,et al.  MobiCom 2010 Poster : SearchLight : Asynchronous Neighbor Discovery using Systematic Probing , 2011 .

[14]  Andrzej Pelc,et al.  The wakeup problem in synchronous broadcast systems (extended abstract) , 2000, PODC '00.

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

[16]  John S. Heidemann,et al.  Ultra-low duty cycle MAC with scheduled channel polling , 2006, SenSys '06.

[17]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[18]  Paul M. B. Vitányi,et al.  Distributed match-making , 1988, Algorithmica.

[19]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[20]  Timo Hämäläinen,et al.  Energy-efficient neighbor discovery protocol for mobile wireless sensor networks , 2009, Ad Hoc Networks.

[21]  Sriram V. Pemmaraju,et al.  Temporal Partition in Sensor Networks , 2007, SSS.

[22]  E. F. Moore.  The firing squad synchronization problem , 1964 .

[23]  Stevan M. Berber,et al.  Analysis of Neighbor Discovery Protocols for Energy Distribution Estimations in Wireless Sensor Networks , 2008, 2008 IEEE International Conference on Communications.

[24]  Donald F. Towsley,et al.  Neighbor discovery in wireless networks and the coupon collector's problem , 2009, MobiCom '09.

[25]  Andrzej Pelc,et al.  The Wakeup Problem in Synchronous Broadcast Systems , 2000, SIAM J. Discret. Math..