电信科学 ›› 2011, Vol. 27 ›› Issue (12): 77-80.doi: 10.3969/j.issn.1000-0801.2011.12.022

• 研究与开发 • 上一篇    下一篇

基于增强虚拟力的自适应多障碍区域最大覆盖算法

姚信威,王万良,岑跃峰,蒋一波   

  1. 浙江工业大学计算机科学与技术学院 杭州 310023
  • 出版日期:2011-12-15 发布日期:2011-12-15

Multiple Obstacles Adaptive Maximal Coverage Algorithm Based on Enhanced Virtual Force

Xinwei Yao,Wanliang Wang,Yuefeng Cen,Yibo Jiang   

  1. College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China
  • Online:2011-12-15 Published:2011-12-15

在线阅读

8

PDF下载

326

摘要：

针对实际系统中节点与障碍物的随机分布，给出了网络覆盖率与节点移动距离的解析关系。针对有限节点密度和多类随机障碍物，提出自适应多障碍最大化覆盖算法（MOAMCA）。该算法通过节点间的动态协同移动机制，配置最理想的工作节点数和位置，实现网络的全覆盖和最小生成树连通。仿真结果表明，MOAMCA 可以高效地实现适应任意多障碍物区域下任意节点密度的最大化网络覆盖配置。

关键词: 多障碍最大化覆盖, 最小生成树连通, 网络调度, 移动无线网络

Abstract:

This paper presents the analytical relationship between node moving distance and coverage percentage based on random distribution of nodes and obstacles in real systems. Furthermore, due to the limited density and kinds of obstacles, MOAMCA is proposed for maximal coverage with full connectivity. In MOAMCA, under the dynamic collaborative moving mechanism, the working nodes are deployed ideally to get the full coverage and minimum spanning tree connectivity. Simulation results show that MOAMCA can effective achieve maximal coverage with random multiple obstacles and any node density.

Key words: maximal coverage with multiple obstacles, minimum spanning tree connectivity, network scheduling, mobile, wireless network

No Suggested Reading articles found!