Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2003, Pages 209-216

  Alzoubi, Khaled M ^a  

^a ROOSEVELT UNIVERSITY   (United States)

Author keywords

Connected dominating set; Geometric dilation; Sparse spanner; Topological dilation

Indexed keywords

APPROXIMATION FACTOR; CONNECTED DOMINATING SET; CONNECTED DOMINATING SETS; CONNECTED SUBGRAPH; DISTRIBUTED NETWORKING; GEOMETRIC DILATION; SPARSE SPANNER; TOPOLOGICAL DILATION;

AD HOC NETWORKS; ALGORITHMS; COMMUNICATION; MOBILE AD HOC NETWORKS;

GRAPH THEORY;

EID: 84883891649     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2003.1214124     Document Type: Conference Paper

References (20)

1. K. M. Alzoubi, P.-J. Wan, O. Frieder, "Distributed Heuristics for Connected Dominating Sets inWireless Ad Hoc Networks", IEEE ComSoc/KICS Journal on Communication Networks, vol. 4, pp. 22-29, 2002.
2. K. M. Alzoubi, P.-J. Wan, O. Frieder, "Message-Efficient Construction of Nontrivial Connected Dominating Sets in Wireless Ad Hoc Networks", to appear in Special Issue of ACM Journal of MONET, 2002.
3. K. M. Alzoubi, P.-J. Wan, O. Frieder, "New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks", IEEE HICSS35, 2002.
4. K. M. Alzoubi, P.-J. Wan, O. Frieder, "Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks", MobiHoc 2002, the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, June 2002.
5. K. M. Alzoubi, P.-J. Wan, O. Frieder, "Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks", ISCDS, The 23rd International Conference on Distributed Computing Systems, Rhode Island, May 2003.
6. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, " Routing with guaranteed delivery in ad hoc wireless networks", in 3rd Int. Workshop on Discrete Algorithms and methods for mobile computing and communications, 1999.
7. P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, "On the spanning ratio of gabriel graphs and betaskeletons", submitted to SIAM Journal on Discrete Mathematics, 2001.
8. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit Disk Graphs", Discrete Mathematics, 86:165-177, 1990.
9. K. R. Gabriel and R. R. Sokal, "A new statistical approach to geographic variation analysis", Systematic Zoology, vol. 18, pp. 259-278, 1969.
10. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks", in ACM/IEEE International Conference on Mobile Computing and Networking, 2000.
11. X.-Y. Li, G. Calinescu, and P.-J. Wan, "Distributed Construction of Planar Spanner and Routing for Ad Hoc Networks", to appear in INFOCOM 2002.
12. X.-Y. Li, P.-J. Wan, and W. Yu, "Power Efficient and Sparse Spanner forWireless Ad Hoc Networks", IEEE ICCCN 2001.
13. X.-Y. Li, P.-J. Wan, W. Yu, and O. Frieder, "Sparse Power Efficient Topology for Wireless Networks", HICSS35, Hawaii, Janauary 2002.
14. I. Stojmenovic, M. Seddigh, J. Zunic, "Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks", Proc. IEEE Hawaii Int. Conf. on System Sciences, January 2001.
15. M. Seddigh, J. Solano and I. Stojmenovic, "RNG and internal node based broadcasting in one-to-one wireless networks", ACM Mobile Computing and Communications Review, Vol. 5, No. 2, April 2001, 37-44.
16. R. Sivakumar, B. Das, and V. Bharghavan, "Spine Routing in Ad hoc Networks", ACM/Baltzer Publications Cluster Computing Journal (Special Issue on Mobile Computing), 1998.
17. G. T. Toussaint, "The relative neighborhood graph of a finite planar set", Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.
18. P.-J. Wan, K. M. Alzoubi, O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks", to appear in INFOCOM 2002.
19. J. Wu and H. L. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks", Proceedings of the 3rd ACM international workshop on Discrete algorithms and methods for mobile computing and communications, 1999, PP 7-14.
20. A. C.-C. Yao, "On constructing minimum spanning trees in k-dimensional spaces and related problems", SIAM J. Computing, vol. 11, pp. 721736, 1982.