By Topic

Asynchronous distributed algorithms for optimal coverage control with sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Minyi Zhong ; Div. of Syst. Eng., Boston Univ., Brookline, MA, USA ; Cassandras, C.G.

A sensor network consists of a collection of (possibly mobile) sensing devices that can coordinate their actions through wireless communication and aim at performing various tasks (e.g., surveillance, environmental monitoring) over a region sometimes referred to as the ldquomission spacerdquo. The performance of a sensor network is sensitive to the location of its nodes in the mission space. This leads to the basic ldquocoverage controlrdquo problem of properly, and possibly optimally, deploying sensors in order to meet the overall system's objectives. Clearly, to achieve such a goal, the nodes must share, at least partially, their state information. However, this may require a large amount of information exchange. Moreover, sensor nodes are frequently small, inexpensive devices with limited resources. Aside from energy required to move (if nodes are mobile), communication is known to be by far the largest consumer of the limited energy of a node, compared to other functions such as sensing and computation. Therefore, it is crucial to reduce communication between nodes to the minimum possible. This in turn imposes a constraint on the optimization task performed by each node, since it requires that actions be taken without full knowledge of other nodes' states. Standard synchronization schemes require that nodes periodically exchange state information which is clearly inefficient and, in fact, unnecessary since often the state of a node may not have changed much or may have only changed in a predictable way. This motivates us to seek not only distributed but also asynchronous optimization mechanisms in which a node communicates with others only when it considers it indispensable; in other words, each node tries to minimize the cost of communication by transmitting state information only under certain conditions and only as a last resort. This poses questions such as ldquowhat should the conditions be for a node to take such communication actions?rdquo and ldquounde- r what conditions, if any, can we guarantee that the resulting optimization scheme possesses desirable properties such as convergence to an optimum?"

Published in:

Control and Automation, 2009. MED '09. 17th Mediterranean Conference on

Date of Conference:

24-26 June 2009