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
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Predictive mobility support for QoS provisioning in mobile wireless environments
IEEE Journal on Selected Areas in Communications
Alternating multiple tributaries + deltas
Proceedings of the 5th workshop on Data management for sensor networks
Adaptive Storage Policy Switching for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Most existing work on sensor networks concentrates on finding efficient ways to forward data from the information source to the data center, and not much work has been done on collecting local data and generating the data report. This paper studies this issue by proposing techniques to track a mobile target and monitor its surrounding region. We introduce a framework called dynamic convoy tree-based collaboration (DCTC), and formalize it as a multiple objective optimization problem which needs to find a convoy tree sequence with high tree coverage and low message complexity. We propose an optimal solution which achieves 100% coverage and minimizes the message complexity under certain ideal situations. Considering the real constraints of sensor networks, we propose two practical solutions: the conservative scheme and the prediction-based scheme. Extensive simulations are conducted to compare these schemes, and the results show that the prediction-based scheme outperforms the conservative scheme, and it can achieve a relatively high coverage and low message complexity close to the optimal scheme.