A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Approaches to Multisensor Data Fusion in Target Tracking: A Survey
IEEE Transactions on Knowledge and Data Engineering
Bidding Protocols for Deploying Mobile Sensors
IEEE Transactions on Mobile Computing
Deploying Wireless Sensor Networks under Limited Mobility Constraints
IEEE Transactions on Mobile Computing
Coverage in Hybrid Mobile Sensor Networks
IEEE Transactions on Mobile Computing
Task dissemination with multicast deluge in sensor networks
IEEE Transactions on Wireless Communications
Submarine Location Estimation Via a Network of Detection-Only Sensors
IEEE Transactions on Signal Processing
DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks
IEEE Transactions on Wireless Communications
Coverage for target localization in wireless sensor networks
IEEE Transactions on Wireless Communications
A Probabilistic Approach to Tracking Moving Targets With Distributed Sensors
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
Most existing work on the coverage problem of wireless sensor networks focuses on improving the coverage of the whole sensing field. In target tracking, the interested coverage area is the emerging region of a motorized target, not the whole sensing field. As the motorized target moves, the emerging region is also dynamically changed. In this paper, we propose a grid-based and distributed approach for providing large coverage for a motorized target in a hybrid sensor network. The large coverage is achieved by moving mobile sensor nodes in the network. To minimize total movement cost, the proposed approach needs to solve the following problems: the minimum number of mobile sensor nodes used for healing coverage holes and the best matching between mobile sensor nodes and coverage holes. In the proposed approach, the above two problems are first transformed into the modified circle covering and minimum cost flow problems, respectively. Then, two polynomial-time algorithms are presented to efficiently solve these two modified graph problems, respectively. Finally, we perform simulation experiments to show the effectiveness of proposed approach in providing the coverage for a motorized target in a hybrid sensor network.