Maximizing the lifetime of dominating sets

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Moscibroda, Thomas ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING; DOMINATING SET; POWER MANAGEMENT; WIRELESS AD HOC AND SENSOR NETWORKS;

ALGORITHMS; APPROXIMATION THEORY; DATA ACQUISITION; POWER CONTROL; PROBLEM SOLVING; SCHEDULING; SENSORS; SET THEORY; TELECOMMUNICATION NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33746312073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.276     Document Type: Conference Paper

References (22)

1. rd ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC), pages 157-164, EPFL Lausanne, Switzerland, 2002.
2. M. Cardei, D. Maccallum, X. Cheng, M. Min, X. Jia, D. Li, D.-Z. Du, and D. Du. Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks, 3(3-4):213-229, 2002.
3. B. N. Clark, C. J. Colboum, and D. S. Johnson. Unit Disk Graphs. Discrete Mathematics, 86:165-177, 1990.
4. U. Feige. A Threshold of In n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634-652, 1998.
5. U. Feige, M. M. Halldórsson, G. Kortsarz, and A. Srinivasan. Approximating the domatic number. SIAM Journal of Computing, 32(1): 172-195, 2003.
6. S. Fujita. On the Performance of Greedy Algorithms for Finding Maximum r-Configurations. In Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation (WAAC). 1999.
7. S. Fujita, M. Yamashita, and T. Kameda. A Study on r-Configurations - A Resource Assignment Problem on Graphs. SIAM Journal on Discrete Mathematics, 13(2):227-254, 2000.
8. th Symposium on Computational Geometry (SCG), pages 188-196. ACM Press, 2001.
9. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
10. th Annual European Symposium on Algorithms (ESA), volume 1136 of Lecture Notes in Computer Science, pages 179-193, 1996.
11. th ACM Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2001.
12. R. M. Karp. Reducibility Among Combinatorial Problems. In Proc. of a Symposium on the Complexity of Computer Computations, pages 85-103, 1972.
13. th Int. Conf. on Mobile Computing and Networking (MOBICOM), 2004.
14. rd ACM Symposium on the Principles of Distributed Computing (PODC), 2004.
15. nd ACM Int. Symposium on the Principles of Distributed Computing (PODC), pages 25-32, 2003.
16. S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets and Applications. Journal of Algorithms, 28:40-66, 1998.
17. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15:1036-1053, 1986.
18. C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. Journal of the ACM, 41:960-981, 1994.
19. rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pages 15-22, 1999.
20. S. Slijepcevic and M. Potkonjak. Power Efficient Organization of Wireless Sensor Networks. In Proceedings of IEEE Infocom, pages 472-276, 2001.
21. P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. ACM/Baltzer Mobile Networks and Applications Journal, 9(2):141-149, 2004.
22. rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pages 7-14, 1999.