Abstract
Wireless sensor networks have attracted great attention in research and industrial development due to their fast-growing application potentials. Most of the existing geographic routing algorithms for wireless sensor networks are based on maintaining one-hop neighbors on the sensor node, leading to a well-known void problem. In this paper, we demonstrate that we can improve routing performance by storing more neighbors (called spatial neighbors) on the sensor nodes so as to avoid the void problem. We propose a neighborhood discovery algorithm and a neighborhood maintenance strategy to collect and maintain the spatial neighbors for each node. Based on the spatial neighbors on each node, we propose an Anti-Void Geographic Routing algorithm. Simulation results show that the AVGR routing algorithm outperforms the typical routing algorithm GPG/GPSR, especially in networks with more voids.
This research is partially supported by the Doctoral Foundation of National Education Ministry of China under Grant No.20059998022.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Steere, D.C., Baptista, A., McNamee, D., Pu, C., Walpole, J.: Research challenges in environmental observation and forecasting systems. In: Proceedings of International Conference on Mobile Computing and Networking, pp. 292–299 (2000)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM 1999) (August 1999)
Karp, B., Kung, H.T.: GSPR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, Boston, MA, August 2000, pp. 243–254 (2000)
Jain, R., Puri, A., Sengupta, R.: Geographical routing using partial information for wireless ad hoc networks. IEEE Personal Communications 8(1), 48–57 (2001)
Li, J., Jannotti, J., DeCouto, D., Karger, D., Morris, R.: A scalable location service for geographic ad-hoc routing. In: Proc. 6th Annu. ACM/IEEE International Conference on Mobile Computeing and Networking (2000)
Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., Shenker, S.: GHT: A geographic hash table for data-centric storage in sensornets. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp. 78–87 (2002)
He, T., Stankovic, J.A., Lu, C., Abdelzaher, T.F.: SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks. In: Proceedings of International Conference on Distributed Computing Systems (ICDCS 2003) (May 2003)
Melodia, T., Pomppili, D., Akyildiz, I.F.: Optimal local topology knowledge for energy efficient geographical routing in sensor networks. In: Proceedings of IEEE Infocom, Hong Kong (March 2004)
Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, ISI (March 1987)
Hou, T., Li, V.: Transmission range control in multihop packet radio networks. IEEE Transactions on Communications 34(2), 38–44 (1986)
Takagi, H., Kleinrock, L.: Opimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications 32(3), 246–257 (1984)
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)
Chen, S., Fan, G., Cui, J.-H.: 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)
Kim, H.S., Abdelzaher, T.F., Kwon, W.H.: Minimum-Energy Asynchronous Dissemination to Mobile Sinks in Wireless Sensor Networks. In: Proceedings of ACM SenSys (November 2003)
Huang, Q., Lu, C., Roman, G.-C.: Reliable Mobicast via Face-Aware Routing. In: Proceedings of IEEE Infocom, Hong Kong (March 2004)
Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18, 259–278 (1969)
Toussaint, G.: The relative neighborhood graph of a finite planar set. Pattern Recognition 12(4), 261–268 (1980)
Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: Proc. ACM MobiHoc, pp. 45–55 (October 2001)
Wattenhofer, R.: Principles of Distributed Computing. Lecture Notes, www.dcg.ethz.ch/lectures/ss05/distcomp/lecture/chapter2.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, M., Chen, Y., Wu, Y., Yu, W. (2006). An Anti-void Geographic Routing Algorithm for Wireless Sensor Networks. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_6
Download citation
DOI: https://doi.org/10.1007/11943952_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49932-9
Online ISBN: 978-3-540-49933-6
eBook Packages: Computer ScienceComputer Science (R0)