@inproceedings{c765967cb31e4400b0525ca06706887b,
title = "Solution of the convergecast scheduling problem on a square unit grid when the transmission range is 2",
abstract = "In this paper a conflict-free data aggregation problem, known as a Convergecast Scheduling Problem, is considered. It is NP-hard in the arbitrary wireless network. The paper deals with a special case of the problem when the communication graph is a square grid with unit cells and when the transmission range is 2 (in L1 metric). Earlier for the case under consideration we proposed a polynomial time algorithm with a guaranteed accuracy bound. In this paper we have shown that the proposed algorithm constructs an optimal solution to the problem.",
keywords = "Conflict-free scheduling, Data aggregation, Wireless networks, DATA-COLLECTION, WIRELESS SENSOR NETWORKS",
author = "Adil Erzin",
year = "2017",
doi = "10.1007/978-3-319-69404-7_4",
language = "English",
isbn = "9783319694030",
volume = "10556 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 = "50--63",
editor = "R Battiti and DE Kvasov and YD Sergeyev",
booktitle = "Learning and Intelligent Optimization - 11th International Conference, LION 11, Revised Selected Papers",
address = "Germany",
note = "11th International Conference on Learning and Intelligent Optimization, LION 2017 ; Conference date: 19-06-2017 Through 21-06-2017",
}