Localized construction of bounded degree and planar spanner for wireless ad hoc networks

Mobile Networks and Applications

Volumn 11, Issue 2, 2006, Pages 161-175

  Wang, Y U ^a   Li, Xiang Yang ^b,c,d  

^a University of North Carolina at Charlotte   (United States)

^b Illinois Institute of Technology   (United States)

^c ACM   (United States)

^d IEEE   (Japan)

Author keywords

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

Indexed keywords

BOUNDED DEGREE; LOCALIZED ALGORITHM; PLANAR; SPANNER; TOPOLOGY CONTROL; WIRELESS AD HOC NETWORKS;

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; PARAMETER ESTIMATION; WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK PROTOCOLS;

EID: 33646747721     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11036-006-4469-5     Document Type: Article

References (37)

1. 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, 14 (10), (2003) 1035-1047. Short version was in INFOCOM 2002.
2. 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).
3. M. Bahramgiri, M.T. Hajiaghayi, and V.S. Mirrokni, Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks, in: IEEE International Conference on Computer Communications and Networks (ICCCN) (2002).
4. L. Hu, Topology control for multihop packet radio networks, IEEE Trans. Communications, 41 (10), (1993).
5. 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 Symposium on Principle of Distributed Computing (PODC) (2001).
6. R. Rajaraman, Topology control and routing in ad hoc networks: A survey, In: SIGACT News, 33, (2002) 60-73.
7. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: IEEE INFOCOM (2000).
8. R. Wattenhofer, L. Li, P. Bahl and Y.-M. Wang, Distributed topology control for wireless multihop ad-hoc networks, in: IEEE INFOCOM'01 (2001).
9. J. Gao, L. J. Guibas, J. Hershburger, L. Zhang and A. Zhu, Discrete mobile centers, in: Proceedings of the 17th ACM Symposium on Computational Geometry (SoCG 01), (2001), pp. 188-196.
10. M. Grünewald, T. Lukovszki, C. Schindelhauer and K. Volbert, Distributed maintenance of resource efficient wireless network topologies, P roc. of the 8th European Conference on Parallel Computing (EuroPar'02), (2002).
11. L. Jia, R. Rajaraman and C. Scheideler, On local algorithms for topology control and routing in ad hoc networks, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2003.
12. X.-Y. Li, P.-J. Wan and Y. Wang, Power efficient and sparse spanner for wireless ad hoc networks, in: IEEE International Conference on Computer Communications and Networks (ICCCN01), (2001), pp. 564-567.
13. X.-Y. Li, P.-J. Wan, Y. Wang and O. Frieder, Sparse power efficient topology for wireless networks, in: IEEE Hawaii Int. Conf. on System Sciences (HICSS), 2002.
14. 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.
15. L. Kleinrock and J. Silvester, Optimum transmission radii for packet radio networks or why six is a magic number, in: Proc. of the IEEE National Telecommunications Conference, 1978, pp. 431-435.
16. B. Karp and H.T. Kung, GPSR: Greedy perimeter stateless routing for wireless networks, in: Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 2000.
17. P. Bose, P. Morin, I. Stojmenovic and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. ACM/Kluwer Wireless Networks, 7(6), (2001) 609-616.
18. In ACM DIAIM 99, pages 48-55, 1999.
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. 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).
22. J. Gao, L. J. Guibas, J. Hershburger, L. Zhang, and A. Zhu, Geometric spanner for routing in mobile networks, in Proceedings of the 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 01), 2001.
23. Limin Hu, Topology control for multihop packet radio networks, IEEE Transactions on Communications, vol. 41, 1993.
24. D.P. Dobkin, S.J. Friedman, and K.J. Supowit, Delaunay graphs are almost as good as complete graphs, Discrete Computational Geometry, 1990.
25. J.M. Keil and C.A. Gutwin, The delaunay triangulation closely approximates the complete euclidean graph, in: Proc. 1st Workshop Algorithms Data Structure (LNCS 382), 1989.
26. J. M. Keil and C. A. Gutwin, Classes of graphs which approximate the complete euclidean graph, Discrete Computational Geometry, 7 (1992).
27. X.-Y. Li and Y. Wang, Efficient construction of low weight bounded degree planar spanner, International Journal of Computational Geometry and Applications, 14, (1/2), (2004) 69-84. Short version was in COCOON 2003.
28. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan, "Improved greedy algorithms for constructing sparse geometric spanners," in: Scandinavian Workshop on Algorithm Theory, (2000), pp. 314-327.
29. A.C.-C. Yao, On constructing minimum spanning trees in k-dimensional spaces and related problems, SIAM J. Computing, 11, (1982) 721-736.
30. P. Bose and P. Morin, Online routing in triangulations, in: Proc. of the 10th Annual Int. Symp. on Algorithms and Computation ISAAC (1999).
31. S. Arya, G. Das, D. Mount, J. Salowe and M. Smid, Euclidean spanners: short, thin, and lanky, in: Proc. 27th ACM STOC, (1995) pp. 489-498.
32. W. Wang, X.-Y. Li, K. Moaveninejad, Y. Wang and W.-Z. Song. The Spanning Ratios of beta-Skeleton. in Proc. Canadian Conference on Computational Geometry (CCCG) (2003).
33. F. P. Preparata and M. I. Shamos, Computational Geometry: an Introduction (Springer-Verlag 1985).
34. G. Cǎlinescu, Computing 2-hop neighborhoods in ad hoc wireless networks, 2002, in Proc. AdHoc-Now (2003).
35. K. Alzoubi, P.-J. Wan and O. Frieder, Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks, in 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (2002).
36. P. Bose, J. Gudmundsson and P. Morin. Ordered theta graphs. In Proc. of Canadian Conf. on Computational Geometry (CCCG), 2002.
37. X.-Y. Li, G. Calinescu and P.-J. Wan, Distributed construction of planar spanner and routing for ad hoc wireless networks, in IEEE INFOCOM (2002).