Standard

Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks. / Plotnikov, Roman; Erzin, Adil; Zalyubovskiy, Vyacheslav.

Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. ed. / Yury Kochetov; Michael Khachay; Yury Evtushenko; Vlasta Malkova; Mikhail Posypkin; Milojica Jacimovic. Springer-Verlag GmbH and Co. KG, 2019. p. 216-231 (Communications in Computer and Information Science; Vol. 974).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Plotnikov, R, Erzin, A & Zalyubovskiy, V 2019, Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks. in Y Kochetov, M Khachay, Y Evtushenko, V Malkova, M Posypkin & M Jacimovic (eds), Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Communications in Computer and Information Science, vol. 974, Springer-Verlag GmbH and Co. KG, pp. 216-231, 9th International Conference on Optimization and Applications, OPTIMA 2018, Petrovac, Montenegro, 01.10.2018. https://doi.org/10.1007/978-3-030-10934-9_16

APA

Plotnikov, R., Erzin, A., & Zalyubovskiy, V. (2019). Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks. In Y. Kochetov, M. Khachay, Y. Evtushenko, V. Malkova, M. Posypkin, & M. Jacimovic (Eds.), Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers (pp. 216-231). (Communications in Computer and Information Science; Vol. 974). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-030-10934-9_16

Vancouver

Plotnikov R, Erzin A, Zalyubovskiy V. Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks. In Kochetov Y, Khachay M, Evtushenko Y, Malkova V, Posypkin M, Jacimovic M, editors, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Springer-Verlag GmbH and Co. KG. 2019. p. 216-231. (Communications in Computer and Information Science). doi: 10.1007/978-3-030-10934-9_16

Author

Plotnikov, Roman ; Erzin, Adil ; Zalyubovskiy, Vyacheslav. / Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks. Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. editor / Yury Kochetov ; Michael Khachay ; Yury Evtushenko ; Vlasta Malkova ; Mikhail Posypkin ; Milojica Jacimovic. Springer-Verlag GmbH and Co. KG, 2019. pp. 216-231 (Communications in Computer and Information Science).

BibTeX

@inproceedings{bcfac7314a8f4d7a9afeb66b7705a0ca,
title = "Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks",
abstract = "We consider a Minimum-Latency Aggregation Scheduling problem in wireless sensor networks when aggregated data from all sensors are required to be transferred to the sink. During one time slot (time is discrete) each sensor can either send or receive one message or be idle. Moreover, only one message should be sent by each sensor during the aggregation session, and the conflicts caused by interference of radio waves must be excluded. It is required to find a min-length conflict-free schedule for transmitting messages along the arcs of the desired spanning aggregation tree (AT) with the root in the sink. This problem is NP-hard in a general case, and also remains NP-hard in a case when AT is given. In this paper, we present a new heuristic algorithm that uses a genetic algorithm and contains the local search procedures and the randomized mutation procedure. The extensive simulation demonstrates a superiority of our algorithm over the best of the previous approaches.",
keywords = "Aggregation, Genetic local search, Minimum latency, Simulation, Wireless sensor networks",
author = "Roman Plotnikov and Adil Erzin and Vyacheslav Zalyubovskiy",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-10934-9_16",
language = "English",
isbn = "9783030109332",
series = "Communications in Computer and Information Science",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "216--231",
editor = "Yury Kochetov and Michael Khachay and Yury Evtushenko and Vlasta Malkova and Mikhail Posypkin and Milojica Jacimovic",
booktitle = "Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers",
address = "Germany",
note = "9th International Conference on Optimization and Applications, OPTIMA 2018 ; Conference date: 01-10-2018 Through 05-10-2018",

}

RIS

TY - GEN

T1 - Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks

AU - Plotnikov, Roman

AU - Erzin, Adil

AU - Zalyubovskiy, Vyacheslav

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We consider a Minimum-Latency Aggregation Scheduling problem in wireless sensor networks when aggregated data from all sensors are required to be transferred to the sink. During one time slot (time is discrete) each sensor can either send or receive one message or be idle. Moreover, only one message should be sent by each sensor during the aggregation session, and the conflicts caused by interference of radio waves must be excluded. It is required to find a min-length conflict-free schedule for transmitting messages along the arcs of the desired spanning aggregation tree (AT) with the root in the sink. This problem is NP-hard in a general case, and also remains NP-hard in a case when AT is given. In this paper, we present a new heuristic algorithm that uses a genetic algorithm and contains the local search procedures and the randomized mutation procedure. The extensive simulation demonstrates a superiority of our algorithm over the best of the previous approaches.

AB - We consider a Minimum-Latency Aggregation Scheduling problem in wireless sensor networks when aggregated data from all sensors are required to be transferred to the sink. During one time slot (time is discrete) each sensor can either send or receive one message or be idle. Moreover, only one message should be sent by each sensor during the aggregation session, and the conflicts caused by interference of radio waves must be excluded. It is required to find a min-length conflict-free schedule for transmitting messages along the arcs of the desired spanning aggregation tree (AT) with the root in the sink. This problem is NP-hard in a general case, and also remains NP-hard in a case when AT is given. In this paper, we present a new heuristic algorithm that uses a genetic algorithm and contains the local search procedures and the randomized mutation procedure. The extensive simulation demonstrates a superiority of our algorithm over the best of the previous approaches.

KW - Aggregation

KW - Genetic local search

KW - Minimum latency

KW - Simulation

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=85061208608&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-10934-9_16

DO - 10.1007/978-3-030-10934-9_16

M3 - Conference contribution

AN - SCOPUS:85061208608

SN - 9783030109332

T3 - Communications in Computer and Information Science

SP - 216

EP - 231

BT - Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers

A2 - Kochetov, Yury

A2 - Khachay, Michael

A2 - Evtushenko, Yury

A2 - Malkova, Vlasta

A2 - Posypkin, Mikhail

A2 - Jacimovic, Milojica

PB - Springer-Verlag GmbH and Co. KG

T2 - 9th International Conference on Optimization and Applications, OPTIMA 2018

Y2 - 1 October 2018 through 5 October 2018

ER -

ID: 18506991