Mostrar el registro sencillo del ítem
Stable routing scheduling algorithms in multi-hop wireless networks
dc.contributor.author | Cholvi, Vicent | |
dc.contributor.author | Garncarek, Pawel | |
dc.contributor.author | Jurdzinski, Tomasz | |
dc.contributor.author | Kowalski, Dariusz R. | |
dc.date.accessioned | 2022-05-19T09:53:23Z | |
dc.date.available | 2022-05-19T09:53:23Z | |
dc.date.issued | 2022-03 | |
dc.identifier.citation | Vicent Cholvi, P. Garncarek, T. Jurdziński, Dariusz R. Kowalski, Stable routing scheduling algorithms in multi-hop wireless networks, Theoretical Computer Science, Volume 921, 2022, Pages 20-35, ISSN 0304-3975, https://doi.org/10.1016/j.tcs.2022.03.038. (https://www.sciencedirect.com/science/article/pii/S0304397522001852) | ca_CA |
dc.identifier.issn | 0304-3975 | |
dc.identifier.uri | http://hdl.handle.net/10234/197718 | |
dc.description.abstract | Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stableif the number of packets waiting to be delivered (backlog) is finitely bounded at any one time. In this paper we introduce a number of routing scheduling algorithms which, making use of certain knowledge about the network’s structure, guarantee stability for certain injection rates. First, we introduce two new families of combinatorial structures, which we call universally strong selectorsand generalized universally strong selectors, that are used to provide a set of transmission schedules. Making use of these structures, we propose two local-knowledgepacket-oblivious routing scheduling algorithms. The first proposed routing scheduling algorithm onlyneeds to know some upper bounds on the number of links and on the network’s degree, and is asymptotically optimal regarding the injection rate for which stability is guaranteed. The second proposed routing scheduling algorithm isclose to be asymptotically optimal, but it only needs to know an upper bound on the number of links. For such algorithms, we also provide some results regarding both the maximum latencies and queue lengths. Furthermore, we also evaluate how the lack of global knowledge about the system topology affects the performance of the routing scheduling algorithms. | ca_CA |
dc.description.sponsorShip | Funding for open access charge: CRUE-Universitat Jaume I | |
dc.format.extent | 16 p. | ca_CA |
dc.format.mimetype | application/pdf | ca_CA |
dc.language.iso | eng | ca_CA |
dc.publisher | Elsevier | ca_CA |
dc.relation.isPartOf | Theoretical Computer Science, vol. 921 (2022) | ca_CA |
dc.rights.uri | http://creativecommons.org/licenses/by-sa/4.0/ | ca_CA |
dc.subject | Wireless networks | ca_CA |
dc.subject | Routing scheduling algorithms | ca_CA |
dc.subject | Adversarial queuing | ca_CA |
dc.subject | Interference | ca_CA |
dc.subject | Stability | ca_CA |
dc.subject | Packet latency | ca_CA |
dc.title | Stable routing scheduling algorithms in multi-hop wireless networks | ca_CA |
dc.type | info:eu-repo/semantics/article | ca_CA |
dc.identifier.doi | http://dx.doi.org/10.1016/j.tcs.2022.03.038 | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_CA |
dc.relation.publisherVersion | https://www.sciencedirect.com/science/article/pii/S0304397522001852 | ca_CA |
dc.type.version | info:eu-repo/semantics/publishedVersion | ca_CA |
project.funder.name | Ministerio de Ciencia, Innovación y Universidades | ca_CA |
project.funder.name | FEDER | ca_CA |
project.funder.name | Polish National Science Center (NCN) | ca_CA |
oaire.awardNumber | PRX18/000163 | ca_CA |
oaire.awardNumber | PID2019-109805RB-I00 | ca_CA |
oaire.awardNumber | UMO-2017/25/B/ST6/02010 | ca_CA |
oaire.awardNumber | UMO-2017/25/B/ST6/02553 | ca_CA |
Ficheros en el ítem
Este ítem aparece en la(s) siguiente(s) colección(ones)
-
LSI_Articles [362]
Articles de publicacions periòdiques escrits per professors del Departament de Llenguatges i Sistemes Informàtics