Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2018, Vol. 44 ›› Issue (5): 71-77. doi: 10.19678/j.issn.1000-3428.0046206

Previous Articles     Next Articles

Object Self-coverage Algorithm in Three-dimensional Space for Directional Mobile Sensor Network

TAN Li  1,YANG Chaoyu  1,YANG Minghua  2,TANG Xiaojiang  1   

  1. 1.School of Computer and Information Engineering,Beijing Technology and Business University,Beijing 100068,China; 2.The Rocket Force Equipment Academy,Beijing 100094,China
  • Received:2017-03-03 Online:2018-05-15 Published:2018-05-15

有向移动传感器网络三维空间目标自主覆盖算法

谭励 1,杨朝玉 1,杨明华 2,唐小江 1   

  1. 1.北京工商大学 计算机与信息工程学院,北京 100068; 2.火箭军装备研究院,北京 100094
  • 作者简介:谭励(1980—),女,教授,主研方向为无线传感器网络、智能信息网络、机器学习;杨朝玉,硕士研究生;杨明华,高级工程师;唐小江,硕士研究生。
  • 基金资助:
    国家自然科学基金(61402022);北京市自然科学基金(4172013);北京工商大学研究生科研能力提升计划项目。

Abstract: In the Wireless Sensor Network(WSN),the whole coverage of the three-dimensional target under the three-dimensional space needs to consider the three-dimensional structure of space target which irregular influence on deployment,and how to avoid the collision between the nodes on the premise of keeping to maximize the target surface area of coverage.Aiming at these problems,this paper presents an object self-coverage algorithm in three-dimensional space.The method of three-dimensional centroid calculation based on the convex set determines the scope of the target center and node deployment,and the uneven virtual potential field method is used to overcome the overlapping and covering hole problems,which translates mobile sensor network deployment process into the virtual potential field’s nodes self-mobile and self-rotation process by the virtual force.Simulation result shows that,compared with the spatial partitioning algorithm,the proposed algorithm has better performance on coverage and energy consumption.

Key words: directional mobile sensor network, three-dimensional deployment, target coverage, virtual potential field, 3D Self-Deployment(3DSD) algorithm, sensor node

摘要: 在无线传感器网络中,三维空间下对立体目标的全覆盖需要考虑空间目标不规则的三维结构对部署的影响,以及如何在避免节点发生碰撞的前提下保持对目标表面积的最大化覆盖。为此,提出一种三维空间目标自主覆盖算法。采用基于目标外凸点集合构建三维质心的方法确定目标中心点和节点部署范围,通过不均衡虚拟势场解决覆盖重叠和覆盖空洞问题,将有向移动传感器网络部署过程转化为节点在虚拟势场中受虚拟力作用而自主移动和自主转动的过程。仿真结果表明,与空间划分算法相比,该算法的覆盖能力较强,并且能耗较低。

关键词: 有向移动传感器网络, 三维部署, 目标覆盖, 虚拟势场, 三维自部署算法, 传感器节点

CLC Number: