An algorithm for maximising covered area

Abstract

This paper presents an algorithm for positioning circles in a given region to maximise the covered area. Our algorithm has applications in wireless networks, such as positioning a given number of mobile stations in a given region, one goal of which is to cover the largest area possible. Although the evaluation of the function value, i.e., the total covered area, is difficult, we bypass this difficulty by calculating the gradient of the total covered area directly. As long as nodes continuously move in directions that guarantee increasing coverage, a configuration of node positions corresponding to a maximal covered area can eventually be identified.

Heterogeneous locational optimisation using a generalised Voronoi partition

“…The problem is modeled using the maximal covering location problem and/or the backup coverage location problem combined with visibility analysis. Wang and Lafortune (2008) provide an algorithm for the positioning of circles in a given region, maximising the covered area. Li and Xi (2010) address the problem of self-deployment of a group of mobile agents to achieve maximum sensing coverage while maintaining connectivity of the communication graph.…”