期刊文献+

基于点割集的无线带状传感网分布式寿命预测算法

A Distributed Vertex Cut-set Based Algorithm for Network Lifetime Estimation in Strip-based Wireless Sensor Networks
下载PDF
导出
摘要 无线带状传感网是一种典型传感网应用模式,现有的网络生存时间模型大多面向特定的布设模型和工作模式,不能直接应用于带状传感网寿命预测。该文提出一种基于点割集的带状网分布式寿命预测算法。该算法仅利用邻居节点的位置和剩余生存时间等局部信息求解点割集及局部网络生存时间,通过相邻节点间交互包含局部网络生存时间的信令,估计整个网络的剩余生存时间。仿真结果表明,与现有基于梯度的网络生命估计算法相比,该文算法能准确且实时地估计网络的生存时间。 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.
出处 《电子与信息学报》 EI CSCD 北大核心 2010年第11期2599-2605,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(60970137) 国家科技重大专项(2009ZX03006-006) 中国科学院知识创新工程重要方向性项目(KGCX2-YW-120 KZCX1-YW-14-4-1)资助课题
关键词 无线带状传感网 生存时间 点割集 Strip-based wireless sensor network Lifetime Vertex cut-set
  • 相关文献

参考文献11

  • 1Isabel D and Falko D. On the lifetime of wireless sensor networks[J]. ACM Transactions on Sensor Networks, 2009, 5(1): 125-163.
  • 2Jung D, Teixeira T, and Savvides A. Sensor node lifetime analysis models and tools[J]. ACM Transactions on Sensor Networks, 2009, 5(1): 64-96.
  • 3Wang 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. 被引量:11
  • 5Zhang 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.
  • 6Tan 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.
  • 7Li 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.
  • 8Al-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.
  • 9Patvardhan C, Prasad V C, and Pren Pyara V. Vertex cutsets of undirected graphs[J]. IEEE Transactions on Reliability, 1995, 44(2): 347-353.
  • 10Shin Yong Yeon and Kon Jai Sang. An algorithm for generating minimal cutsets of undirected graphs[J]. Korean d. Computer and Appl. Math, 1998, 5(3): 681-693.

二级参考文献12

  • 1Ahmed A and Mohamed Y. A survey on clustering algorithms for wireless sensor networks. Comput. Commun., 2007, 30(14-15): 2826-2841.
  • 2Heinzelman W R, Chandrakasan A, and Balakrishnan H. Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, Hawaii, 2000: 10-15.
  • 3Younis O and Fahmy S. HEED: A hybrid, energy-efficient, distributed clustering approach for Ad hoc sensor networks. IEEE Trans. on Mobile Computing, 2004, 3(4): 366-379.
  • 4Chan H and Perrig A. ACE: An Emergent Algorithm for Highly Uniform Cluster Formation. in Wireless Sensor Networks: First European Workshop, EWSN 2004, Berlin,2004.
  • 5Wang Y, Zhao Q, and Zheng D. Energy-driven adaptive clustering data collection protocol in wireless sensor networks. In International Conference on Intelligent Mechatronics and Automation, Chengdu, 2004: 599-604.
  • 6Gamwarige S and Kulasekere E. An algorithm for energy driven cluster head rotation in a distributed wireless sensor network. In Proceedings of the International Conference on Information and Automation(ICIA2005), Hong Kong, 2005: 354-359.
  • 7Gamwarige S and Kulasekere C. Optimization of cluster head rotation in energy constrained wireless sensor networks. In IFIP International Conference on Wireless and Optical Communications Networks,WOCNV07, Singapore, 2007: 1-5.
  • 8Wu Y, Chen Z, and Jing Q, et al.. LENO: LEast rotation near-optimal cluster head rotation strategy in wireless sensor networks. In 21st International Conference on Advanced Networking and Applications, AINAW07, Canada, 2007: 195-201.
  • 9Su H and Zhang X. Energy-efficient clustering system model and reconfiguration schemes for wireless sensor networks. In Proc. 40th Conference on Information Sciences and Systems (CISS 2006), Princeton, 2006: 99-104.
  • 10Foss S G and Zuyev S A. On a Voronoi Aggregative Process Related to a Bivariate Poisson Process. Advances in Applied Probability, 1996, 28(4): 965-981.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部