Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric

Mobile sensors cover more area over a fixed period of time than do the same number of stationary sensors. However, the quality of coverage (QoC) achieved by mobile sensors depends on the velocity, mobility pattern, number of mobile sensors deployed, and the dynamics of the phenomenon being sensed. The gains attained by mobile sensors over static sensors and the optimal motion strategies for mobile sensors are not well understood. In this paper, we consider the following event capture problem: the events of interest arrive at certain points in the sensor field and disappear according to known arrival and departure time distributions. An event is said to be captured if it is sensed by one of the mobile sensors before it fades away. We analyze how the QoC scales with velocity, path, and number of mobile sensors. We characterize cases where the deployment of mobile sensors has no advantage over static sensors, and find the optimal velocity pattern that a mobile sensor should adopt. We also present algorithms for two motion planning problems: 1) for a single sensor, what is the sensor trajectory and the minimum speed required to satisfy a bound on the event loss probability and 2) for sensors with fixed speed, what is the minimum number of sensors required to satisfy a bound on the event loss probability. When the robots are restricted to move along a line or a closed curve, our algorithms return the optimal velocity for the minimum velocity problem. For the minimum sensor problem, the number of sensors used is within a factor of 2 of the optimal solution. For the case where the events occur at arbitrary points on a plane, we present heuristic algorithms for the aforementioned motion planning problems and bound their performance with respect to the optimal.

[1]  Peter I. Corke,et al.  Data collection, storage, and retrieval with an underwater sensor network , 2005, SenSys '05.

[2]  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).

[3]  Ramesh Krishnamurti,et al.  The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles , 2002 .

[4]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[5]  Mauro Leoncini,et al.  Analysis of a wireless sensor dropping problem in wide-area environmental monitoring , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[6]  Gaurav S. Sukhatme,et al.  Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[7]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[8]  H. T. Kung,et al.  Efficient location tracking using sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[9]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[10]  Gaurav S. Sukhatme,et al.  Robomote: enabling mobility in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[11]  A. Arsie,et al.  Efficient routing of multiple vehicles with no communication , 2007, 2007 American Control Conference.

[12]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[14]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[15]  Eiichi Yoshida,et al.  Cooperative sweeping by multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[16]  Joseph S. B. Mitchell,et al.  A PTAS for TSP with neighborhoods among fat regions in the plane , 2007, SODA '07.

[17]  J.A. O'Sullivan,et al.  Co-Grid: an efficient coverage maintenance protocol for distributed sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[18]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[19]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

[20]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.

[21]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[22]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[23]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Gaurav S. Sukhatme,et al.  SENSOR NETWORK-MEDIATED MULTI-ROBOT TASK ALLOCATION , 2005 .

[25]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[26]  Kristofer S. J. Pister,et al.  CotsBots: an off-the-shelf platform for distributed robotics , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[27]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[28]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[29]  Miodrag Potkonjak,et al.  Exposure in Wireless Sensor Networks: Theory and Practical Solutions , 2002, Wirel. Networks.

[30]  Biplab Sikdar,et al.  A protocol for tracking mobile targets using sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[31]  Gaurav S. Sukhatme,et al.  Call and response: experiments in sampling the environment , 2004, SenSys '04.

[32]  Prasant Mohapatra,et al.  Virtual patrol: a new power conservation design for surveillance using sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[33]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

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

[35]  Calton Pu,et al.  Research challenges in environmental observation and forecasting systems , 2000, MobiCom '00.

[36]  G. Swaminathan Robot Motion Planning , 2006 .

[37]  Wolfram Burgard,et al.  Coordinated multi-robot exploration , 2005, IEEE Transactions on Robotics.

[38]  Y. Charlie Hu,et al.  Deployment of mobile robots with energy and timing constraints , 2006, IEEE Transactions on Robotics.

[39]  Bill Goodwine,et al.  MICAbot: a robotic platform for large-scale distributed robotics , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[40]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[41]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[42]  Gaurav S. Sukhatme,et al.  Task allocation for event-aware spatiotemporal sampling of environmental variables , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[43]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[44]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[45]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[46]  Steven M. LaValle,et al.  Planning algorithms , 2006 .