The delay-constrained information coverage problem in mobile sensor networks: single hop case

Authors:
Gabriel Y. Keung;Qian Zhang;Bo Li
Affiliations:
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, NT, Hong Kong;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, NT, Hong Kong;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, NT, Hong Kong
Venue:
Wireless Networks
Year:
2010

Citing 7
Cited 1

Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks

Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Polynomial time approximation schemes for geometric k-clustering

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
Mobility improves coverage of sensor networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
CarTel: a distributed mobile sensor computing system

Proceedings of the 4th international conference on Embedded networked sensor systems

Service-oriented middleware for large-scale mobile participatory sensing

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the delay-constrained information coverage problem in mobile sensor networks. Motivated by real application needs, our formulation takes advantage of the sensor mobility for sensing information collection, which takes place when a sensor moves into the proximity (single hop) of stationary sink nodes. To the best of our knowledge, we present the first formulation for the delay-constrained information coverage problem, which targets at optimal sink nodes placement with the objective of maximizing sensing information collection within a constrained time. We prove that this problem is NP-hard even under finite search space approximation and we develop theoretical analysis to derive its upper and lower performance bounds. We then develop approximation techniques and use simulations to verify their effectiveness.