Distributed obstacle localization in large wireless sensor networks

ABSTRACT

Obstacles are but pleasing for many aspects of large real-world sensor networks. Among other things, the presence of obstacles distort the sensor node localization process and might lead to costly routing because of unnecessary detours and/or dead ends. In order to relieve these problems, this paper proposes a distributed obstacle localization algorithm, called DOLfor short, in which the sensor nodes interact with each other mostly locally. The proposed algorithm is very resource and communication efficient in that all sensor nodes send only a small number of additional messages. Finally, the sensor network fine tunes the employed routing algorithm.

REFERENCES

• 1: I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A Survey on Sensor Networks, IEEE Communications Magazine, August 2002, pp. 102--114.
• 2: Josh Broch , David A. Maltz , David B. Johnson , Yih-Chun Hu , Jorjeta Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.85-97, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288256]
• 3: N. Bulusu, J. Heidemann, and D. Estrin, GPS-less Low Cost Outdoor Localization for Very Small Devices, in Proceedings of the IEEE Personal Communications Magazine, vol. 7(5), October 2000, pp. 28--34.
• 4: Andreas Savvides , Chih-Chieh Han , Mani B. Strivastava, Dynamic fine-grained localization in Ad-Hoc networks of sensors, Proceedings of the 7th annual international conference on Mobile computing and networking, p.166-179, July 2001, Rome, Italy [doi>10.1145/381677.381693]
• 5: J. Blumenthal, F. Reichenbach, and D. Timmermann, Position Estimation in ad-hoc Wireless Sensor Networks with Low Complexity, Joint 2nd Workshop on Positioning, Navigation, and Communication, (WPNC 05) and 1st Ultra-Wideband Expert Talk 2005, 2005, pp. 41--49.
• 6: L. Doherty, L. Ghaoui, and K. Pister, Convex position estimation in wireless sensor networks, in Proceedings of the IEEE Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'01), 2001, pp. 1655--1663.
• 7: Chris Savarese , Jan M. Rabaey , Koen Langendoen, Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks, Proceedings of the General Track: 2002 USENIX Annual Technical Conference, p.317-327, June 10-15, 2002
• 8: Charles E. Perkins , Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p.90, February 25-26, 1999
• 9: D. B. Johnson and D. A. Maltz, Dynamic Source Routing in ad-hoc Wireless Networks, Mobile Computing, Kluwer Academic Publishers, 1996, pp. 153--181.
• 10: K. Yamazaki and K. Sezaki, An ad-hoc Routing Protocol with Obstacle Evasion, in Proceedings of the First International Workshop on Networked Sensing Systems Program (INSS04), 2004.
• 11: Jeffrey Wheat , Randy Hiser , Jackie Tucker , Alicia Neely , Andy McCullough, Designing a Wireless Network, Syngress Publishing, 2001

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems
          Subjects: Distributed applications

General Terms:
Algorithms, Design, Theory

Keywords:
local interaction rules, multi-hopping, obstacle localization, routing, wireless sensor networks