Localized routing for wireless ad hoc networks

IEEE International Conference on Communications

Volumn 1, Issue , 2003, Pages 443-447

  Li, Xiang Yang ^a   Wang, Yu ^a   Frieder, Ophir ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GLOBAL POSITIONING SYSTEM; GRAPH THEORY; NETWORK PROTOCOLS; PROBABILITY;

AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0038729337     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Xiang-Yang Li, G. Calinescu, and Peng-Jun Wan, "Distributed construction of planar spanner and routing for ad hoc wireless networks," in 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2002, vol. 3.
2. David B Johnson and David A Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing, Imielinski and Korth, Eds., vol. 353. Kluwer Academic Publishers, 1996.
3. S. Murthy and J. Garcia-Luna-Aceves, "An efficient routing protocol for wireless networks," ACM Mobile Networks and Applications Journal, Special issue on Routing in Mobile Communication Networks, vol. 1, no. 2, 1996.
4. V. Park and M. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in IEEE Infocom, 1997.
5. C. Perkins, "Ad-hoc on-demand distance vector routing," in MILCOM '97, Nov. 1997.
6. C. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing," in Proc. of the ACM SIGCOMM, October, 1994.
7. P. Sinha, R. Sivakumar, and V. Bharghavan, "Cedar: Core extraction distributed ad hoc routing algorithm," IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1454 -1465, August 1999.
8. Ivan Stojmenovic and Xu Lin, "Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 10, 2001.
9. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," ACM/Kluwer Wireless Networks, vol. 7, no. 6, 2001.
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. K.R. Gabriel and R.R. Sokal, "A new statistical approach to geographic variation analysis," Systematic Zoology, vol. 18, pp. 259-278, 1969.
12. 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.
13. Yu Wang, Xiang-Yang Li, and Ophir Frieder, "Distributed spanner with bounded degree for wireless networks," Telecommunication Systems. Special Issue on Mobile Computing and Wireless Networks, 2002, Accepted for publication.
14. Xiang-Yang Li, Peng-Jun Wan, Yu Wang, and Ophir Frieder, "Sparse power efficient topology for wireless networks," Journal of Parallel and Distributed Computing, 2002, To appear. Preliminary version appeared in ICCCN 2001.
15. P. Bose and P. Morin. "Online routing in triangulations," in Proc. of the 10th Annual Int. Symp. on Algorithms and Computation ISAAC, 1999.
16. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis. Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W. M. McEneaney, G. Yin, and Q. Zhang (Eds.), 1998.
17. E. Kranakis, H. Singh, and J. Urrutia, "Compass routing on geometric networks," in Proc. 11 th Canadian Conference on Computational Geometry, 1999, pp. 51-54.
18. Xiang-Yang Li, Peng-Jun Wan, and Yu Wang, "Power efficient and sparse spanner for wireless ad hoc networks," in IEEE Int. Conf. on Computer Communications and Networks (ICCCN01), 2001, pp. 564-567.
19. Godfried T. Toussaint, "The relative neighborhood graph of a finite planar set," Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.
20. A. C.-C. Yao, "On constructing minimum spanning trees in k-dimensional spaces and related problems," SIAM J. Computing, vol. 11, pp. 721-736, 1982.
21. Tamas Lukovszki, New Results on Geometric Spanners and Their Applications, Ph.D. thesis, University of Paderborn, 1999.
22. Matthias Fischer, Tamas Lukovszki, and Martin Ziegler, "Partitioned neighborhood spanners of minimal outdegree," Tech. Rep., Heinz Nixdore Institute, Germany, 1999.
23. D.P. Dobkin, S.J. Friedman, and K.J. Supowit, "Delaunay graphs are almost as good as complete graphs," Discr. Comp. Geom., pp. 399-407, 1990.
24. 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.
25. J. M. Keil and C. A. Gutwin, "Classes of graphs which approximate the complete euclidean graph," Discr. Comp. Geom., vol. 7, pp. 13-28, 1992.
26. P. Morin, Online routing in Geometric Graphs, Ph.D. thesis, Carleton University School of Computer Science, 2001.
27. Martin Mauve, Jorg Widmer, and Hannes Harenstein, "A survey on position-based routing in mobile ad hoc networks," IEEE Network Magazine, vol. 15, no. 6, pp. 30-39, 2001.
28. Mathew Penrose, "On k-connectivity for a geometric random graph," Random Structures and Algorithms, vol. 15, pp. 145-164, 1999.
29. Mathew Penrose, "The longest edge of the random minimal spanning tree," Annals of Applied Probability, vol. 7, pp. 340-361, 1997.