This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rules of Designing Routing Metrics for Greedy, Face, and Combined Greedy-Face Routing
April 2010 (vol. 9 no. 4)
pp. 582-595
Yujun Li, University of Electronic Sicence and Technology of China, Chengdu and Virginia Polytechnic Institute and State University, Blacksburg
Yaling Yang, Virginia Polytechnic Institute and State University, Blacksburg
Xianliang Lu, University of Electronic Sicence and Technology of China, Chengdu
Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metrics with a geographic routing protocol may produce unexpected results, such as geographic routing loops and unreachable nodes. In this paper, we propose a novel routing algebra system to investigate the compatibilities between routing metrics and three geographic routing protocols including greedy, face, and combined greedy-face routing. Five important algebraic properties, respectively, named odd symmetry, transitivity, strict order, source independence, and local minimum freeness, are defined in this algebra system. Based on these algebraic properties, the necessary and sufficient conditions for loop-free, delivery-guaranteed, and consistent routing are derived when greedy, face, and combined greedy-face routing serve as packet forwarding schemes or as path discovery algorithms, respectively. Our work provides essential criteria for evaluating and designing geographic routing protocols.

[1] Y. Li, Y. Yang, and X. Lu, "Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing," Proc. IEEE INFOCOM, 2009.
[2] 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.
[3] T.-C. Hou and V. Li, "Transmission Range Control in Multihop Packet Radio Networks," IEEE Trans. Comm., vol. 34, no. 1, pp. 38-44, Jan. 1986.
[4] D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," Mobile Computing, vol. 353, 1996.
[5] C. Perkins and E. Royer, "Ad-Hoc On-Demand Distance Vector Routing," Proc. Workshop Mobile Computing Systems and Applications (WMCSA), pp. 90-100, Feb. 1999.
[6] S.-J. Lee and M. Gerla, "Dynamic Load-Aware Routing in Ad Hoc Networks," Proc. IEEE Int'l Conf. Comm. (ICC '01), vol. 10, pp. 3206-3210, 2001.
[7] H. Hassanein and A. Zhou, "Routing with Load Balancing in Wireless Ad Hoc Networks," Proc. Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWIM), pp. 89-96, 2001.
[8] R. Draves, J. Padhye, and B. Zill, "Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks," Proc. ACM MobiCom, 2004.
[9] P. Misra and P. Enge, Global Positioning System: Signals, Measurements and Performance. Ganga-Jamuna, 2001.
[10] A. Savvides, C.-C. Han, and M.B. Strivastava, "Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors," Proc. ACM MobiCom, 2001.
[11] N. Bulusu, J. Heidemann, and D. Estrin, "Gps-Less Low-Cost Outdoor Localization for Very Small Devices," IEEE Personal Comm., vol. 7, no. 5, pp. 28-34, Oct. 2000.
[12] K. Seada, M. Zuniga, A. Helmy, and B. Krishnamachari, "Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks," Proc. Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2004.
[13] Y. Yu, R. Govindan, and D. Estrin, "Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks," technical report, University of California, Los Angeles, Computer Science Dept., 2001.
[14] S. Lee, B. Bhattacharjee, and S. Banerjee, "Efficient Geographic Routing in Multihop Wireless Networks," Proc. ACM MobiHoc, 2005.
[15] H. Frey, "Scalable Geographic Routing Algorithms for Wireless Ad Hoc Networks," IEEE Network, vol. 18, no. 4, pp. 18-22, July/Aug. 2004.
[16] T. Melodia, D. Pompili, and I. Akyildiz, "Optimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks," Proc. IEEE INFOCOM, Mar. 2004.
[17] H. Frey and I. Stojmenovic, "On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks," Proc. ACM MobiCom, 2006.
[18] B. Karp and H.T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM MobiCom, 2000.
[19] E. Kranakis, S.O.C. Science, H. Singh, and J. Urrutia, "Compass Routing on Geometric Networks," Proc. 11th Canadian Conf. Computational Geometry, pp. 51-54, 1999.
[20] B. Leong, S. Mitra, and B. Liskov, "Path Vector Face Routing: Geographic Routing with Local Face Information," Proc. Int'l Conf. Network Protocols (ICNP), 2005.
[21] J. Sobrinho, "Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet," Proc. IEEE INFOCOM, 2001.
[22] J. Sobrinho, "Network Routing with Path Vector Protocols: Theory and Applications," Proc. SIGCOMM, 2003.
[23] T.G. Griffin and J.L. Sobrinho, "Metarouting," Proc. SIGCOMM, 2005.
[24] J. Sobrinho, "An Algebraic Theory of Dynamic Network Routing," IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 1160-1173, Oct. 2005.
[25] Y. Yang and J. Wang, "Design Guidelines for Routing Metrics in Multihop Wireless Networks," Proc. IEEE INFOCOM, Apr. 2008.
[26] G.G. Finn, "Routing and Addressing Problems in Large Metropolitan-Scale Internetworks," ISI research reports, 1987.
[27] R. Nelson and L. Kleinrock, "The Spatial Capacity of a Slotted Aloha Multihop Packet Radio Network with Capture," IEEE Trans. Comm., vol. 32, no. 6, pp. 684-694, June 1984.

Index Terms:
Geographic routing, routing algebra, loop freeness, delivery guarantee, consistency.
Citation:
Yujun Li, Yaling Yang, Xianliang Lu, "Rules of Designing Routing Metrics for Greedy, Face, and Combined Greedy-Face Routing," IEEE Transactions on Mobile Computing, vol. 9, no. 4, pp. 582-595, April 2010, doi:10.1109/TMC.2009.171
Usage of this product signifies your acceptance of the Terms of Use.