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

基于小结构体的无线传感器网络部署算法
引用本文:史佳琦,谭励,唐小江,连晓峰,王浩宇.基于小结构体的无线传感器网络部署算法[J].计算机应用,2020,40(7):2033-2037.
作者姓名:史佳琦  谭励  唐小江  连晓峰  王浩宇
作者单位:北京工商大学 计算机与信息工程学院, 北京 100048
基金项目:北京市自然科学基金-海淀原始创新联合基金资助项目(L182007);国家自然科学基金(61702020)及其配套项目(PXM2018_014213_000033)。
摘    要:目前无线传感器网络中节点的部署主要采用基于Voronoi图的算法,在使用Voronoi算法进行部署的过程中由于参与部署的节点数量多,算法的复杂度高,导致算法的迭代时间较长。为解决节点部署中算法迭代时间较长的问题,提出一种基于小结构体的部署算法(DABA)。首先,将节点组合成小结构体;然后,计算小结构体的中心位置坐标;最后,利用Voronoi图进行节点部署。所提算法对于部署区域存在障碍的情况仍然能有效进行部署。实验结果表明,DABA在部署时间方面能够比基于Voronoi图的算法减少三分之二。所提算法可明显减少算法的迭代时间,同时降低算法的复杂性。

关 键 词:小结构体  Voronoi图  覆盖率  移动距离  迭代时间  
收稿时间:2020-01-02
修稿时间:2020-02-27

Wireless sensor network deployment algorithm based on basic architecture
SHI Jiaqi,TAN Li,TANG Xiaojiang,LIAN Xiaofeng,WANG Haoyu.Wireless sensor network deployment algorithm based on basic architecture[J].journal of Computer Applications,2020,40(7):2033-2037.
Authors:SHI Jiaqi  TAN Li  TANG Xiaojiang  LIAN Xiaofeng  WANG Haoyu
Affiliation:School of Computer and Information Engineering, Beijing Technology and Business University, Beijing 100048, China
Abstract:At present, the deployment of nodes in wireless sensor network mainly adopts the algorithm based on Voronoi diagram. In the process of deployment using Voronoi algorithm, due to the large number of nodes involved in the deployment and the high complexity of the algorithm, the iteration time of the algorithm is long. In order to solve the problem of long iteration time in node deployment, a Deployment Algorithm based on Basic Architecture (DABA) was proposed. Firstly the nodes were combined into basic architectures, then center position coordinates of the basic architecture were calculated, finally the node deployment was performed by using Voronoi diagram. The algorithm was still able to realize the deployment effectively under the condition that there were obstacles in the deployment area. The experimental results show that DABA can reduce the deployment time by two thirds compared with the Voronoi algorithm. The proposed algorithm can significantly reduce the iteration time and the complexity of the algorithm.
Keywords:basic architecture                                                                                                                        Voronoi diagram                                                                                                                        coverage                                                                                                                        travel distance                                                                                                                        iteration time
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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