Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Bushiness and a tight worst-case upper bound on the search number of a simple polygon
Information Processing Letters
Visibility-based pursuit-evasion in a polygonal room with a door
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Robomote: enabling mobility in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Stochastic event capture using mobile sensors subject to a quality metric
Proceedings of the 12th annual international conference on Mobile computing and networking
SIAM Journal on Control and Optimization
Stochastic Event Capture Using Single Robot Moving along a Certain Track
MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
Mobile multimedia in wireless sensor networks
International Journal of Sensor Networks
Streaming multimedia over WMSNs: an online multipath routing protocol
International Journal of Sensor Networks
Low memory image stitching and compression for WMSN using strip-based processing
International Journal of Sensor Networks
International Journal of Sensor Networks
Low-power sensor node with addressable wake-up on-demand capability
International Journal of Sensor Networks
International Journal of Sensor Networks
On the use of passive clustering in wireless video sensor networks
International Journal of Sensor Networks
Optimal transmit power and packet size in wireless sensor networks in lognormal shadowed environment
International Journal of Sensor Networks
International Journal of Sensor Networks
International Journal of Sensor Networks
Data caching-based query processing in multi-sink wireless sensor networks
International Journal of Sensor Networks
The effect of leaders on the consistency of group behaviour
International Journal of Sensor Networks
A high computational power wireless sensor network for distributed structural health monitoring
International Journal of Sensor Networks
Coverage and activity management of wireless video sensor networks for surveillance applications
International Journal of Sensor Networks
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Gauging human mobility characteristics and its impact on mobile routing performance
International Journal of Sensor Networks
Cooperative relay assignment for static energy-constrained networks
International Journal of Sensor Networks
Hi-index | 0.09 |
Moving sensors can cover more area over a period of time than the same number of stationary sensors. However, the gains attained by a moving sensor (a single robot or radar) are not well understood. In this paper, we present a stochastic model analyzing the detection quality achieved by a single sensor moving along a certain track based on its velocity and mobility pattern. We also include a detection scenario using double robots together and study their detection quality. We consider the following type of intrusion events: intruders occur/arrive at random points at the edge of the field of interest and move directly to the center of the field of interest at a constant speed. In order to compare results, two detection scenarios are studied: the robot detection scenario and the radar detection scenario. In the robot detection scenario, the robot(s) is set to move periodically along a certain route at a constant speed. In the radar detection scenario, radar is rotated at a constant speed in a clockwise/counter-clockwise direction. An intrusion is said to be captured if it is sensed by the moving robot or radar before it arrives at the center of the field of interest. For both scenarios, we derive a general expression for intrusion loss probability and the expected time that it will take the robot(s) or radar to capture an intruder.