On the global convergence of a class of distributed algorithms for maximizing the coverage of a WSN

Author

Fontanelli, Daniele ; Palopoli, Luigi ; Passerone, Roberto

Author_Institution

DISI - Dipt. di Ing. e Scienza dell´´Inf., Univ. of Trento, Trento, Italy

fYear

2009

fDate

15-18 Dec. 2009

Firstpage

7885

Lastpage

7890

Abstract

We consider the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network (WSN) that optimizes the coverage of the the nodes are deployed on. An exact solution of the problem entails the solution of an Integer Linear Program and is hardly viable on low power nodes. In this paper, we study the convergence of an efficient decentralized algorithm for node scattering by casting the problem into one of asymptotic stability for a particular class of linear switching systems. We present asymptotic stability results for generic WSN topologies and an application of the algorithm to the coverage problem to show the effectiveness of the proposed solution.

Keywords

integer programming; wireless sensor networks; distributed algorithms; global convergence; integer linear program; periodic schedule; wake-up times; wireless sensor network; Asymptotic stability; Convergence; Distributed algorithms; Monitoring; Network topology; Optimal scheduling; Processor scheduling; Robustness; Scattering; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on

Conference_Location

Shanghai

ISSN

0191-2216

Print_ISBN

978-1-4244-3871-6

Electronic_ISBN

0191-2216

Type

conf

DOI

10.1109/CDC.2009.5400522

Filename

5400522