Abstract
Field surveillance is one of the most important applications for wireless sensor networks. Many sensors are deployed in a region of concern to detect any potential targets. On the contrary, intelligent target looks for the best path to traverse the sensing field for fear of being detected and leads to defunct surveillance. In this paper, we focus on how an intelligent target traverses the sensing field. We model this traversing problem, design, implement and evaluate a number of path-finding algorithms. Different from previous works which assume complete information of the sensing field, we assume that the target only can detect part of the sensor network in its detection radius. This makes the proposed methods more practical. Extensive experiments with a target and a sensor network confirm the validity of the approach.
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
Mainwaring, A.: Wireless sensor networks for habitat monitoring. In: ACM Int’l Workshop on Wireless Sensor Networks and Applications (WSNA), Atlanta, Georgia, USA, pp. 88–97 (2002)
Wood, A.D., Stankovic, J.A.: Denial of Service in Sensor Networks. IEEE Computer 35(10), 54–62 (2002)
Phipatanasuphorn, V., Ramanathan, P.: Vulnerability of Sensor Networks to unauthorized Traversal and Monitoring. IEEE Transactions on Computers 53(3), 364–369 (2004)
Veltri, G., Huang, Q., Qu, G., Potkonjak, M.: Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: Akyildiz, I.F., Estion, D. (eds.) Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys), pp. 40–50. ACM Press, New York (2003)
Li, X.Y.: Coverage in Wireless Ad Hoc Sensor Networks. IEEE Transactions on Computers 52(6), 753–763 (2003)
Megerian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Worst and Best-Case Coverage in Sensor Networks. IEEE Transactions on Mobile Computing 4(1), 84–92 (2005)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc sensor networks. In: IEEE INFOCOM, vol. 3, pp. 1380–1387 (2001)
Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad-hoc sensor networks. In: ACM MobiCom, pp. 139–150 (July 2001)
Savvides, A.: Location Discovery in Ad-hoc Wireless Sensor Networks. Dept.of EE and CS, UCLA (unpublished)
Aurenhammer, F.: Voronoi Diagrams – A Survey of A Fundamental Geometric Data Structure. ACM Computing Surveys 23(3), 345–405 (1991)
Mulmuley, K.: Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs (1994)
Bose, P., Morin, P.: Online routing in triangulations. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 113–122. Springer, Heidelberg (1999)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. ACM/Kluwer Wireless Networks 7(6), 609–616 (2001)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: The 11th Canadian Conference on Computational Geometry, pp. 52–54 (August 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, W., Li, M., Shu, W., Wu, MY. (2006). Smart Path-Finding with Local Information in a Sensory Field. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_11
Download citation
DOI: https://doi.org/10.1007/11943952_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49932-9
Online ISBN: 978-3-540-49933-6
eBook Packages: Computer ScienceComputer Science (R0)