Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximation algorithm by applying linear programming approximation techniques. Our algorithm is an application of the Garg-K¨onemann (GK) scheme that requires solving an instance of the minimum weight dominating set (MWDS) problem as a subroutine. Our two main contributions are a distributed implementation of the GK scheme for the sleep-scheduling problem and a novel asynchronous distributed algorithm for approximating MWDS based on a primal-dual analysis of Chv´atal’s set-cover algorithm. We evaluate our algorithm with ns2 simulations.

• Type: Conference
• Year: 2009
• Where: SSS
• Authors: André Schumacher, Harri Haanpää
• Keywords: Algorithm, Approximation Algorithm, Asynchronous Distributed Algorithm, Control Systems, SSS 2009