Abstract
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on the routing performance. When the size of the communication voids is increased, they might not scale well with respect to the quality of paths, measured in terms of hop count and path length.
This paper introduces a routing algorithm with early obstacle detection and avoidance. The routing decisions are based on path optimality evaluation, made at the node level, gradually over time. We implement our algorithm and evaluate different aspects: message delivery performance, topology control overhead and algorithm convergence time. The simulation findings demonstrate that our algorithm manages to improve significantly and quite fast the path quality while keeping the computational complexity and message overhead low. The algorithm is fully distributed, and uses only limited local network knowledge.
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
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609–616 (2001)
Chatzigiannakis, I., Dimitriou, T., Nikoletseas, S., Spirakis, P.: A probabilistic algorithm for efficient and robust data propagation in smart dust networks. Ad-Hoc Networks Journal 4(5), 621–635 (2006)
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.G.: Efficient and robust protocols for local detection and propagation in smart dust networks. Special Issue on Algorithmic Solutions for Wireless,Mobile, Ad Hoc and Sensor Networks, ACM/Baltzer Mobile Networks and Applications(MONET) Journal 10(1-2), 133–149 (2005)
Chen, D., Varshney, P.K.: A survey of void handling techniques for geographic routing in wireless networks. Communications Surveys and Tutorials, 50–67 (2007)
Chen, S., Fan, G., Cui, J.: 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 (2006)
Datta, S., Stojmenovic, I., Wu, J.: Internal node and shortcut based routing with guaranteed delivery in wireless networks. Cluster Computing 5(2), 169–178 (2002)
Fang, Q., Gao, J., Guibas, L.J.: Locating and bypassing holes in sensor networks. Mob. Netw. Appl. 11(2), 187–200 (2006)
Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis (1969)
Heissenbüttel, M., Braun, T., Bernoulli, T., Wälchli, M.: BLR: Beacon-less routing algorithm for mobile ad-hoc networks (2003)
Jain, R., Puri, A., Sengupta, R.: Geographical routing using partial information for wireless ad hoc networks (1999)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Mobile Computing and Networking, pp. 243–254 (2000)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: NSDI 2005: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation, pp. 217–230. USENIX Association, Berkeley (2005)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11 th Canadian Conference on Computational Geometry, Vancouver, August 1999, pp. 51–54 (1999)
Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: Of theory and practice (2003)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing. In: Proc. 4th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc) (2003)
Lin, X., Lakshdisi, M., Stojmenovic, I.: Location based localized alternate, disjoint, multi-path and component routing schemes for wireless networks. In: MobiHoc 2001: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, pp. 287–290. ACM, New York (2001)
Mathar, R., Mattfeldt, J.: Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wirel. Netw. 2(4), 329–342 (1996)
Moraru, L., Leone, P., Nikoletseas, S., Rolim, J.D.P.: Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms. In: Q2SWinet 2007: Proceedings of the 3rd ACM Workshop on QoS and security for wireless and mobile networks, pp. 31–38. ACM Press, New York (2007)
Nikoletseas, S., Powell, O.: Simple and efficient geographic routing around obstacles for wireless sensor networks. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 161–174. Springer, Heidelberg (2007)
Stojmenovic, I., Lin, X.: Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Trans. Parallel Distrib. Syst. 12(10), 1023–1032 (2001)
Toussaint, G.: Some unsolved problems on proximity graphs (1991)
Urrutia, J.: Routing with guaranteed delivery in geometric and wireless networks. In: Handbook of wireless networks and mobile computing, pp. 393–406. John Wiley & Sons, Inc., New York (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moraru, L., Leone, P., Nikoletseas, S., Rolim, J. (2008). Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds) Ad-hoc, Mobile and Wireless Networks. ADHOC-NOW 2008. Lecture Notes in Computer Science, vol 5198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85209-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-85209-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85208-7
Online ISBN: 978-3-540-85209-4
eBook Packages: Computer ScienceComputer Science (R0)