Abstract
This paper deals with early obstacles recognition in wireless sensor networks under various traffic patterns. In the presence of obstacles, the efficiency of routing algorithms is increased by voluntarily avoiding some regions in the vicinity of obstacles, areas which we call dead-ends. In this paper, we first propose a fast convergent routing algorithm with proactive dead-end detection together with a formal definition and description of dead-ends. Secondly, we present a generalization of this algorithm which improves performances in all to many and all to all traffic patterns. In a third part we prove that this algorithm produces paths that are optimal up to a constant factor of 2π + 1. In a fourth part we consider the reactive version of the algorithm which is an extension of a previously known early obstacle detection algorithm. Finally we give experimental results to illustrate the efficiency of our algorithms in different scenarios.
Research partially funded by FP6-015964 AEOLUS and FRONTS 215270.
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
Boukerche, A., Chatzigiannakis, I., Nikoletseas, S.E.: A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range. Computer Communications 29(4), 477–489 (2006)
Biaz, S., Ji, Y.: A survey and comparison on localisation algorithms for wireless ad hoc networks. International Journal of Mobile Communications 3(4), 374–410 (2005)
Bose, P., Morin, P., Stojmenovi, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609–616 (2001)
Chatzigiannakis, I., Dimitriou, T., Nikoletseas, S.E., Spirakis, P.G.: A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks. Ad Hoc Networks 4(5), 621–635 (2006)
Chatzigiannakis, I., Nikoletseas, S.E., Spirakis, P.G.: Efficient and robust protocols for local detection and propagation in smart dust networks. MONET 10(1-2), 133–149 (2005)
Chen, D., Varshney, P.K.: A survey of void handling techniques for geographic routing in wireless networks. IEEE Communications Surveys and Tutorials 9(1-4), 50–67 (2007)
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. MONET 11(2), 187–200 (2006)
Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Technical Report RR-87-180, University of Southern California, Marina del Rey, Information Sciences Institut (March 1987)
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. Computer Communications 27(11), 1076–1086 (2004)
Jain, R., Puri, A., Sengupta, R.: Geographical routing using partial information for wireless ad hoc networks (1999)
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, Berkeley, CA, USA, pp. 217–230. USENIX (2005)
Karp, B., Kung, H.T.: Gpsr: greedy perimeter stateless routing for wireless networks. In: MobiCom 2000: Proceedings of the 6th annual international conference on Mobile computing and networking, pp. 243–254. ACM Press, New York (2000)
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., 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)
Kuhn, F., Wattenhofer, R., Zollinger, A.: An algorithmic approach to geographic routing in ad hoc and sensor networks. IEEE/ACM Transactions on Networking 16(1), 51–62 (2008)
Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PODC 2003: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 63–72. ACM Press, New York (2003)
Leong, B., Liskov, B., Morris, R.: Geographic routing without planarization. In: NSDI 2006: Proceedings of the 3rd conference on 3rd Symposium on Networked Systems Design & Implementation, Berkeley, CA, USA, pp. 25–25. USENIX Association (2006)
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, New York (2007)
Moraru, L., Leone, P., Nikoletseas, S., Rolim, J.: Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds.) ADHOC-NOW 2008. LNCS, vol. 5198, pp. 148–161. Springer, Heidelberg (2008)
Mathar, R., Mattfeldt, J.: Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wirel. Netw. 2(4), 329–342 (1996)
Radhakrishnan, S., Rao, N., Racherla, G., Sekharan, C., Batsell, S.: Dst - a routing protocol for ad hoc networks using distributed spanning trees. In: IEEE Wireless Communications and Networking Conference, pp. 100–104 (1999)
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. pp. 393–406 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huc, F., Jarry, A., Leone, P., Moraru, L., Nikoletseas, S., Rolim, J. (2009). Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks. In: Dolev, S. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2009. Lecture Notes in Computer Science, vol 5804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05434-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-05434-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05433-4
Online ISBN: 978-3-642-05434-1
eBook Packages: Computer ScienceComputer Science (R0)