Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks

Proceedings of the Joint Workshop on Foundations of Mobile Computing

Volumn , Issue , 2003, Pages 59-68

  Wang, Yu ^a   Li, Xiang Yang ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Bounded degree; Localized algorithm; Planar; Spanner; Topology control; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK TOPOLOGY; GLOBAL POSITIONING SYSTEM; GRAPH THEORY; ROUTERS; SIGNAL INTERFERENCE; TELECOMMUNICATION NETWORKS;

BOUNDED DEGREE; LOCALIZED ALGORITHMS; TOPOLOGY CONTROL; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 1642386245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/941079.941088     Document Type: Conference Paper

References (32)

1. K. Alzoubi, P.-J. Wan, and O. Frieder. Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. In ACM MobiHoc'02, 2002.
2. S. Arya, G. Das, D. Mount, J. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 27th ACM STOC, pages 489-498, 1995.
3. P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick. On the spanning ratio of gabriel graphs and beta-skeletons. In Proceedings of the Latin American Theoretical Infocomatics (LATIN), 2002.
4. P. Bose, J. Gudmundsson, and P. Morin. Ordered theta graphs. In Proc. of Canadian Conf. on Computational Geometry (CCCG), 2002.
5. P. Bose, J. Gudmundsson, and M. Smid. Constructing plane spanners of bounded degree and low weight. In Proceedings of the European Symposium on Algorithms (ESA), 2002.
6. P. Bose and P. Morin. Online routing in triangulations. In Proc. of the 10th Int. Symp. on Algorithms and Computation ISAAC, 1999.
7. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. ACM/Kluwer Wireless Networks, 7(6), pages 609-616, 2001. In ACM DIALM 99, pages 48-55, 1999.
8. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. ACM/Kluwer Wireless Networks, 7(6), pages 609-616, 2001. In ACM DIALM 99, pages 48-55, 1999.
9. G. Cǎlinescu. Computing 2-hop neighborhoods in ad hoc wireless networks. In AdHoc-Now'03, 2003.
10. D. Dobkin, S. Friedman, and K. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete Computational Geometry, 1990.
11. J. Gao, L. J. Guibas, J. Hershburger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In Proc. of the 2nd ACM MobiHoc, 2001.
12. M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert. Distributed maintenance of resource efficient wireless network topologies, 2002. Proc. of the 8th European Conference on Parallel Computing (Euro-Par'02).
13. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. In Scandinavian Workshop on Algorithm Theory, pages 314-327, 2000.
14. L. Hu. Topology control for multihop packet radio networks. IEEE Transactions on Communications, 41, 1993.
15. L. Jia, R. Rajaraman, and C. Scheideler. On local algorithms for topology control and routing in ad hoc networks, 2002. Submitted for publication.
16. B. Karp and H. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. of the ACM MobiCom, 2000.
17. J. Keil and C. Gutwin. The delaunay triangulation closely approximates the complete Euclidean graph. In Proc. 1st Workshop Algorithms Data Structure (LNCS 382), 1989.
18. J. Keil and C. Gutwin. Classes of graphs which approximate the complete euclidean graph. Discrete Computational Geometry, 7, 1992.
19. F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically Optimal Geometric Mobile Ad-Hoc Routing. In ACM DialM, 2002.
20. F. Kuhn, R. Wattenhofer, and A. Zollinger. Worst-case optimal and average-case efficient geometric ad-hoc routing. In ACM MobiHoc, 2003.
21. L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In ACM PODC, 2001.
22. X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang. Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, to appear, 2003. Short version was in INFOCOM 2002.
23. X.-Y. Li, P.-J. Wan, and Y. Wang. Power efficient and sparse spanner for wireless ad hoc networks. In IEEE ICCCN, pages 564-567, 2001.
24. X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder. Sparse power efficient topology for wireless networks. In IEEE 35th HICSS, 2002.
25. X.-Y. Li and Y. Wang. Efficient construction of low weight bounded degree planar spanner. In 9th COCOON, 2003.
26. F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, 1985.
27. R. Rajaraman. Topology control and routing in ad hoc networks: A survey. In SIGACT News, 33:60-73, 2002.
28. R. Ramanathan and R. Rosales-Hain. Topology control of multihop wireless networks using transmit power adjustment. In IEEE INFOCOM, 2000.
29. W. Wang, X.-Y. Li, K. Moaveninejad, Y. Wang, and W.-Z. Song. The Spanning Ratios of beta-Skeleton. Canadian Conference on Computational Geometry (CCCG), 2003.
30. Y. Wang, X.-Y. Li, and O. Frieder. Distributed spanner with bounded degree for wireless networks. International Journal of Foundations of Computer Science, 14:183-200, 2003.
31. R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang. Distributed topology control for wireless multihop ad-hoc networks. In IEEE INFOCOM'01, 2001.
32. A. C.-C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Computing, 11:721-736, 1982.