Connected Domination in Multihop Ad Hoc Wireless Networks

Proceedings of the Joint Conference on Information Sciences

Volumn 6, Issue , 2002, Pages 251-255

  Cardei, Mihaela ^a   Cheng, Xiaoyan ^a   Cheng, Xiuzhen ^a   Du, Ding Zhu ^a  

^a University of Minnesota   (United States)

Author keywords

Connected dominating set; Multihop ad hoc wireless network; Virtual backbone routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MULTICASTING; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS; TREES (MATHEMATICS); VECTORS; VIRTUAL REALITY;

CONNECTED DOMINATING SET; MULTIHOP AD HOC NETWORK; VIRTUAL BACKBONE ROUTING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 1642394904     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. K.M. Alzoubi, P.-J. Wan and O. Frieder, Message-efficient distributed algorithms for connected dominating set in wireless ad hoc networks, manuscript, 2001.
2. H. Attiya and J. Welch, Distributed computing: fundamentals, simulations and advanced topics, McGraw-Hill Publishing Company, 1998.
3. B. Awerbuch, Optimal distributed algorithm for minimum weight spanning tree, counting, leader election and related problems, Proceedings of the 19th ACM Symposium on Theory of Computing, ACM, pp. 230-240, 1987.
4. V. Bharghavan and B. Das, Routing in ad hoc networks using minimum connected dominating sets, ICC '97, Montreal, Canada, June 1997.
5. I. Cidon and O. Mokryn, Propagation and leader election in multihop broadcast environment, 12th International Symposium on Distributed Computing (DISC98), September 1998, Greece, pp. 104-119.
6. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Mathematics, Vol. 86, 1990, pp. 165-177.
7. B. Das and V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, Communications, 1997. ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on, Vol. 1, 1997, pp. 376-380.
8. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, Vol. 20(4), April 1998, pp. 374-387.
9. M. Joa-Ng and I.-T. Lu, A Peer-to-Peer zone-based two-level link state routing for mobile Ad Hoc Networks, IEEE Journal on Selected Areas in Communications, Vol. 17(8), Aug. 1999, pp. 1415-1425.
10. D.B. Johnson, D. A. Maltz, Y.-C. Hu and J. G. Jetcheva, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, Internet Draft draft-ietfmanet-dsr-05.txt, March 2001.
11. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, Proc. MOBICOM, Seattle, Aug. 1999, pp. 151-162.
12. G. Pei, M. Gerla and T.-W. Chen, Fisheye state routing: a routing scheme for ad hoc wireless networks, ICC 2000, Vol. 1, pp. 70-74.
13. C. E. Perkins, E. M. Royer and S. R. Das, Ad hoc On-Demand Distance Vector (AODV) Routing, Internet Draft draft-ietf-manet-aodv-08.txt, March 2001.
14. P. Sinha, R. Sivakumar and V. Bharghavan, Enhancing ad hoc routing with dynamic virtual infrastructures, INFOCOM 2001, Vol. 3, pp. 1763-1772.
15. J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. of the 3rd International Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications, 1999, Seattle, WA USA, pp.7-14.