Authors: Wang, Weilin; Lafortune, Stephane

Source: International Journal of Control, Volume 81, Number 9, September 2008 , pp. 1493-1505(13)

Publisher: Taylor and Francis Ltd

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.

Keywords: coverage; mobility control; wireless network

Document Type: Research article

DOI: http://dx.doi.org/10.1080/00207170701881833

Affiliations: 1: Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, 48109

Publication date: 2008-09-01

More about this publication?

• Editorial Board
• Information for Authors
• Subscribe to this Title
• ingentaconnect is not responsible for the content or availability of external websites

Related content

• In this: publication
• By this: publisher
• In this Subject: Mechanical Engineering
• By this author: Wang, Weilin ;  Lafortune, Stephane

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers