Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

Authors:
André Schumacher;Harri Haanpää
Affiliations:
Department of Information and Computer Science, Helsinki University of Technology, TKK, Finland FI-02015;Department of Information and Computer Science, Helsinki University of Technology, TKK, Finland FI-02015
Venue:
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Year:
2009

Citing 16
Cited 1

Complexity of network synchronization

Journal of the ACM (JACM)
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing
Approximating the domatic number

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
An efficient distributed algorithm for constructing small dominating sets

Distributed Computing - Special issue: Selected papers from PODC '01
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Maximizing the Lifetime of Dominating Sets

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Distributed low-cost backbone formation for wireless ad hoc networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Redundancy and coverage detection in sensor networks

ACM Transactions on Sensor Networks (TOSN)
A survey of energy-efficient scheduling mechanisms in sensor networks

Mobile Networks and Applications
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)

Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

SIAM Journal on Computing
Approximation schemes for wireless networks

ACM Transactions on Algorithms (TALG)
On the lifetime of wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Local approximation algorithms for scheduling problems in sensor networks

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks

Traffic-Aware Density-Based Sleep Scheduling and Energy Modeling for Two Dimensional Gaussian Distributed Wireless Sensor Network

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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önemann (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átal's set-cover algorithm. We evaluate our algorithm with ns2 simulations.