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-Konemann (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 Chvatal's set-cover algorithm. We evaluate our algorithm with ns2 simulations.

[1]  Piotr Berman,et al.  Power efficient monitoring management in sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[2]  R. Rajaraman,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002 .

[3]  Petteri Kaski,et al.  Local Approximation Algorithms for Scheduling Problems in Sensor Networks , 2007, ALGOSENSORS.

[4]  Yiwei Wu and Yingshu Li,et al.  Connected Dominating Sets , 2009 .

[5]  Xiang-Yang Li,et al.  Distributed low-cost backbone formation for wireless ad hoc networks , 2005, MobiHoc '05.

[6]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[7]  Jan Vitek,et al.  Redundancy and coverage detection in sensor networks , 2006, TOSN.

[8]  Roger Wattenhofer,et al.  Maximizing the lifetime of dominating sets , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[9]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[10]  Nicola Santoro.  Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing) , 2006 .

[11]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[12]  Stefano Basagni,et al.  A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[13]  Uriel Feige,et al.  Approximating the domatic number , 2000, STOC '00.

[14]  Mukesh Singhal,et al.  Mobile Ad Hoc and Sensor Systems , 2006, Int. J. Wirel. Inf. Networks.

[15]  Milan Ruzic,et al.  Uniform deterministic dictionaries , 2008, TALG.

[16]  Jukka Suomela,et al.  Locality Helps Sleep Scheduling , 2006 .

[17]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

[18]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[19]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[20]  Hagit Attiya,et al.  Wiley Series on Parallel and Distributed Computing , 2004, SCADA Security: Machine Learning Concepts for Intrusion Detection and Prevention.

[21]  Yang Xiao,et al.  A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks , 2006, Mob. Networks Appl..

[22]  Qing Zhao,et al.  On the lifetime of wireless sensor networks , 2005, IEEE Communications Letters.

[23]  Johann Hurink,et al.  Approximation schemes for wireless networks , 2008, TALG.

[24]  Christos D. Zaroliagis,et al.  QoS-aware Multicommodity Flows and Transportation Planning , 2006, ATMOS.

[25]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[26]  Nicola Santoro,et al.  Design and analysis of distributed algorithms , 2006, Wiley series on parallel and distributed computing.

[27]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.