Abstract
The geographic routing technology is good for the self-organizing and large-scale Wireless Sensor Networks(WSNs), and the energy-limited sensor nodes require the energy used for routing to be minimum. In this paper a new energy-efficient geographic routing algorithm is proposed and it is distributed and based on the geographic routing, the topology characteristics of the network and the wireless communication energy model. The algorithm is based on the planarized graph (GG) of the network, it deals with the routing void by saving more face neighbors in every node, and selects the most energy-efficient nexthop node by using the energy-saving technologies including the Minimum Energy One-hop Neighbor Path Selection and the Optimal Face-neighbor Selection. The theoretical analysis and simulations show that the algorithm is feasible and more energy-efficient than many existed geographic routing algorithms. In the end , the means of face information maintenance are proposed.
This paper is founded by the Chinese National 973 Natural Science Fund “Routing and Switching Theory of Next Generation Internet”(2003CB314802).
Chapter PDF
Similar content being viewed by others
Keywords
References
Akyildiz, I.F., et al.: Wireless sensor networks: a survey. Computer Networks 38, 392–422 (2002)
Shigang, C., Guangbin, F., Jun-Hong, C.: Avoid Void in Geographic Routing for Data Aggregation in Sensor Networks. International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Special Issue on Wireless Sensor Networks 2(1) (2006)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, August 1999, pp. 51–54 (1999)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th annual international conference on Mobile computing and networking (Mobicom 2000), Boston, Massachusetts, August 2000, pp. 243–254 (2000)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: MobiHoc 2003. Proceedings of the 4th ACM International Symposium on Mobile Computing and Networking, ACM Press, New York (2003)
Leong, B., Mitra, S., Liskov, B.: Path vector face routing: Geographic routing with local face information. In: ICNP 2005. Proceedings of the 13th IEEE International Conference on Network Protocols (2005)
Peng, H., Jian-Dong, L., Yan-Hui, C., Lei, Z.: A Routing Algorithm for Ad Hoc Networks Based on Delaunay Triangulation. Journal of Software (Chinese) 17(5), 1149–1156 (2006)
Prosenjit, B., Luc, D., William, S.E., David, G.K.: On the spanning ratio of Gabriel graphs and beta-skeletons. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 479–493. Springer, Heidelberg (2002)
Toussaint, G.: The relative neighborhood graph of a finite planar set. Pattern Recognition 12(4), 261–268 (1980)
Qingfeng, H., Chenyang, L., Roman G.-C.: Reliable Mobicast via Face-Aware Routing. In: INFOCOMM 2004 (2004)
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Transactions on Wireless Communications 1(4), 660–670 (2002)
THE CMU MONARCH GROUP. Wireless and mobility extensions to ns-2, http://www.monarch.cs.rice.edu
Li, X.-Y., Calinescu, G., Wan, P.-J.: Distributed construction of a planar spanner and routing for ad hoc wireless networks. In: INFOCOM 2002. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society, June 23-27, 2002, vol. 3, pp. 1268–1277. IEEE Computer Society, Los Alamitos (2002)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: Proceedings of USENIX Symposium on Network Systems Design and Implementation, May 2005, Boston, Massachusetts, USA (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Zi-Jin, T., Yi, W., Zheng-Hu, G. (2007). EEGFGR: An Energy-Efficient Greedy-Face Geographic Routing for Wireless Sensor Networks. In: Li, K., Jesshope, C., Jin, H., Gaudiot, JL. (eds) Network and Parallel Computing. NPC 2007. Lecture Notes in Computer Science, vol 4672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74784-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-74784-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74783-3
Online ISBN: 978-3-540-74784-0
eBook Packages: Computer ScienceComputer Science (R0)