Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
A generic solution to polygon clipping
Communications of the ACM
Efficient clipping of arbitrary polygons
ACM Transactions on Graphics (TOG)
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Tracking a moving object with a binary sensor network
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient surveillance system using wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Sensor network-based countersniper system
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Proceedings of the 4th international conference on Embedded networked sensor systems
Planning Algorithms
Tracking multiple targets using binary proximity sensors
Proceedings of the 6th international conference on Information processing in sensor networks
Mobile object tracking in wireless sensor networks
Computer Communications
Distributed Mobility Management for Target Tracking in Mobile Sensor Networks
IEEE Transactions on Mobile Computing
Exact and efficient construction of planar Minkowski sums using the convolution method
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Predictive QoS routing to mobile sinks in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Hi-index | 0.00 |
Target tracking problems have been studied for both robots and sensor networks. However, existing robotic target tracking algorithms require the tracker to have access to information-rich sensors, and may have difficulty recovering when the target is out of the tracker's sensing range. In this paper, we present a target tracking algorithm that combines an extremely simple mobile robot with a networked collection of wireless sensor nodes, each of which is equipped with an unreliable, limited-range, boolean sensor for detecting the target. The tracker maintains close proximity to the target using only information sensed by the network, and can effectively recover from temporarily losing track of the target. We present two algorithms that manage message delivery on this network. The first, which is appropriate for memoryless sensor nodes, is based on dynamic adjustments to the time-to-live (TTL) of transmitted messages. The second, for more capable sensor nodes, makes message delivery decisions on-the-fly based on geometric considerations driven by the messages' content. We present an implementation along with simulation results. The results show that our system achieves both good tracking precision and low energy consumption.