Local approximation schemes for topology control

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 208-217

  Damian, Mirela ^a   Pandit, Saurav ^b   Pemmaraju, Sriram ^b  

^a Department of Computing Sciences and Center of Excellence in Enterprise Technology   (United States)

^b University of Iowa   (United States)

Author keywords

Spanners; Topology control; Unit ball graphs; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; LINEAR PROGRAMMING; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

SPANNERS; TOPOLOGY CONTROL; UNIT BALL GRAPHS; WIRELESS AD-HOC NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748696562     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146413     Document Type: Conference Paper

References (20)

1. L. Barriére, P. Fraigniaud, and L. Narayanan. Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In Proc. of the. 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pages 19-27, 2001.
2. A. Czumaj and H. Zhao. Fault-tolerant geometric spanners. Discrete & Computational Geometry, 32(2):207-230, 2004.
3. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. In SCG '93: Proc. of the ninth annual symposium on Computational geometry, pages 53-62, New York, NY, USA, 1993. ACM Press.
4. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. Int. J. Comput. Geometry Appl., 7(4):297-315, 1997.
5. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM J. Comput., 31(5):1479-1500, 2002.
6. M. Hajiaghayi, N. Imrnorlica, and V. S. Mirrokni. Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. In Proc. of the 11th IEEE International Conference on Computer Communications and Networks (IC3N), pages 392-398, 2002.
7. M. Hajiaghayi, N. Immorlica, and V. S. Mirrokni. Power optimisation in fault-tolerant topology control algorithms for wireless multi-hop networks. In Proc. of the 9th annual international conference on Mobile computing and networking (MobiCom), pages 300-312. 2003.
8. M. Hajiaghayi, G. Kortsarz, V.S. Mirrokni, and Z. Nutov. Power optimization for connectivity problems. In IPCO, pages 349-301, 2005.
9. B. Karp and H. T. Kung. Greedy perimeter stateless routing for wireless networks. In Proc. of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243-254, 2000.
10. David Kotz, Calvin Newport, and Chip Elliot. The mistaken axioms of wireless-network research. Technical Report TR2003-467, Dartmouth College, Department of Computer Science, 2003.
11. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. On the locality of bounded growth. In Proc. of the 24th ACM Symposium on the Principles of Distributed Computing (PODC), pages 60-68, 2005.
12. C. Levcopoulos and A. Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8:251-256, 1992.
13. X. Y. Li, G. Calinescu, and P. Wan. Distributed construction of planar spanner and routing for ad hoc wireless networks. In Proc. of the 21st Annual Joint. Conference of the IEEE Computer and Communications Societies (INFOCOM), 2002.
14. X. Y. Li, G. Calinescu, P. J. Wan, and Y. Wang. Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst., 14(10):1035-1047, 2003.
15. Xiang-Yang Li and Yu Wang. Efficient construction of low weighted bounded degree planar spanner. International Journal of Computational Geometry and Applications, 14(1-2):69-84, 2004.
16. David Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
17. R. Rajaraman. Topology control and routing in ad hoc networks: A survey. SIGACT News, 33:60-73, 2002.
18. Y. Wang and X. Y. Li. Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In Proceedinngs of the Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 59-68, 2003.
19. R. Wattenhofer and A. Zollinger. XTC: A practical topology control algorithm for ad-hoc networks. In 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), 2004.
20. A.C.-C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, 1982.