Single-link serial Directional Rumor Routing in wireless sensor networks

The Rumor routing is a routing algorithm based on propagating software agents with random motion in wireless sensor networks. Rumor routing schema is based on the encounter of query agents and event propagator agents in sensor field. In this paper, we propose a new approach of rumor routing families that optimizes one of the newly introduced generations of rumor algorithm called Directional Rumor Routing (DRR). In our new approach, serial dispatching of query agents is suggested. Though, the routing energy consumption is reduced, but also some of shortcomings such as delays and path lengths are increased. Therefore, we combined it with single-link clustering method in order to statistically estimate new event area in the network. That is, having used this technique we, successfully, eliminated the aforementioned shortcomings. Simulation results show noticeable improvement in case of average energy consumption, and final route path over DRR.

[1]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[2]  Andrew R. Webb,et al.  Statistical Pattern Recognition , 1999 .

[3]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[4]  A. Nayebi,et al.  Improving Directional Rumor Routing in Wireless Sensor Networks , 2007, 2007 Innovations in Information Technologies (IIT).

[5]  Jan M. Rabaey,et al.  PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking , 2000, Computer.

[6]  Indranil Gupta,et al.  Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[7]  A.T. Haghighat,et al.  Directional rumor routing in wireless sensor networks , 2007, 2007 3rd IEEE/IFIP International Conference in Central Asia on Internet.

[8]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[9]  Anna Hać,et al.  Wireless Sensor Network Designs , 2003 .

[10]  Abbas Nayebi,et al.  New routing framework base on rumor routing in wireless sensor networks , 2009, Comput. Commun..

[11]  H. T. Mouftah,et al.  Localised alpha-shape computations for boundary recognition in sensor networks , 2009, Ad Hoc Networks.

[12]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[13]  Keith Marzullo,et al.  Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks , 1999 .

[14]  Deborah Estrin,et al.  Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks , 2002 .

[15]  Ramesh Govindan,et al.  Localized edge detection in sensor fields , 2003, Ad Hoc Networks.

[16]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[17]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[18]  Anantha Chandrakasan,et al.  Low-power wireless sensor networks , 2001, VLSI Design 2001. Fourteenth International Conference on VLSI Design.

[19]  Anura P. Jayasumana,et al.  Zonal rumor routing for wireless sensor networks , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.