三维水下传感网相异k-覆盖改进虚拟力算法

水下传感器的覆盖控制研究对于合理分配网络的空间资源,更好地完成环境感知、信息获取任务以及提高网络生存能力都具有重要的意义.实际情况中,水下监测区域往往需要不均匀的覆盖.现有的研究偏重于“事件驱动”概念,但不同区域的不同k-覆盖需求并未得到重视.针对UWSNs 相异k-覆盖需求区域的覆盖优化部署这一研究方向,基于浮标、锚、与浮标通过有线电缆连接通信的水下传感器模型,分析了相异k-覆盖需求区域所需的节点数下限,提出了一种基于相异k-覆盖需求的改进虚拟力算法k-ERVFA(k-equivalent radius virtual force algorithm).仿真实验结果表明,相比经典的虚拟力算法,在相同最大迭代次数和相同节点数的情况下,该算法在牺牲1-覆盖需求区域的1-覆盖率仅1.21%~3.89%的情况下,能够同比提高相应区域的2-、3-覆盖率分别达到17.42%~44.3%和28.95%~49.53%,取得了很好的部署效果,说明了k-ERVFA 算法的正确性与有效性.

Improved Virtual-Force Algorithm for 3D Underwater Wireless Sensor Networks Based on Different k-Coverage Requirements

The research of 3D underwater sensors' coverage-control has great significance in rational allocation of underwater space resources, environment-aware & information-acquisition and the network survivability improvement. In the real world situation, the uneven coverage is always needed in the underwater detection region. The current studies focus on the conception of "Event-Driven" without paying enough attention to the diversity of k-coverage requirements of different 3D regions. This work concentrates on the optimizational deployment for Underwater Sensor Networks' (UWSNs) diverse k-coverage requirements of distinguished regions. Based on the model of "buoys, anchors, underwater sensors which are connected and communicated via a wired cable with their respective buoy", we study the low-boundary number of the sensors required by diversity of k-coverage, and develop a novel algorithm: k-ERVFA (k-Equivalent radius virtual force algorithm) as an improvement to the classic virtual-force algorithm (VFA). Compared with the VFA in our simulation, the new algorithm only loses 1.21%~3.89% of 1-coverage rate in the required 1-coverage region, but significantly improves the 2- and 3- coverage rate to 17.42%~44.3% and 28.95%~49.53% respectively in the corresponding required coverage regions. The improvement in k-coverage requirements illustrates the correctness and effectiveness of k-ERVFA.