Standard

Convergecast with Unbounded Number of Channels. / Plotnikov, Roman; Erzin, Adil; Zalyubovskiy, Vyacheslav.

In: MATEC Web of Conferences, Vol. 125, 03001, 04.10.2017.

Research output: Contribution to journalArticlepeer-review

Harvard

Plotnikov, R, Erzin, A & Zalyubovskiy, V 2017, 'Convergecast with Unbounded Number of Channels', MATEC Web of Conferences, vol. 125, 03001. https://doi.org/10.1051/matecconf/201712503001

APA

Plotnikov, R., Erzin, A., & Zalyubovskiy, V. (2017). Convergecast with Unbounded Number of Channels. MATEC Web of Conferences, 125, [03001]. https://doi.org/10.1051/matecconf/201712503001

Vancouver

Plotnikov R, Erzin A, Zalyubovskiy V. Convergecast with Unbounded Number of Channels. MATEC Web of Conferences. 2017 Oct 4;125:03001. doi: 10.1051/matecconf/201712503001

Author

Plotnikov, Roman ; Erzin, Adil ; Zalyubovskiy, Vyacheslav. / Convergecast with Unbounded Number of Channels. In: MATEC Web of Conferences. 2017 ; Vol. 125.

BibTeX

@article{d390f0cf432f4c82a148c290d37caca0,
title = "Convergecast with Unbounded Number of Channels",
abstract = "We consider a problem of minimum length scheduling for the conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting since only the conflicts between the children of the same parent are taken into account. We propose a new integer programming formulation and compare it with the known one by running the CPLEX software package. Based on the results of a numerical experiment, we concluded that our formulation is more preferable in practice to solve the considered problem by CPLEX than the known one. We also propose a novel heuristic algorithm, which is based on a genetic algorithm and a local search metaheuristic. The simulation results demonstrate the high quality of the proposed algorithm compared to the best known approaches.",
author = "Roman Plotnikov and Adil Erzin and Vyacheslav Zalyubovskiy",
year = "2017",
month = oct,
day = "4",
doi = "10.1051/matecconf/201712503001",
language = "English",
volume = "125",
journal = "MATEC Web of Conferences",
issn = "2261-236X",
publisher = "EDP Sciences",

}

RIS

TY - JOUR

T1 - Convergecast with Unbounded Number of Channels

AU - Plotnikov, Roman

AU - Erzin, Adil

AU - Zalyubovskiy, Vyacheslav

PY - 2017/10/4

Y1 - 2017/10/4

N2 - We consider a problem of minimum length scheduling for the conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting since only the conflicts between the children of the same parent are taken into account. We propose a new integer programming formulation and compare it with the known one by running the CPLEX software package. Based on the results of a numerical experiment, we concluded that our formulation is more preferable in practice to solve the considered problem by CPLEX than the known one. We also propose a novel heuristic algorithm, which is based on a genetic algorithm and a local search metaheuristic. The simulation results demonstrate the high quality of the proposed algorithm compared to the best known approaches.

AB - We consider a problem of minimum length scheduling for the conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting since only the conflicts between the children of the same parent are taken into account. We propose a new integer programming formulation and compare it with the known one by running the CPLEX software package. Based on the results of a numerical experiment, we concluded that our formulation is more preferable in practice to solve the considered problem by CPLEX than the known one. We also propose a novel heuristic algorithm, which is based on a genetic algorithm and a local search metaheuristic. The simulation results demonstrate the high quality of the proposed algorithm compared to the best known approaches.

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

U2 - 10.1051/matecconf/201712503001

DO - 10.1051/matecconf/201712503001

M3 - Article

AN - SCOPUS:85032871770

VL - 125

JO - MATEC Web of Conferences

JF - MATEC Web of Conferences

SN - 2261-236X

M1 - 03001

ER -

ID: 9721723