检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:史佳琦 谭励[1] 唐小江[1] 连晓峰[1] 王浩宇 SHI Jiaqi;TAN Li;TANG Xiaojiang;LIAN Xiaofeng;WANG Haoyu(School of Computer and Information Engineering,Beijing Technology and Business University,Beijing 100048,China)
机构地区:[1]北京工商大学计算机与信息工程学院,北京100048
出 处:《计算机应用》2020年第7期2033-2037,共5页journal of Computer Applications
基 金:北京市自然科学基金-海淀原始创新联合基金资助项目(L182007);国家自然科学基金(61702020)及其配套项目(PXM2018_014213_000033)。
摘 要:目前无线传感器网络中节点的部署主要采用基于Voronoi图的算法,在使用Voronoi算法进行部署的过程中由于参与部署的节点数量多,算法的复杂度高,导致算法的迭代时间较长。为解决节点部署中算法迭代时间较长的问题,提出一种基于小结构体的部署算法(DABA)。首先,将节点组合成小结构体;然后,计算小结构体的中心位置坐标;最后,利用Voronoi图进行节点部署。所提算法对于部署区域存在障碍的情况仍然能有效进行部署。实验结果表明,DABA在部署时间方面能够比基于Voronoi图的算法减少三分之二。所提算法可明显减少算法的迭代时间,同时降低算法的复杂性。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.
关 键 词:小结构体 VORONOI图 覆盖率 移动距离 迭代时间
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222