首页 | 官方网站   微博 | 高级检索  
     

可持续WSN中基于能量采集感知的中继节点部署算法
引用本文:吕志恒.可持续WSN中基于能量采集感知的中继节点部署算法[J].传感技术学报,2018,31(5):792-796.
作者姓名:吕志恒
作者单位:永城职业学院信息工程系,河南 永城,476600
摘    要:基于可持续无线传感网络WSNs(Wireless Sensor Networks),提出基于能量采集感知的中继节点部署EHA-DRN(Energy Harvesting Aware-based Deploying Relay Nodes algorithm)算法.EHA-DRN算法利用功率beacon包给网络内节点补给能量.先依据节点的能量采集率,计算边权重,再利用克鲁斯卡尔(Kruskal)算法构建最小生成树.然后,依据最小生成树,检测不能完成数据传输任务的低能量节点.最后,在这些节点附近部署中继节点,从而修复覆盖空洞,保持网络连通.实验数据表明,与MBA算法相比,提出的EHA-DRN算法降低了部署成本,并提高了数据包传递率.

关 键 词:可持续无线传感网  中继节点  最小生成树  能量采集率  克鲁斯卡尔算法  survivable  wireless  sensor  networks  relay  nodes  minimum  spanning  tree  harvesting  capacity  Kruskal  algorithm

Energy Harvesting Aware Minimum Spanning Tree-based deploying Relay Nodes algorithm for Survivable WSNs
Lü Zhiheng.Energy Harvesting Aware Minimum Spanning Tree-based deploying Relay Nodes algorithm for Survivable WSNs[J].Journal of Transduction Technology,2018,31(5):792-796.
Authors:Lü Zhiheng
Abstract:For survivable wireless Sensor Networks, Energy Harvesting Aware-based deploying Relay Nodes algorithm( EHA-DRN) is proposed in this paper. In EHA-DRN,the energy of nodes is supplied by power beacon. The edge weight is computed by the nodes' harvesting capacity,and the Minimum Spanning Tree is constructed by Kruskal Algorithm. Then, according to Minimum Spanning Tree, the nodes cannot meet the defined survivability condition are discovered,finally,RNs are added and deployed. Simulation results show that EHA-DRN reduce the cost and improve the packet delivery raito,compared with MBA algorithm
Keywords:Wireless Sensor Networks  Relay Nodes  Minimum Spanning Tree  Harvesting Capacity  Wireless Charging
本文献已被 万方数据 等数据库收录!
点击此处可从《传感技术学报》浏览原始摘要信息
点击此处可从《传感技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号