Smart Path-Finding with Local Information in a Sensory Field

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.

[1]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[2]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[3]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[4]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[5]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[6]  Xiang-Yang Li,et al.  Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.

[7]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[9]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[10]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[11]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[12]  J.A. Stankovic,et al.  Denial of Service in Sensor Networks , 2002, Computer.

[13]  Parameswaran Ramanathan,et al.  Vulnerability of sensor networks to unauthorized traversal and monitoring , 2004, IEEE Transactions on Computers.

[14]  Miodrag Potkonjak,et al.  Location Discovery in Ad-hoc Wireless Sensor Networks , 2004 .

[15]  Miodrag Potkonjak,et al.  Minimal and maximal exposure path algorithms for wireless embedded sensor networks , 2003, SenSys '03.