A Distributed Vertex Cut-set Based Algorithm for Network Lifetime Estimation in Strip-based Wireless Sensor Networks

Wu  Ming-Juan; Zhang  Bao-Xian; Huang  He-Qing; Wang  Hai-Lin; Liu  Hai-Tao

doi:10.3724/SP.J.1146.2009.01504

Volume 32 Issue 11

Dec. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2010 > 32(11): 2599-2605

Wu Ming-Juan, Zhang Bao-Xian, Huang He-Qing, Wang Hai-Lin, Liu Hai-Tao. A Distributed Vertex Cut-set Based Algorithm for Network Lifetime Estimation in Strip-based Wireless Sensor Networks[J]. Journal of Electronics & Information Technology, 2010, 32(11): 2599-2605. doi: 10.3724/SP.J.1146.2009.01504

Citation:

Wu Ming-Juan, Zhang Bao-Xian, Huang He-Qing, Wang Hai-Lin, Liu Hai-Tao. A Distributed Vertex Cut-set Based Algorithm for Network Lifetime Estimation in Strip-based Wireless Sensor Networks[J]. Journal of Electronics & Information Technology, 2010, 32(11): 2599-2605. doi: 10.3724/SP.J.1146.2009.01504

Citation:

Wu Ming-Juan, Zhang Bao-Xian, Huang He-Qing, Wang Hai-Lin, Liu Hai-Tao. A Distributed Vertex Cut-set Based Algorithm for Network Lifetime Estimation in Strip-based Wireless Sensor Networks[J]. Journal of Electronics & Information Technology, 2010, 32(11): 2599-2605. doi: 10.3724/SP.J.1146.2009.01504

PDF( 327 KB)

A Distributed Vertex Cut-set Based Algorithm for Network Lifetime Estimation in Strip-based Wireless Sensor Networks

doi: 10.3724/SP.J.1146.2009.01504

Received Date: 2009-11-24
Rev Recd Date: 2010-04-09
Publish Date: 2010-11-19

Abstract

Abstract

Strip-based wireless sensor network is a typical application of wireless sensor network (WSN). Existent the network lifetime model is primarily focused on specific distribution and working model, which can not be applied to the lifetime estimation in strip-based WSN directly. This paper proposes a distributed vertex cut-set computing algorithm to forecast the lifetime of a strip-based WSN. According to this algorithm, each node only computes a near-minimum vertex cut-set and its local residual lifetime with the assistance of position information and residual lifetime information of neighboring nodes, and then exchange signaling messages carrying such local estimated residual lifetime for computing the residual lifetime of the whole network. Simulation results show that, compared to previous gradient-based lifetime estimating algorithm, the proposed algorithm can estimate the network lifetime in real-time and also more accurately.
- Strip-based wireless sensor network,
- Lifetime,
- Vertex cut-set

FullText(HTML)

References(1)

References

Isabel D and Falko D. On the lifetime of wireless sensor networks[J]. ACM Transactions on Sensor Networks, 2009, 5(1): 125-163.[2]Jung D, Teixeira T, and Savvides A. Sensor node lifetime analysis models and tools[J]. ACM Transactions on Sensor Networks, 2009, 5(1): 64-96.[3]Wang De-min, Xie Bin, and Agrawal D P. Coverage and lifetime optimization of wireless sensor networks with Gaussian distribution[J].IEEE Transactions on Mobile Computing.2008, 7(12):1444-1458[4]黄河清，沈杰，姚道远等. 无线传感网自适应能量驱动簇头轮换算法研究[J].电子与信息学报.2009, 31(5):1040-1044浏览Huang He-qing, Shen Jie, and Yao Dao-yuan, et al.. An energy-driven adaptive cluster head rotation algorithm for wireless sensor networks[J].Journal of Electronics Information Technology.2009, 31(5):1040-1044[5]Zhang Rui-hua, Yuan Dong-feng, and Liang Quan-quan. Analysis of the lifetime of large wireless sensor networks[C]. International Conference on Wireless Communications, Networking and Mobile Computing, Shanghai, China, Sept. 2007: 2576-2579.[6]Tan Zhi-bin. Minimal cut sets of s-t networks with k-out-of-n nodes[J].Reliability Engineering and System Safety.2003, 82(1):49-54[7]Li Wing-ning. An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization[C]. ACM symposium on Applied Computing, Nashville, Tennessee, USA, Feb. 1995: 56-60.[8]Al-Ghanim A M. A heuristic technique for generating minimal path and cutsets of a general network[J].Computers and Industrial Engineering.1999, 36(1):45-55[9]Patvardhan C, Prasad V C, and Pren Pyara V. Vertex cutsets of undirected graphs[J].IEEE Transactions on Reliability.1995, 44(2):347-353[10]Shin Yong Yeon and Kon Jai Sang. An algorithm for generating minimal cutsets of undirected graphs[J]. Korean J. Computer and Appl. Math, 1998, 5(3): 681-693.[11]Kumar S, Lai T H, and Arora A. Barrier coverage with wireless sensors[C]. Proceedings of the 11th annual international conference on Mobile computing and networking, Cologne, Germany, Aug. 2005: 284-298.

Relative Articles

Supplements(0)

Cited By

Proportional views