An Energy-Efficient k -Disjoint-Path Routing Algorithm for Reliable Wireless Sensor Networks

Wireless sensor networks are subject to sensor node and link failures due to various reasons. This paper proposes an energy-efficient, k-disjoint-path routing algorithm that adaptively varies the number of disjoint paths (k) according to changing data patterns and a target-delivery ratio of critical events. The proposed algorithm sends packets through a single path (k=1) under no occurrence of critical events, whereas it sends through k disjoint paths (k>1) under the occurrence of critical events, where k is computed from a welldefined fault model and the target delivery ratio. Note that the proposed algorithm detects the occurrence of critical events by monitoring changing data patterns. Our simulations reveal that the proposed algorithm not only guarantees the target delivery ratio as much as a multi-path routing algorithm, but also makes energy consumption and average delay as low as a single-path routing algorithm.

[1]  Azzedine Boukerche,et al.  A fast and reliable protocol for wireless sensor networks in critical conditions monitoring applications , 2004, MSWiM '04.

[2]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[3]  L. Gatani,et al.  Robust data gathering for wireless sensor networks , 2005, 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic.

[4]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[5]  Yaping Li,et al.  ARRIVE: Algorithm for Robust Routing in Volatile Environments , 2003 .

[6]  David E. Culler,et al.  Supporting aggregate queries over ad-hoc wireless sensor networks , 2002, Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications.

[7]  Matt Welsh,et al.  Real-time volcanic earthquake localization , 2006, ACM International Conference on Embedded Networked Sensor Systems.

[8]  David E. Culler,et al.  The Emergence of Networking Abstractions and Techniques in TinyOS , 2004, NSDI.

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

[10]  Di Tian,et al.  Energy efficient routing with guaranteed delivery in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[11]  Songwu Lu,et al.  GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks , 2005, Wirel. Networks.

[12]  Billie F. Spencer,et al.  A study on building risk monitoring using wireless sensor network MICA mote , 2003 .

[13]  Dae-Wha Seo,et al.  ATS-DA: Adaptive Timeout Scheduling for Data Aggregation in Wireless Sensor Networks , 2007, ICOIN.

[14]  Sang Hyuk Son,et al.  Event Detection Services Using Data Service Middleware in Distributed Sensor Networks , 2003, Telecommun. Syst..

[15]  Joseph Polastre,et al.  Algorithm for Robust Routing in Volatile Environments , 2003 .

[16]  Shivakant Mishra,et al.  A Robust and Light-Weight Routing Mechanism for Wireless Sensor Networks , 2004 .