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. J. Broch, D. A. Maltz, D. B. Johnson, Y. -C. Hu, and J. Jetcheva, A Performance Comparison of Multi-Hop Wireless ad-hoc Network Routing Protocols, in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, 1998, pp. 85--97.
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. A. Savvides, C. C. Han, and M. B. Strivastava, Dynamic Fine Grained Localization in ad-hoc Networks of Sensors, in Proceedings of the 5th International Conference on Mobile Computing and Networking, MOBICOM 2001, Rome, Italy, 2001, pp. 166--179.
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. C. Savarese and J. Rabaey, Robust positioning algorithms for distributed ad-hoc wireless sensor networks, Proceedings of the USENIX Annual Technical Conference, 2002, pp. 317--327.
8. C. E. Perkins and E. M. Royer, Ad-hoc On-Demand Distance-Vector Routing, in Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, 1999, pp. 90--100.
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. J. Wheat, R. Hiser, J. Tucker, A. Neely, and A. Mccullough, Designing a Wireless Network, Syngress Publishing, 2001.

Index Terms

• Software and its engineering

  • Software organization and properties

    • Software system structures

      • Distributed systems organizing principles

        • Organizing principles for web applications