A Randomized Algorithm for Wireless Sensor Network Lifetime Optimization

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10252183" target="_blank" >RIV/61989100:27240/22:10252183 - isvavai.cz</a>

Výsledek na webu

<a href="https://dl.acm.org/doi/10.1145/3551661.3561370" target="_blank" >https://dl.acm.org/doi/10.1145/3551661.3561370</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3551661.3561370" target="_blank" >10.1145/3551661.3561370</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Randomized Algorithm for Wireless Sensor Network Lifetime Optimization

Popis výsledku v původním jazyce

A wireless sensor network consists of a set of sensors S and a monitored set of targets (or an area) T. Typically, there are much more sensors than the targets, but their operation time is limited by the battery capacity. The sensors may be randomly deployed, especially in hard-to-reach areas, such as mountains, forests, battlefields, etc. In this work, we tackle the Maximum α-Lifetime Problem, which aims at maximizing the network lifetime by successively activating and deactivating the subsets of sensors ensuring expected minimum coverage rate α. To solve the problem, we propose and evaluate a randomized heuristic algorithm for the maximization of network lifetime while satisfying the coverage requirement. The conducted experiments show that the algorithm is competitive with the state-of-the-art approach in terms of obtained schedule lengths. (C) 2022 ACM.

Název v anglickém jazyce

A Randomized Algorithm for Wireless Sensor Network Lifetime Optimization

Popis výsledku anglicky

A wireless sensor network consists of a set of sensors S and a monitored set of targets (or an area) T. Typically, there are much more sensors than the targets, but their operation time is limited by the battery capacity. The sensors may be randomly deployed, especially in hard-to-reach areas, such as mountains, forests, battlefields, etc. In this work, we tackle the Maximum α-Lifetime Problem, which aims at maximizing the network lifetime by successively activating and deactivating the subsets of sensors ensuring expected minimum coverage rate α. To solve the problem, we propose and evaluate a randomized heuristic algorithm for the maximization of network lifetime while satisfying the coverage requirement. The conducted experiments show that the algorithm is competitive with the state-of-the-art approach in terms of obtained schedule lengths. (C) 2022 ACM.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Q2SWinet &apos;22: Proceedings of the 18th ACM International Symposium on QoS and Security for Wireless and Mobile Networks

ISBN

978-1-4503-9481-9

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

87-93

Název nakladatele

Association for Computing Machinery

Místo vydání

New York

Místo konání akce

Montréal

Datum konání akce

24. 10. 2022

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—