PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Locality helps sleep scheduling
Jukka Suomela
In: Workshop on World-Sensor-Web: Mobile Device-Centric Sensory Networks and Applications, 31 Oct 2006, Boulder, CO, USA.

Abstract

This work studies sleep scheduling in mobile-device centric sensor networks. The objective is to maximise the lifetime by exploiting redundancy in an over-deployed network. Redundancy is described by a redundancy graph; it turns out that typical realistic redundancy graphs are members of the family of local graphs. By using a divide-and-conquer technique based on modular grids, it is shown that sleep scheduling admits a polynomial-time approximation scheme in local graphs; this is not the case in arbitrary graphs.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:2704
Deposited By:Jukka Suomela
Deposited On:22 November 2006