(2018). On the Energy-Efficient Coverage of Network Regions with Convex Opaque Obstacles. In 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) (pp. 135–141). https://doi.org/10.1109/PIMRC.2018.8580878
Περίληψη
In this paper we propose a topology control based approach for addressing the coverage problem in a planar region containing convex opaque obstacles. Such environments represent typical cases of realistic wireless sensor networks and Internet-of-Things deployments. Assuming the devices have the capability to modify their sensing ranges, our goal is to maximize the area covered by randomly dispersed sensors, while reducing their sensing energy consumption as much as possible despite the presence of convex obstacles. To address the former, we introduce a relevant framework capitalizing on the notion of the visibility polygon and propose two algorithms, a centralized (and a randomized version thereof) and a distributed one, which aim to maximize the ratio of covered area to consumed energy, while ensuring a minimum coverage percentage. Through analysis and simulation we demonstrate that the proposed schemes achieve energy efficient coverage, outperforming the plain assignment of maximum sensing range across the network. © 2018 IEEE.
- DOI
- 10.1109/PIMRC.2018.8580878
- ISBN
- 9781538660096
- Τύπος
- Άρθρο σε Πρακτικά Συνεδρίου
- Έτος
- 2018
Σύνδεσμοι
BibTeX
@inproceedings{tsanikidis2018energy,
title = {On the Energy-Efficient Coverage of Network Regions with Convex Opaque Obstacles},
author = {Christos Tsanikidis and Margarita Vitoropoulou and Vasileios Karyotis and Symeon Papavassiliou},
url = {https://doi.org/10.1109/PIMRC.2018.8580878},
doi = {10.1109/PIMRC.2018.8580878},
isbn = {9781538660096},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
booktitle = {2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)},
pages = {135--141},
organization = {IEEE},
abstract = {In this paper we propose a topology control based approach for addressing the coverage problem in a planar region containing convex opaque obstacles. Such environments represent typical cases of realistic wireless sensor networks and Internet-of-Things deployments. Assuming the devices have the capability to modify their sensing ranges, our goal is to maximize the area covered by randomly dispersed sensors, while reducing their sensing energy consumption as much as possible despite the presence of convex obstacles. To address the former, we introduce a relevant framework capitalizing on the notion of the visibility polygon and propose two algorithms, a centralized (and a randomized version thereof) and a distributed one, which aim to maximize the ratio of covered area to consumed energy, while ensuring a minimum coverage percentage. Through analysis and simulation we demonstrate that the proposed schemes achieve energy efficient coverage, outperforming the plain assignment of maximum sensing range across the network. © 2018 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}