Opening book details…
Can I read Maximum Target Coverage Problem in Mobile Wireless Sensor Networks on EtoBox?
Maximum Target Coverage Problem in Mobile Wireless Sensor Networks by Dieyan Liang; Hong Shen; Lin Chen is a Engineering article available to read on EtoBox.
What is Maximum Target Coverage Problem in Mobile Wireless Sensor Networks about?
We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility. Given a set of targets to be covered and a set of mobile sensors, we seek a sensor dispatch algorithm maximizing the covered targets under the constraint that the maximal moving distance for each sensor is upper-bounded by a given threshold. We prove that the problem is NP-hard. Given its hardness, we devise four algorithms to solve it heuristically or approximately. Among the approximate algorithms, we first develop randomized (1−1/e)-optimal algorithm. We then employ a derandomization technique to devise a deterministic (1−1/e)-approximation algorithm. We also design a deterministic approximation algorithm with nearly ▵−1 approximation ratio by using a colouring technique, where ▵ denotes the maximal number of subsets covering the same target. Experiments are also conducted to validate the effectiveness of the algorithms in a variety of parameter settings.
Who reads Maximum Target Coverage Problem in Mobile Wireless Sensor Networks?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- Dieyan Liang; Hong Shen; Lin Chen
- Publisher
- MDPI AG
- Published
- 2020
- Language
- EN
- Field
- Engineering (Physical Sciences)