可持续无线传感网络的节点能量补给的研究  

Study on Energy-refueling of Nodes in Survivable WSNs

作　　者：尚光龙[1] 吕争[1] SHANG Guang-long;LV Zheng(School of mathematics and computer science, XinYang Vocational Technical College, Xinyang Henan 464000, Chin)

机构地区：[1]信阳职业技术学院数学与计算机科学学院,河南信阳464000

出　　处：《中国电子科学研究院学报》2018年第2期160-164,共5页Journal of China Academy of Electronics and Information Technology

基　　金：国家自然科学基金(61540055);河南省科技厅重点科技攻关项目(142102210330);河南省教育厅专业综合改革项目(590108)

摘　　要：可持续无线传感网络充分利用了绿色能源,通过部署节点可缓解了节点能量受限和覆盖空洞问题。为此,提出基于最小生成树的能量补给节点部署算法(Minimum spanning Tree-based deploying energy-refuelling Nodes algorithm,MST-DENP)。MST-DENP算法利用无线电给部分节点补给能量,并利用最小生成树部署能量补给节点。先计算各节点能量采集率,然后再构建最小生成树,随后依据最小生成树检测低能量节点,最后在这些低能量附近部署能量补给节点。实验数据表明,提出的MST-DENP算法在维持一定的数据包传递率同时,降低了部署成本。In Survivable wireless sensor networks,it make use of green energy resource,then deploying relay nodes（ RNs） is always way to ensure communication coverage and remit constrained energy issue.Therefore,Minimum spanning Tree-based deploying energy-refuelling nodes algorithm（ MST-DENP） is proposed in this paper. Energy model used in MST-DENP is appropriate to wireless charging. The weights are calculated using the nodes＇ harvesting capacity. The minimum spanning tree is calculation in an edge weighted graph model. Simulation results show that MST-DENP reduces the numbers of energyrefuelling nodes,when ensures packet delivery ratio.

关 键 词：无线传感网 最小生成树 能量补给 KRUSKAL算法 无线充电 

分 类 号：TN929.5[电子电信—通信与信息系统]