Abstract
Geographic routing is becoming the protocol of choice for many sensor network applications. The current state of the art is unsatisfactory: some algorithms are very efficient, however they require a preliminary planarization of the communication graph. Planarization induces overhead and is thus not realistic for some scenarios such as the case of highly dynamic network topologies. On the other hand, georouting algorithms which do not rely on planarization have fairly low success rates and fail to route messages around all but the simplest obstacles. To overcome these limitations, we propose the GRIC geographic routing algorithm. It has absolutely no topology maintenance overhead, almost 100% delivery rates (when no obstacles are added), bypasses large convex obstacles, finds short paths to the destination, resists link failure and is fairly simple to implement. The case of hard concave obstacles is also studied; such obstacles are hard instances for which performance diminishes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rabaey, J.M., Josie Ammer, M., da Silva, J.L., Patel, D., Roundy, S.: Picoradio supports ad hoc ultra-low power wireless networking. Computer (2000)
Warneke, B., Last, M., Liebowitz, B., Pister, K.S.J.: Smart dust: communicating with a cubic-millimeter computer. Computer (2001)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks (2002)
Haenggi, M.: Challenges in wireless sensor networks. In: Handbook of Sensor Networks: Compact Wireless and Wired Systems, CRC Press, Boca Raton (2005)
Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: Scalable coordination in sensor networks. In: Mobile Computing and Networking, ACM Press, New York (1999)
Karl, H., Willig, A.: Protocols and Architectures for Wireless Sensor Networks. Wiley, Chichester (2005)
Zhao, F., Guibas, L.: Wireless Sensor Networks, an Information Processing Approach. Elsevier, Amsterdam (2004)
Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Technical report, Information Sciences Institute (1987)
Seada, K., Helmy, A., Govindan, R.: On the effect of localization errors on geographic face routing in sensor networks. In: Information Processing in Sensor Networks (2004)
Beutel, J.: Location management in wireless sensor networks. In: Handbook of Sensor Networks: Compact Wireless and Wired Systems, CRC Press, Boca Raton (2005)
Hightower, J., Borriello, G.: Location systems for ubiquitous computing. Computer (2001)
Leone, P., Moraru, L., Powell, O., Rolim, J.: A localization algorithm for wireless ad-hoc sensor networks with traffic overhead minimization by emission inhibition. Algorithmic Aspects of Wireless Sensor Networks (2006)
Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. Mobile Computing and Networking (2003)
Ahmed, N., Kanhere, S.S., Jha, S.: The holes problem in wireless sensor networks: a survey. SIGMOBILE Mob. Comput. Commun. Rev. (2005)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Discrete Algorithms and Methods for Mobile Computing and Communications (1999)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. Mobile Computing and Networking (2000)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Mobile ad hoc Networking & Computing (2003)
Powell, O., Nikoletseas, S.: Geographic routing around obstacles in wireless sensor networks. Technical report, Computing Research Repository (CoRR) (2007)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: On the pitfalls of geographic face routing. In: Foundations of mobile computing (2005)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: Networked Systems Design & Implementation (2005)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Lazy cross-link removal for geographic routing. In: Embedded Networked Sensor Systems (2006)
Fang, Q., Gao, J., Guibas, L.: Locating and bypassing holes in sensor networks. Mobile Networks and Applications (2006)
Chatzigiannakis, I., Dimitriou, T., Nikoletseas, S., Spirakis, P.: A probabilistic forwarding protocol for efficient data propagation in sensor networks. Journal of Ad hoc Networks (2006)
Antoniou, T., Chatzigiannakis, I., Mylonas, G., Nikoletseas, S., Boukerche, A.: A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range. In: Annual Simulation Symposium (ANSS). ACM/IEEE (2004)
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Smart dust protocols for local detection and propagation. Journal of Mobile Networks (MONET) (2005)
Chatzigiannakis, I., Kinalis, A., Nikoletseas, S.: Efficient and robust data dissemination using limited extra network knowledge. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, Springer, Heidelberg (2006)
Chatzigiannakis, I., Mylonas, G., Nikoletseas, S.: Modeling and evaluation of the effect of obstacles on the performance of wireless sensor networks. In: Annual Simulation Symposium (ANSS). ACM/IEEE (2006)
Hemmerling, A.: Labyrinth Problems: Labyrinth-Searching Abilities of Automata. B.G. Teubner, Leipzig (1989)
Yu, Y., Hong, B., Prasanna, V.: On communication models for algorithm design for networked sensor systems: A case study. Pervasive and Mobile Computing (2005)
Cerpa, A., Wong, J., Kuang, L., Potkonjak, M., Estrin, D.: Statistical model of lossy links in wireless sensor networks. In: Information processing in sensor networks (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Powell, O., Nikoletseas, S. (2007). Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks. In: Demetrescu, C. (eds) Experimental Algorithms. WEA 2007. Lecture Notes in Computer Science, vol 4525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72845-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-72845-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72844-3
Online ISBN: 978-3-540-72845-0
eBook Packages: Computer ScienceComputer Science (R0)