Distributed algorithms for connected domination in wireless networks

Journal of Parallel and Distributed Computing

Volumn 67, Issue 7, 2007, Pages 848-862

  Gandhi, Rajiv ^a   Parthasarathy, Srinivasan ^b  

^a RUTGERS UNIVERSITY   (United States)

^b University of Maryland ^*  (United States)

Author keywords

Connected dominating set; Distributed algorithms; Interference; Wireless networks

Indexed keywords

DATA TRANSFER; PACKET LOSS; PARALLEL ALGORITHMS; SIGNAL INTERFERENCE;

CONNECTED DOMINATING SET; CONSTANT STRETCH RATIO; POLYLOGARITHMIC RUNNING TIME;

WIRELESS NETWORKS;

EID: 34249744507     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.04.003     Document Type: Article

References (34)

1. Alzoubi K., Wan P.-J., and Frieder O. Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks. Internat. J. Found. Comput. Sci. 14 2 (2003) 287-303
2. 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.
3. Alzoubi K.M., Wan P.-J., and Frieder O. Distributed heuristics for connected dominating sets in wireless ad hoc networks. IEEE ComSoc/KICS J. Commun. Networks 4 (2002) 22-29
4. Wan P.-J., Alzoubi K.M., and Frieder O. Distributed construction of connected dominating set in wireless ad hoc networks. Monet 9 2 (2004) 141-149
5. K.M. Alzoubi, P.-J. Wan, 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.
6. K.M. Alzoubi, P.-J. Wan, O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, in: IEEE HICSS35, 2002.
7. B. Chen, K. Jamieson, H. Balakrishnan, R. Morris, Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks, in: Proceedings of the Seventh Annual International Conference on Mobile Computing and Networking, ACM Press, New York, 2001, pp. 85-96.
8. X. Cheng, X. Huang, D. Li, D.-Z. Du, Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks, Technical Report.
9. Dai F., and Wu J. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans. on Parallel Distributed Systems 15 10 (2004) 908-920
10. B. Das, V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in: ICC(1), 1997, pp. 376-380.
11. B. Das, R. Sivakumar, V. Bharghavan, Routing in ad-hoc networks using a virtual backbone, in: Sixth International Conference on Computer Communications and Networks (IC3N '97), September 1997, pp. 1-20.
12. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, A. Srinivasan, Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2003, pp. 717-724.
13. R. Gandhi, S. Parthasarathy, A. 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, ACM Press, New York, 2003, pp. 222-232.
14. S. Guha, S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica (1998) pp. 374-387.
15. Gupta P., and Kumar P.R. The capacity of wireless networks. IEEE Trans. Inform. Theory 46 2 (2000) 388-404
16. Jia L., Rajaraman R., and Suel T. An efficient distributed algorithm for constructing small dominating sets. Distributed Comput. 15 4 (2002) 193-205
17. D.R. Karger, M. Ruhl, Finding nearest neighbors in growth-restricted metrics, in: STOC '02: Proceedings of the Thirty-fourth Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2002, pp. 741-750.
18. Krumke S.O., Marathe M.V., and Ravi S.S. Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7 6 (2001) 575-584
19. F. Kuhn, T. Moscibroda, R. Wattenhofer, Initializing newly deployed ad hoc and sensor networks, in: 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), 2004.
20. F. Kuhn, R. Wattenhofer, Constant-time distributed dominating set approximation, in: Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, ACM Press, New York, 2003, pp. 25-32.
21. V.S. Anil Kumar, M.V. Marathe, S. Parthasarathy, A. Srinivasan, End-to-end packet scheduling in ad hoc networks, in: ACM-SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 1014-1023.
22. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15 4 (1986) 1036-1053
23. Luby M. Removing randomness in parallel computation without a processor penalty. J. Comput. System Sci. 47 2 (1993) 250-286
24. Marathe M.V., Breu H., Hunt III H.B., Ravi S.S., and Rosenkrantz D.J. Simple heuristics for unit disk graphs. Networks 25 (1995) 59-68
25. T. Moscibroda, R. Wattenhofer, Efficient computation of maximal independent sets in unstructured multi-hop radio networks, in: First IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004.
26. S. Parthasarathy, R. Gandhi, Distributed algorithms for coloring and connected domination in wireless ad hoc networks, in: Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2004.
27. Ramanathan S., and Lloyd E.L. Scheduling algorithms for multihop radio networks. IEEE/ACM Trans. on Networking (TON) 1 2 (1993) 166-177
28. K. Romer, Time synchronization in ad hoc networks, in: MobiHoc '01: Proceedings of the Second ACM International Symposium on Mobile ad hoc Networking & Computing, ACM Press, New York, 2001, pp. 173-182.
29. A. Sen, E. Melesinska, On approximation algorithms for radio network scheduling, in: Proceedings of the 35th Allerton Conference on Communication, Control and Computing, 1997, pp. 573-582.
30. Sivakumar R., Das B., and Bharghavan V. Spine routing in ad hoc networks. ACM/Baltzer Cluster Comput. J. 1 2 (1998) 237-248
31. P.-J. Wan, K. Alzoubi, O. Frieder, Distributed construction of connnected dominating set in wireless ad hoc networks, in: IEEE INFOCOM, 2002.
32. J. Wu, Dominating-set-based routing in ad hoc wireless networks, Handbook of Wireless Networks and Mobile Computing, 2002, pp. 425-450.
33. Wu J. Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Trans. Parallel Distributed Systems 13 9 (2002) 866-991
34. S. Yi, Y. Pei, S. Kalyanaraman, On the capacity improvement of ad hoc wireless networks using directional antennas, in: MobiHoc '03: Proceedings of the Fourth ACM International Symposium on Mobile ad hoc Networking & Computing, ACM Press, New York, 2003, pp. 108-116.