Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem

Authors:
Daniele Fontanelli;Luigi Palopoli;Roberto Passerone
Affiliations:
Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Trento, Italy;Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Trento, Italy;Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Trento, Italy
Venue:
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Year:
2009

Citing 10
Cited 0

Matrix analysis and applied linear algebra

Matrix analysis and applied linear algebra
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms

Proceedings of the 3rd international symposium on Information processing in sensor networks
Redundancy and coverage detection in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Towards optimal sleep scheduling in sensor networks for rare-event detection

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Maximizing lifetime of sensor surveillance systems

IEEE/ACM Transactions on Networking (TON)
Communication constraints in the average consensus problem

Automatica (Journal of IFAC)
Decentralized scattering of wake-up times in wireless sensor networks

EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Optimal sensor placement and motion coordination for target tracking

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region 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. Giusti et. al. [6] have recently proposed an efficient decentralized approach that produces a generally good suboptimal solution. In this paper, we study the convergence of this algorithm by casting the problem into one of asymptotic stability for a particular class of linear switching systems. For general topologies of the WSN, we offer local stability results. In some specific special cases, we are also able to prove global stability properties.