MND: An Information of Detected Neighbors Based Multi-channel Neighbor Discovery Protocol for Wireless Sensor Networks

Multi-channel neighbor discovery protocol based on information of detected neighbors for wireless sensor networks is proposed in this paper, called MND. To make sure that the discovery among nodes is as quick as possible, MND uses the schedule mechanism in which the nodes compute the potential neighbors set so as to calculate the sleep and wake schedule of the node. To minimize the influence of channel conflict to the performance, MND uses multi-channel mechanism and calculates the required total number of channels according to the duty cycle and network density. Through analysis, we can get how to choose the total number of channels for each node and the fact that the common neighbor node of the neighbors of a node is the neighbor of this node in a large probability. The simulation and test-bed experiment results show the discovery rate and discovery latency of MND is higher and lower, respectively.

[1]  Binoy Ravindran,et al.  Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks , 2010, IEEE Transactions on Computers.

[2]  Margaret Martonosi,et al.  Implementing software on resource-constrained mobile sensors: experiences with Impala and ZebraNet , 2004, MobiSys '04.

[3]  Shivakant Mishra,et al.  CenWits: a sensor-based loosely coupled search and rescue system using witnesses , 2005, SenSys '05.

[4]  Jie Liu,et al.  WiFlock: Collaborative group discovery and maintenance in mobile sensor networks , 2011, Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks.

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

[6]  Mirco Musolesi,et al.  Sensing meets mobile social networks: the design, implementation and evaluation of the CenceMe application , 2008, SenSys '08.

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

[8]  Emiliano Miluzzo,et al.  The BikeNet mobile sensing system for cyclist experience mapping , 2007, SenSys '07.

[9]  Mehedi Bakht Searchlight: A Systematic Probing-based Asynchronous Neighbor Discovery Protocol , 2010 .

[10]  Yu-Chee Tseng,et al.  Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Margaret Martonosi,et al.  Hardware design experiences in ZebraNet , 2004, SenSys '04.

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

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

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

[15]  Adam Wolisz,et al.  Optimized asynchronous multi-channel neighbor discovery , 2011, 2011 Proceedings IEEE INFOCOM.