Effective Lifetime-Aware Routing in Wireless Sensor Networks

被引:55
作者
Karkvandi, Hamid Rafiei [1 ]
Pecht, Efraim [2 ]
Yadid-Pecht, Orly
机构
[1] Univ Calgary, Integrated Sensors Intelligent Syst ISIS Lab, Elect & Comp Engn Dept, Calgary, AB T2N 1N4, Canada
[2] Technol & Beyond Inc, Calgary, AB, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Lifetime aware routing; sensing spatial coverage; wireless sensor networks; COVERAGE;
D O I
10.1109/JSEN.2011.2159110
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:3359 / 3367
页数:9
相关论文
共 20 条
  • [11] Kwang-Ryoul Kim, 2008, Proceedings of the 3rd International Symposium on Wireless Pervasive Computing (ISWPC 2008), P557, DOI 10.1109/ISWPC.2008.4556270
  • [12] Lazos L, 2006, 2006 4TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS, VOLS 1 AND 2, P76
  • [13] Liu B., 2005, P INT S MOB AD HOC N, P300, DOI DOI 10.1145/1062689.1062728
  • [14] Meguerdichian S, 2001, IEEE INFOCOM SER, P1380, DOI 10.1109/INFCOM.2001.916633
  • [15] Shah-Mansouri V, 2007, GLOB TELECOMM CONF, P598
  • [16] Lexicographically Optimal Routing for wireless Sensor Networks With Multiple Sinks
    Shah-Mansouri, Vahid
    Mohsenian-Rad, Amir-Hamed
    Wong, Vincent W. S.
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2009, 58 (03) : 1490 - 1500
  • [17] Shakkottai S, 2003, IEEE INFOCOM SER, P1073
  • [18] Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
    Toh, CK
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2001, 39 (06) : 138 - 147
  • [19] Coverage by randomly deployed wireless sensor networks
    Wan, Peng-Jun
    Yi, Chih-Wei
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) : 2658 - 2669
  • [20] Zou Y, 2003, IEEE INFOCOM SER, P1293