The Community for Technology Leaders
RSS Icon
Issue No.09 - September (2010 vol.59)
pp: 1224-1238
Hannes Frey , University of Paderborn, Paderborn, Germany
Ivan Stojmenovic , University of Ottawa, Ontario, Canada
In this paper, we provide a thorough theoretical study on delivery guarantees, loop-free operation, and worst-case behavior of face and combined greedy-face routing. We show that under specific planar topology control schemes, recovery from a greedy routing failure is always possible without changing between any adjacent faces. Guaranteed delivery then follows from guaranteed recovery while traversing the very first face. In arbitrary planar graphs, however, a proper face selection mechanism is of importance since recovery from a greedy routing failure may require visiting a sequence of faces before greedy routing can be restarted again. We provide complete and formal proofs that several proposed face routing and combined greedy-face routing schemes guarantee message delivery in specific planar graph classes or even in arbitrary planar graphs. We also discuss the reasons why other methods fail to deliver a message or even end up in a loop. In addition, we investigate the behavior of face routing in arbitrary not necessarily planar networks and show, while delivery guarantees cannot be supported in such a general case, most face and combined greedy-face routing variants support at least loop-free operation. For those variants, we derive worst-case upper bounds on the number of forwarding steps.
Ad hoc network, sensor network, face routing, correctness analysis, worst-case analysis.
Hannes Frey, Ivan Stojmenovic, "On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks", IEEE Transactions on Computers, vol.59, no. 9, pp. 1224-1238, September 2010, doi:10.1109/TC.2010.107
[1] J. Wu and I. Stojmenovic, "Ad Hoc Networks," Computer, vol. 37, no. 2, pp. 29-31, Feb. 2004.
[2] G.G. Finn, "Routing and Addressing Problems in Large Metropolitan-Scale Internetworks," Technical Report ISI/RR-87-180, Information Sciences Inst. (ISI), 1987.
[3] H. Frey and I. Stojmenovic, "Geographic and Energy Aware Routing in Sensor Networks," Handbook on Sensor Networks, I. Stojmenovic, ed., Wiley, 2005.
[4] S. Giordano and I. Stojmenovic, "Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy," Ad Hoc Wireless Networking, X. Cheng, X. Huang, and D.-Z. Du, eds., pp. 103-136, Kluwer, 2004.
[5] J. Hightower and G. Borriella, "Location Systems for Ubiquitous Computing," Computer, vol. 34, no. 8, pp. 57-66, Aug. 2001.
[6] I. Stojmenovic, "Location Updates for Efficient Routing in Ad Hoc Networks," Handbook of Wireless Networks and Mobile Computing, I. Stojmenovic, ed., pp. 451-471, Wiley, 2002.
[7] H. Takagi and L. Kleinrock, "Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals," IEEE Trans. Comm., vol. 32, no. 3, pp. 246-257, Mar. 1984.
[8] I. Stojmenovic and X. Lin, "Power-Aware Localized Routing in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, Nov. 2001.
[9] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with Guaranteed Delivery in Ad Hoc Wireless Networks," Proc. Third ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M '99), pp. 48-55, Aug. 1999.
[10] B. Karp and H.T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM/IEEE MobiCom, 2000.
[11] E. Kranakis, H. Singh, and J. Urrutia, "Compass Routing on Geometric Networks," Proc. 11th Canadian Conf. Computational Geometry (CCCG '99), pp. 51-54, Aug. 1999.
[12] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric Ad-Hoc Routing: Of Theory and Practice," Proc. 22nd ACM Int'l Symp. Principles of Distributed Computing (PODC), pp. 63-72, 2003.
[13] G. Toussaint, "The Relative Neighborhood Graph of a Finite Planar Set," Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.
[14] K.R. Gabriel and R.R. Sokal, "A New Statistical Approach to Geographic Variation Analysis," Systematic Zoology, vol. 18, pp. 259-278, 1969.
[15] X.-Y. Li, I. Stojmenovic, and Y. Wang, "Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 4, pp. 350-361, Apr. 2004.
[16] J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric Spanner for Routing in Mobile Networks," Proc. ACM MobiHoc, pp. 45-55, 2001.
[17] X.-Y. Li, G. Calinescu, and P.-J. Wan, "Distributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks," Proc. IEEE INFOCOM, vol. 3, pp. 1268-1277, June 2002.
[18] L. Barriere, P. Fraigniaud, L. Narajanan, and J. Opatrny, "Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges," Proc. Fifth ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M '01), pp. 19-27, 2001.
[19] F. Kuhn, R. Wattenhofer, and A. Zollinger, "Ad-Hoc Networks Beyond Unit Disk Graphs," Proc. ACM DIALM-POMC Joint Workshop Foundations of Mobile Computing, pp. 69-78, Sept. 2003.
[20] H. Frey, "Geographical Cluster Based Routing with Guaranteed Delivery," Proc. Second IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS '05), Nov. 2005.
[21] Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "On the Pitfalls of Geographic Face Routing," Proc. Third ACM/SIGMOBILE Int'l Workshop Foundation of Mobile Computing (DIAL-M-POMC), 2005.
[22] S. Durocher, D. Kirkpatrick, and L. Narayanan, "On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks," Proc. Ninth Int'l Conf. Distributed Computing and Networking (ICDCN '08), pp. 546-557, 2008.
[23] F. Kuhn, R. Wattenhofer, and A. Zollinger, "Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing," Proc. ACM MobiHoc, 2003.
[24] B. Leong, S. Mitra, and B. Liskov, "Path Vector Face Routing: Geographic Routing with Local Face Information," Proc. 13th IEEE Int'l Conf. Network Protocols (ICNP '05), 2005.
[25] I. Stojmenovic and X. Lin, "Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 1023-1032, Oct. 2001.
[26] Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "Geographic Routing Made Practical," Proc. USENIX Symp. Network Systems Design and Implementation, May 2005.
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool