An energy-efficient k-disjoint-path routing algorithm for reliable wireless sensor networks

Authors:
Jang Woon Baek;Young Jin Nam;Dae-Wha Seo
Affiliations:
School of Electrical Eng. & Computer Science, Kyungpook National University;School of Computer & Information Technology, Daegu University;School of Electrical Eng. & Computer Science, Kyungpook National University
Venue:
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Year:
2007

Citing 7
Cited 1

Highly-resilient, energy-efficient multipath routing in wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks

WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
A fast and reliable protocol for wireless sensor networks in critical conditions monitoring applications

MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
GRAdient broadcast: a robust data delivery protocol for large scale sensor networks

Wireless Networks
Real-time volcanic earthquake localization

Proceedings of the 4th international conference on Embedded networked sensor systems
The emergence of networking abstractions and techniques in TinyOS

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1

Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 (k1) 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.