On the impact of neighborhood discovery on geographical routing in wireless sensor networks

In Wireless Sensor Networks (WSNs), sensing nodes operate in dynamic environments resulting in neighboring nodes being discovered or lost at any moment causing the network topology to change constantly. Hence, routing schemes especially geographical ones (which use node positions to route data packets) require periodic exchange of control packets to discover neighboring nodes. Even though it is intuitive that the overhead caused by their periodic broadcasts may affect the end-to-end performance of the routing scheme, previous works have not thoroughly studied the impact of transmission power and frequency of control packets in static as well as mobile environments. Hence, based on our study, Distributed Neighborhood Discovery Protocol (DNDP) is proposed that can make online decisions to find the best transmit power and frequency for sending discovery packets so to minimize the effect on routing.

[1]  Dario Pompili,et al.  Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks , 2006, MobiCom '06.

[2]  Dario Pompili,et al.  On the interdependence of distributed topology control and geographical routing in ad hoc and sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[3]  Chris Blondia,et al.  Analyzing the Impact of Neighbor Sensing on the Performance of the OLSR protocol , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

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

[5]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[6]  Daniel Porto,et al.  A Scalable Neighborhood Discovery Protocol for Infrastructure Wireless Mesh Networks , 2009, 2009 Second International Conference on Advances in Mesh Networks.