Distributed algorithms for coloring and domination in wireless ad hoc networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3328, Issue , 2004, Pages 447-459

  Parthasarathy, Srinivasan ^a   Gandhi, Rajiv ^b  

^a University of Maryland ^*  (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLORING ALGORITHMS; CONFLICT FREE; CONNECTED DOMINATING SET; DOMINATING SETS; FREE DISTANCE; RANDOMIZED DISTRIBUTED ALGORITHMS; TIME COMPLEXITY; UNIT DISC GRAPHS; WIRELESS AD-HOC NETWORKS; WIRELESS MEDIA; OPTIMAL ALGORITHM; ROUTING IN AD HOC NETWORKS; UNIT DISK GRAPHS;

ARTIFICIAL INTELLIGENCE; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS; MOBILE TELECOMMUNICATION SYSTEMS; SOFTWARE ENGINEERING;

EID: 33748056530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_37     Document Type: Article

References (21)

1. K. M. Alzoubi. Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks. In Proceedings of the Eighth IEEE Symposium on Computers and Communications, June 2003.
2. K. M. Alzoubi, P.-J. Wan, and O. Frieder. Distributed heuristics for connected dominating sets in wireless ad hoc networks. IEEE ComSoc/KICS Journal on Communication Networks, 4:22-29, 2002.
3. K. M. Alzoubi, P.-J. Wan, and O. Frieder. Message efficient construction of non-trivial connected dominating sets in wireless ad hoc networks. To appear in Special Issue of ACM Journal of Monet, 2002.
4. K. M. Alzoubi, P.-J. Wan, and O. Frieder. Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. In Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, June 2002.
5. K. M. Alzoubi, P.-J. Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. IEEE HICSS35, 2002.
6. X. Cheng, X. Huang, D. Li, and D.-Z. Du. Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Technical report.
7. B. Clark, C. Colbourn, and D. Johnson. Unit disk graphs. Discrete Mathematics, 86:165-177, 1990.
8. B. Das, R. Sivakumar, , and V. Bharghavan. Routing in ad-hoc networks using a virtual backbone. In 6th International Conference on Computer Communications and Networks (IC3N '97), pages 1-20, September 1997.
9. Bevan Das and Vaduvur Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In ICC (1), pages 376-380, 1997.
10. Rajiv Gandhi, Srinivasan Parthasarathy, and Arunesh Mishra. Minimizing broadcast latency and redundancy in ad hoc networks. In Proceedings of the fourth ACM international symposium on Mobile ad hoc networking and computing, pages 222-232. ACM Press, 2003.
11. Piyush Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388-404, March 2000.
12. Sven O. Krumke, Madhav V. Marathe, and S. S. Ravi. Models and approximation algorithms for channel assignment in radio networks. Wireless Networks, 7(6):575-584, 2001.
13. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, and Aravind Srinivasan. End-to-End Packet Scheduling in Ad Hoc Networks. To appear in ACM SODA 2004.
14. Michael Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4):1036-1053, November 1986.
15. Michael Luby. Removing randomness in parallel computation without a processor penalty. Journal of Computer and System Sciences, 47(2):250-286, 1993.
16. Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, and Daniel J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
17. S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81-94, 1999.
18. Subramanian Ramanathan and Errol L. Lloyd. Scheduling algorithms for multihop radio networks. IEEE/ACM Transactions on Networking (TON), 1(2):166-177, 1993.
19. Arunabha Sen and Ewa Melesinska. On approximation algorithms for radio network scheduling. In Proceedings of the 35th Allerton Conference on Communication, Control and Computing, pages 573-582, 1997.
20. R. Sivakumar, B. Das, and V. Bharghavan. Spine routing in ad hoc networks. ACM/Baltzer Cluster Computing Journal (special issue on Mobile Computing), 1998.
21. P.-J. Wan, K. Alzoubi, and O. Frieder. Distributed construction of connnected dominating set in wireless ad hoc networks. In IEEE INFOCOM, 2002.