首页 | 本学科首页   官方微博 | 高级检索  
     检索      

无线传感器网络增配节点实现双连通并优化中继路径
引用本文:周应华,蔡雪梅.无线传感器网络增配节点实现双连通并优化中继路径[J].重庆邮电学院学报(自然科学版),2009(3).
作者姓名:周应华  蔡雪梅
作者单位:重庆邮电大学计算机科学与技术学院;重庆邮电大学光电学院;
基金项目:重庆邮电大学科研基金“网络化智能传感器技术研究”
摘    要:对所有节点有统一通信功率和传输半径的无线传感器网络,用平面无向图建模。提出一个基于广度优先的O(n~3)多项式时间搜索算法来发现无线传感器网络中的双连通分量,继而确定网络中所有关节点,然后提出一个最坏情况有O(n~2log(n/3))多项式计算时间的贪心算法来增加尽量少的节点以实现网络双连通,同时,增配节点形成的新路径有助于减少部分节点到汇聚节点的中继跳数。实验结果也验证了以上算法的效果。

关 键 词:无线传感器网络  可靠性  双连通  关节点  节点增配  

Supplement nodes in wireless sensor network to achieve biconnectivity and optimize relay paths
ZHOU Ying-hua,CAI Xue-mei.Supplement nodes in wireless sensor network to achieve biconnectivity and optimize relay paths[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),2009(3).
Authors:ZHOU Ying-hua  CAI Xue-mei
Institution:ZHOU Ying-hua~1,CAI Xue-mei~2 (1.College of Computer Science , Technology,Chongqing University of Posts , Telecommunications,Chongqing 400065,P.R.China,2.College of Optoelectronics,P.R.China)
Abstract:Wireless sensor network with uniform communication power and transmission radius was modeled as planar undirected graph.A search algorithm running in O(n~3) polynomial time was proposed to find all the biconnected components in the wireless sensor network,and then all the articulation points in the network can be found out.A greedy algorithm with worst case O(n~2log(n/3)) polynomial time bound was proposed to supplement nodes as few as possible to achieve network biconnectivity.At the same time,the new path...
Keywords:wireless sensor network  reliability  biconnectivity  articulation point  node supplement  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号