Di-GAFR: Directed Greedy Adaptive Face-Based Routing

  • Tao Yang
  • Ye Huang
  • Jianxin Chen
  • Geng Yang
  • Chunming Rong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5060)

Abstract

In this paper, we present Di-GAFR, a novel WSN geometric routing algorithm containing greedy, face and directed routing. In Di-GAFR, forwarding decisions merely depend on information about a node’s immediate neighbors in the network topology, which made the algorithm absolutely local and highly scalable. Additionally, we have proved that Di-GAFR was asymptotically optimal. Simulations demonstrate that Di-GAFR sufficiently outperforms other prominent algorithms, such as GPSR and GOAFR, in the “critical” region.

Keywords

Geometric routing face routing directed routing Di-GAFRs 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks [C]. In: Proc. 11th Canadian Conference on Computational Geometry, Vancouver, pp. 51–54 (1999)Google Scholar
  2. 2.
    Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing [C]. In: Proc. Dial-M 2002, Atlanta, Georgia, pp. 24–33 (2002)Google Scholar
  3. 3.
    Karp, B., Kung, H.: GPSR: greedy perimeter stateless routing for wireless networks [C]. In: Proceedings of the 6th annual international conference on Mobile computing and networking, Boston, Massachusetts, pp. 243–254 (2000)Google Scholar
  4. 4.
    Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing [C]. In: Proc. 4th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc.), Annapolis, Maryland, pp. 267–278 (2003)Google Scholar
  5. 5.
    Liming, S., Jianzhong, L., Yu, C., et al.: Wireless Sensor Networks [M], pp. 89–94. Beijing TsingHua Press (2005)Google Scholar
  6. 6.
    Karl, H., Willig, A.: Protocols and Architectures for Wireless Sensor Networks [M]. John Wiley and Sons, Inc., Germany (2005)Google Scholar
  7. 7.
    Ortiz, J., Moon, D., Bker, C., Fonseca, R., Stoica, I.: Location Service for Point-to-Point Routing in Wireless Sensor Networks [C]. In: IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks, pp. 166–175 (2007)Google Scholar
  8. 8.
    Nath, S., Gibbons, P.B.: Communicating via Fireflies: Geographic Routing on Duty-Cycled Sensors [C]. In: IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks, pp. 440–449 (2007)Google Scholar
  9. 9.
    Milosavljevic, N., Nguyen, A., Fang, Q., Gao, J., Guibas, L.: Landmark Selection and Greedy Landmark-descent Routing for Sensor Networks [C]. In: Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, pp. 661–669 (2007)Google Scholar
  10. 10.
    Tsai, M., Yang, H., Huang, W.: Axis-Based Virtual Coordinate Assignment Protocol and Delivery Guaranteed Routing Protocol in Wireless Sensor Networks [C]. In: Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, pp. 2234–2242 (2007)Google Scholar
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tao Yang
    • 1
  • Ye Huang
    • 1
  • Jianxin Chen
    • 1
  • Geng Yang
    • 1
  • Chunming Rong
    • 2
  1. 1.College of Computer ScienceNanjing University of Posts and Telecommunications(NJUPT) 
  2. 2.Department of Electrical and Computer EngineeringUniversity of Stavanger 

Personalised recommendations