Telecommunications Science ›› 2011, Vol. 27 ›› Issue (12): 77-80.doi: 10.3969/j.issn.1000-0801.2011.12.022

• research and development • Previous Articles     Next Articles

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

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!