摘要
针对视频传感器网络的区域覆盖问题,提出一种基于Delaunay三角剖分思想的几何算法,选取围绕传感器的具有最大面积的Delaunay三角形重心作为决策方向。在此基础上,将Delaunay三角剖分的几何方法与分布式贪婪算法进行了融合,引入"贡献率"概念反映节点在其候选方向上可能覆盖区域的大小,以解决冗余覆盖的问题。仿真结果证明了该算法的有效性。
This paper proposed a geometric algorithm based on Delaunay triangulation to deal with the problem of area cove- rage in video sensor networks. The center of gravity of triangle with maximum area would be selected as the decision direction from all the adjacent triangulations around the sensor. Based on this, it combined the geometric method of Delaunay triangulation with the distributed greedy algorithm, and introduced the concept of “contribution rate” that reflects the size of the area coverage in the node’s candidate direction to solve the problem of redundant coverage. Finally, the simulation results show the effectiveness of the proposed algorithm.
作者
权恩猛
吴斌
Quan Enmeng;Wu Bin(School of Information Engineering,Southwest University of Science ＆ Technology,Mianyang Sichuan 621000,China)
出处
《计算机应用研究》
CSCD
北大核心
2018年第8期2447-2449,共3页
Application Research of Computers
基金
国家自然科学基金青年基金资助项目(61601382)
特殊环境机器人技术四川省重点实验室开放基金资助项目(15kftk05)
西南科技大学博士基金资助项目(15zx7154)
