Stable routing scheduling algorithms in multi-hop wireless networks
![Thumbnail](/xmlui/bitstream/handle/10234/197718/Cholvi_Stable.pdf.jpg?sequence=4&isAllowed=y)
View/ Open
Impact
![Google Scholar](/xmlui/themes/Mirage2/images/uji/logo_google.png)
![Microsoft Academico](/xmlui/themes/Mirage2/images/uji/logo_microsoft.png)
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONMetadata
Title
Stable routing scheduling algorithms in multi-hop wireless networksDate
2022-03Publisher
ElsevierISSN
0304-3975Bibliographic 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)Type
info:eu-repo/semantics/articlePublisher version
https://www.sciencedirect.com/science/article/pii/S0304397522001852Version
info:eu-repo/semantics/publishedVersionSubject
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 ... [+]
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. [-]
Is part of
Theoretical Computer Science, vol. 921 (2022)Funder Name
Ministerio de Ciencia, Innovación y Universidades | FEDER | Polish National Science Center (NCN)
Project code
PRX18/000163 | PID2019-109805RB-I00 | UMO-2017/25/B/ST6/02010 | UMO-2017/25/B/ST6/02553
Rights
info:eu-repo/semantics/openAccess
This item appears in the folowing collection(s)
- LSI_Articles [362]