A self-stabilizing distributed approximation algorithm for the minimum connected dominating set

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Kamei, Sayaka ^a   Kakugawa, Hirotsugu ^b  

^a TOTTORI UNIVERSITY OF ENVIRONMENTAL STUDIES   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SET THEORY;

MESSAGE LOSS; MOBILE AD HOC NETWORKS; SELF-STABILIZING SYSTEM; TOPOLOGY CHANGE;

APPROXIMATION ALGORITHMS;

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

References (18)

1. V. Bharghavan and B.Das. Routing in ad hoc networks using minimum connected dominating sets. In Proceedings of International Conference on Communications'97, pages 376-380, 1997.
2. J. Blum, M. Ding, A. Thaeler, and X. Cheng. Connected Dominating Set in Sensor Networks and MANETs, pages 329-369. Kluwer Academic Publishers, 2004.
3. X. Cheng and D.-Z. Du. Virtual backbone-based routing in multihop ad hoc wireless networks. Technical report, University of Minnesota, 2002.
4. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics, 86:165-177, 1990.
5. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, 1974.
6. S. Dolev. Self-Stabilization. The MIT Press, 2000.
7. B. Gao, Y. Yang, and H. Ma. A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks. International Journal of Communication System, 18:743-762, 2005.
8. S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. Algorithmica, 20:347-387, 1998.
9. S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Computers and Mathematics with Applications, 46(5-6):805-811, 2003.
10. S. T Huang and N.-S. Chen, A self-stabilizing algorithm for constructing breadth first trees. Information Processing Letters, 41(2):109-117, 1992.
11. A. Jain and A. Gupta. A distributed self-stabilizing algorithm for finding a connected dominating set in a graph. In Proceedings of the 6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'05), pages 615-619. IEEE Press, 2005.
12. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
13. E. Sampathkumar and H. B. Walikar. The connected domination number of a graph. Journal of Mathematical Physical Sciences, 13:607-613, 1979.
14. S. K. Shukla, D. J. Rosenkrantz, and S.S.Ravi. Observations on self-stabilizing graph algorithms for anonymous networks. In Proceedings of the 2nd Workshop on Self-Stabilizing Systems (WSS'95), pages 7.1-7.15. Chicago Journal of Theoretical Computer Science, 1995.
15. S. Sur and P. K. Srimani. A self-stabilizing distributed algorithm to construct BFS spanning trees of a symmetric graph. Parallel Processing Letters, 2:171-179, 1992.
16. P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications, 9:141-149, 2004.
17. J. Wu and H.L. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 7-14, 1999.
18. J. Wu and W. Lou. Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wireless Networks and Mobile Computing, 3(2): 155-173, 2003.