Standard

Conflict-free data aggregation on a square grid when transmission distance is not less than 3. / Erzin, Adil; Plotnikov, Roman.

Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. Том 10718 LNCS Springer-Verlag GmbH and Co. KG, 2017. стр. 141-154 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10718 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Erzin, A & Plotnikov, R 2017, Conflict-free data aggregation on a square grid when transmission distance is not less than 3. в Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. Том. 10718 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 10718 LNCS, Springer-Verlag GmbH and Co. KG, стр. 141-154, 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Австрия, 04.09.2017. https://doi.org/10.1007/978-3-319-72751-6_11

APA

Erzin, A., & Plotnikov, R. (2017). Conflict-free data aggregation on a square grid when transmission distance is not less than 3. в Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers (Том 10718 LNCS, стр. 141-154). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10718 LNCS). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-319-72751-6_11

Vancouver

Erzin A, Plotnikov R. Conflict-free data aggregation on a square grid when transmission distance is not less than 3. в Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. Том 10718 LNCS. Springer-Verlag GmbH and Co. KG. 2017. стр. 141-154. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-72751-6_11

Author

Erzin, Adil ; Plotnikov, Roman. / Conflict-free data aggregation on a square grid when transmission distance is not less than 3. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. Том 10718 LNCS Springer-Verlag GmbH and Co. KG, 2017. стр. 141-154 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{bfc5f86a0d33454f837e90cbd44b95df,
title = "Conflict-free data aggregation on a square grid when transmission distance is not less than 3",
abstract = "In this paper a Convergecast Scheduling Problem on a unit square grid, in each node of which there is a sensor with transmission distance d which is not less than 3, is considered. For the cases d= 1 and d= 2, polynomial algorithms, which construct the optimal solution to the problem, are known. For an arbitrary d, an approximate algorithm is proposed, the application of which gives an upper bound on the length of the conflict-free data aggregation schedule, depending on d. We conducted a priori and a posteriori analysis of the accuracy of this algorithm for various d comparing either with the optimal length of the schedule, or with a lower bound, the value of which we improved.",
keywords = "Convergecast scheduling problem, Data aggregation, Grid graph, Min-length conflict-free scheduling, Wireless sensor networks",
author = "Adil Erzin and Roman Plotnikov",
year = "2017",
doi = "10.1007/978-3-319-72751-6_11",
language = "English",
isbn = "9783319727509",
volume = "10718 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "141--154",
booktitle = "Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers",
address = "Germany",
note = "13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017 ; Conference date: 04-09-2017 Through 08-09-2017",

}

RIS

TY - GEN

T1 - Conflict-free data aggregation on a square grid when transmission distance is not less than 3

AU - Erzin, Adil

AU - Plotnikov, Roman

PY - 2017

Y1 - 2017

N2 - In this paper a Convergecast Scheduling Problem on a unit square grid, in each node of which there is a sensor with transmission distance d which is not less than 3, is considered. For the cases d= 1 and d= 2, polynomial algorithms, which construct the optimal solution to the problem, are known. For an arbitrary d, an approximate algorithm is proposed, the application of which gives an upper bound on the length of the conflict-free data aggregation schedule, depending on d. We conducted a priori and a posteriori analysis of the accuracy of this algorithm for various d comparing either with the optimal length of the schedule, or with a lower bound, the value of which we improved.

AB - In this paper a Convergecast Scheduling Problem on a unit square grid, in each node of which there is a sensor with transmission distance d which is not less than 3, is considered. For the cases d= 1 and d= 2, polynomial algorithms, which construct the optimal solution to the problem, are known. For an arbitrary d, an approximate algorithm is proposed, the application of which gives an upper bound on the length of the conflict-free data aggregation schedule, depending on d. We conducted a priori and a posteriori analysis of the accuracy of this algorithm for various d comparing either with the optimal length of the schedule, or with a lower bound, the value of which we improved.

KW - Convergecast scheduling problem

KW - Data aggregation

KW - Grid graph

KW - Min-length conflict-free scheduling

KW - Wireless sensor networks

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

U2 - 10.1007/978-3-319-72751-6_11

DO - 10.1007/978-3-319-72751-6_11

M3 - Conference contribution

AN - SCOPUS:85040109583

SN - 9783319727509

VL - 10718 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 141

EP - 154

BT - Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers

PB - Springer-Verlag GmbH and Co. KG

T2 - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017

Y2 - 4 September 2017 through 8 September 2017

ER -

ID: 9642550