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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Liming, S., Jianzhong, L., Yu, C., et al.: Wireless Sensor Networks [M], pp. 89–94. Beijing TsingHua Press (2005)
Karl, H., Willig, A.: Protocols and Architectures for Wireless Sensor Networks [M]. John Wiley and Sons, Inc., Germany (2005)
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)
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)
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)
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)
GPSR code [EB/OL], http://www.cs.cmu.edu/~bkarp/gpsr/gpsr-ns-2.1b6.tar.gz
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, T., Huang, Y., Chen, J., Yang, G., Rong, C. (2008). Di-GAFR: Directed Greedy Adaptive Face-Based Routing. In: Rong, C., Jaatun, M.G., Sandnes, F.E., Yang, L.T., Ma, J. (eds) Autonomic and Trusted Computing. ATC 2008. Lecture Notes in Computer Science, vol 5060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69295-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-69295-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69294-2
Online ISBN: 978-3-540-69295-9
eBook Packages: Computer ScienceComputer Science (R0)