Jie Gao
Leonidas J. Guibas
John Hershberger
ABSTRACT
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: (1) it is a planar graph; (2) between any two nodes there exists a path in the RDG whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the optimum length possible; and (3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We also show by simulation that the RDG outperforms the previously proposed routing graphs under the Greedy Perimeter Stateless Routing (GPSR) protocol. In addition, we investigate theoretical bounds on the quality of paths discovered using GPSR
- 1.A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In 19th IEEE INFOCOM, March 1999.Google Scholar
- 2.S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward. A distance routing effect algorithm for mobility (DREAM). In Proc. ACM/IEEE MobiCom, pages 76-84, 1998. Google ScholarDigital Library
- 3.P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick. On the spanning ratio of gabriel graphs and B-skeleton submitted to SIAM Jounral onDiscrete Mathematics 2001. Google ScholarDigital Library
- 4.P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In 3rd Int. Workshop on Discrete Algorithms and methods for mobile computing and communications (DialM '99), 1999. Google ScholarDigital Library
- 5.L. P. Chew. There is a planar graph almost as good as the complete graph. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 169-177, 1986. Google ScholarDigital Library
- 6.C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla. Routing in clustered multihop, mobile wireless networks with fading channel. In Proc. IEEE SICON '97, pages 197-211, Apr 1997.Google Scholar
- 7.B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In IEEE International Conference on Communications (ICC'97), 1997.Google ScholarCross Ref
- 8.D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. In Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., pages 20-26, 1987.Google ScholarDigital Library
- 9.A. Ephremides, J. E. Wieselthier, and D. J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. of IEEE, 75(1):56-73, Jan 1987.Google ScholarCross Ref
- 10.D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science Publishers B.V. North- Holland, Amsterdam, 2000.Google Scholar
- 11.J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Discrete mobile centers. In Proc. 17th ACM Symp. on Computational Geometry, Jun 2001. Google ScholarDigital Library
- 12.M. Gerla and J. Tsai. Multicluster, mobile, multimedia radio network. ACM-Baltzer Journal of Wireless Networks, 1(3), 1995. Google ScholarDigital Library
- 13.B. Karp and H. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243-254, 2000. Google ScholarDigital Library
- 14.J. M. Keil and C. A. Gutwin. The delaunay triangulation closely approximates the complete euclidean graph. In Proc. International Workshop on Algorithms and Data Structures, volume 382 of Lecture Notes Comput. Sci., pages 47-56, 1989. Google ScholarDigital Library
- 15.Y.-B. Ko and N. H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. In Proc. ACM/IEEE MobiCom, pages 66-75, 1998. Google ScholarDigital Library
- 16.J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In Proc. 6th Annu. ACM/IEEE International Conference on Mobile Computeing and Networking., 2000. Google ScholarDigital Library
- 17.V. D. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. IEEE Infocom, pages 1405-1413, 1997. Google ScholarDigital Library
- 18.C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In Proc. of 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999. Google ScholarDigital Library
- 19.F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985. Google ScholarDigital Library
- 20.V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. IEEE J. Selected Areas in Communications, 17(8):1333-1344, August 1999. Google ScholarDigital Library
- 21.E. M. Royer and C.-K. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, 6(2):46-55, Apr 1999.Google ScholarCross Ref
- 22.R. Wattenhofer, L. Li, P. Bahl, and Y. M. Wang. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In Proc. IEEE Infocom, 2001.Google ScholarCross Ref
- 23.J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing & Communications, 1999. Google ScholarDigital Library
Index Terms
- Geometric spanner for routing in mobile networks
Recommendations
Geometric spanners for routing in mobile networks
We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following ...
Adaptive routing in mobile opportunistic networks
MSWIM '10: Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systemsIn this paper, we study how to adapt the routing according to dynamic network conditions in wireless ad hoc networks. We present a method that dynamically chooses routing agent between ad hoc on-demand distance vector routing protocol (AODV) with TCP (...
Efficient on-demand routing for mobile ad hoc wireless access networks
In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the ...
Comments