Effective Lifetime-Aware Routing in Wireless Sensor Networks

Lifetime-aware routing and desired sensing spatial coverage (SSC) are two main challenges ahead of an ad-hoc, sensor-based, battery operated monitoring system known as wireless sensor network (WSN). Depending on the application, a necessary SSC level is essential to comply with the needed surveillan...

Full description

Saved in:
Bibliographic Details
Published in:IEEE sensors journal 2011-12, Vol.11 (12), p.3359-3367
Main Authors: Karkvandi, H. R., Pecht, E., Yadid-Pecht, O.
Format: Article
Language:English
Subjects:
Algorithms
Batteries
Computer networks
Confidence intervals
Criteria
Lifetime aware routing
Linear programming
Logic gates
Mathematical analysis
Monitoring
Monitoring systems
Networks
Routing (telecommunications)
sensing spatial coverage
Sensors
Studies
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Lifetime-aware routing and desired sensing spatial coverage (SSC) are two main challenges ahead of an ad-hoc, sensor-based, battery operated monitoring system known as wireless sensor network (WSN). Depending on the application, a necessary SSC level is essential to comply with the needed surveillance quality. On the other hand, network lifetime is of a major concern due to limited energy available to each sensor node. Formerly proposed lifetime-aware routing algorithms have usually defined lifetime as the duration before the first node runs out of energy. This criterion is not consistent with real-world WSN, where a number of sensors are likely to "die" due to hardware failures, natural impacts, etc. Initially, we propose a method that determines the network resource specifications, i.e., the number of available nodes and their sensing range, according to the required SSC and the necessary confidence level. Later on, a novel lifetime criterion which considers the SSC as the WSN effective operation criterion is introduced. Afterward, the new criterion is embedded into the flow augmentation algorithm and the normalized network lifetime is calculated for several scenarios using the solutions of the corresponding linear programming equations. Simulation results show significant improvement achieved in the lifetime. It is also shown that this new method is considerably more robust to the routing algorithm parameters compared to the performance achieved by the published Flow Augmentation algorithm.
ISSN:1530-437X
1558-1748
DOI:10.1109/JSEN.2011.2159110