Constant density spanners for wireless ad-hoc networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 116-125

  Kothapalli, Kishore ^a   Scheideler, Christian ^a   Onus, Melih ^b   Richa, Andrea ^b  

^a Johns Hopkins University   (United States)

^b Arizona State University   (United States)

Author keywords

Ad hoc networks; Dominating set; Self stabilization; Spanner

Indexed keywords

ALGORITHMS; ENERGY EFFICIENCY; GATEWAYS (COMPUTER NETWORKS); TOPOLOGY;

DOMINATING SET; SPANNER; WIRELESS AD-HOC NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 32144443992     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073987     Document Type: Conference Paper

References (36)

1. M. Adler and C. Scheideler. Efficient communication strategies for ad hoc wireless networks. Theory of Computing Systems, 33:337-391, 2000.
2. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan and O. Frieder Geometric spanners for wireless ad hoc networks. In IEEE Transactions on Parallel and Distributed Systems, pages 408-421, 2003.
3. K. Alzoubi P.-J. Wan and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE Infocom '02, 2002.
4. K. Alzoubi, P.-J. Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. In Proc. of the 34th Annual Hawaii International Conference on System Science (HICSS-35), 2002.
5. X. Cheng, D. Huang, W. Li, W. Wu, and D. Z. Du. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks: An International Journal, 42, 2003.
6. S. Choi. IEEE 802.11e MAC-level FEC performance evaluation and enhancement. In GLOBECOM '02, 2002.
7. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics, 86:165-177, 1990.
8. E. W. Dijkstra. Self stabilization in spite of distributed control. Communications of the ACM, 17:643-644, 1974.
9. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), pages 717-724, 2003.
10. K.R. Gabriel and R.R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259-278, 1969.
11. J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In Proc. of the 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '01), pages 45-55, 2001.
12. P. Gupta and P.R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, IT-46(2):388-404, 2000.
13. P. Gupta and P.R. Kumar. Internets in the sky: The capacity of three dimensional wireless networks. Communications in Information and Systems, 1(1):33-50, 2001.
14. P. Gupta and P.R. Kumar. Towards an information theory of large networks: An achievable rate region. In IEEE International Symposium on Information Theory (ISIT 2001), 2001.
15. H. Huang, A. W. Richa, and M. Segal. Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. ACM Baltzer Journal on Mobile Networks and Applications (MONET), pages 141-149, April 2004.
16. L. Jia, R. Rajaraman, and R. Suel. An efficient distributed algorithm for constructing small dominating sets. In Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), 2001.
17. T. Jurdzinski and G. Stachowiak. Probabilistic algorithms for the wakeup problem in single-hop radio networks. In Proc. of the 13th Int. Symposium on Algorithms and Computation, pages 535-549, 2002.
18. J. Keil and W. Gutwin. The delaunay triangulation closely approximates the complete euclidean graph. In 1st Workshop on Algorithms and Data Structures (WADS), 1989.
19. F. Kuhn, T. Moscibroda, and R. Wattenhofer. Radio network clustering from scratch. In European Symposium on Algorithms (ESA), 2004.
20. Fabian Kuhn and Roger Wattenhofer. Constant-time distributed dominating set approximation. In Proc. of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pages 25-32, 2003.
21. F. Kuhn, R. Wattenhofer, Y. Zhang and A. Zollinger. Geometric ad-hoc Routing: Of theory and practice. In Proc. of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003.
22. Fabian Kuhn and Roger Wattenhofer and Aaron Zollinger Ad-hoc networks beyond unit disk graphs. In Proc. of the 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 69-78, 2003.
23. J. Kuruvila, A. Nayak, and I. Stojmenovic. Hop count optimal position based packet routing algorithms for ad hoc wireless networks with a realistic physical layer. In 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004.
24. X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of planar spanner and routing for ad hoc wireless networks. In IEEE INFOCOM, pages 1268-1277, 2002.
25. X.-Y. Li, P.-J. Wan, and Y. Wang. Power efficient and sparse spanner or wireless ad hoc networks, In IEEE International Conference on Computer Communications and Networks (ICCCN), pages 564-567, 2001.
26. X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder. Sparse power efficient topology for wireless netowrks. In IEEE Hawaii International Conference on System Sciences (HICSS), 2002.
27. M. Luby A simple parallel algorithm for the maximal independent set problem. In Proc. of the 17th ACM Symposium on Theory of Computing (STOC), pages 1-10, 1985.
28. IEEE P802.11a/D7.0-1999. Wireless lan medium access control (mac) and physical layer (phy) specification: High speed physical layer in the 6 ghz band. IEEE, New York, July 1999.
29. S. Parthasarathy and R. Gandhi. Distributed algorithms for coloring and domination in wireless ad hoc networks. In Proc. of FSTTCS, 2004.
30. L. Quin and T. Kunz. On-demand routing in MANETs: The impact of a realistic physical layer model. In Proc. of the 2nd International Conference ADHOC-NOW, pages 37-48, 2003.
31. T.S. Rappaport. Wireless Communications: Principle and Practice. Prentice Hall, 1996.
32. W-Z. Song, Y. Wang, X-Y. Li and O. Frieder Localized algorithms for energy efficient topology in wireless ad hoc networks. In Proc. of the 5th ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pages 98-108, 2004.
33. Y. Wang and X.-Y. Li. Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In Proc. of the 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 59-68, 2003.
34. Y. Wang and X.-Y. Li. Geometric Spanners for Wireless Ad Hoc Networks. In IEEE Trans. on Parallel and Distributed Systems, pages 408-421, vol. 14, 2003.
35. R. Wattenhofer, J. Li Li, P. Bahl, and Y.-M. Wang. Distributed topology control for wireless multihop ad-hoc networks. In IEEE INFOCOM '01, pages 1388-1397, 2001.
36. Andrew Chi Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, 1982.