An \frac-Approximation Algorithm for Maximizing Coverage Capability in Mobile Air Quality Monitoring Systems

In this paper, we focus on broadening the monitoring area of a mobile air quality monitoring system, in which the sensors mounted on buses. In particular, we investigate the optimal buses to place the sensors and the optimal monitoring timings to maximize the number of monitored critical regions. We...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings (IEEE International Symposium on Network Computing and Applications. Online) s. 1 - 4
Hlavní autori: Nguyen, Viet Dung, Le Nguyen, Phi, Nguyen, Trung Hieu, Nguyen, Kien, Do, Phan Thuan
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 24.11.2020
Predmet:
Air quality
Approximation algorithms
Greedy algorithms
Mobile air quality monitoring
Monitoring
polynomial-time approximation algorithm
Sensor systems
Sensors
target coverage maximization
Wireless sensor networks
ISSN:2643-7929
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we focus on broadening the monitoring area of a mobile air quality monitoring system, in which the sensors mounted on buses. In particular, we investigate the optimal buses to place the sensors and the optimal monitoring timings to maximize the number of monitored critical regions. We mathematically formulate the targeted problem. Then, we leverage the greedy approach to propose a polynomial-time \frac{e-1}{2e-1} approximation algorithm. We use the data of real bus routes in Hanoi, Vietnam, for the experimentation and show that the proposed algorithm guarantees an average performance ratio of 63.87%.
ISSN:2643-7929
DOI:10.1109/NCA51143.2020.9306692