TY - JOUR
T1 - Stable routing scheduling algorithms in multi-hop wireless networks
AU - Cholvi, Vicent
AU - Garncarek, P.
AU - Jurdziński, T.
AU - Kowalski, Dariusz R.
N1 - Funding Information:
This author was partially supported by the Ministerio de Ciencia, Innovación y Universidades grant PRX18/000163 and by the Spanish Ministry of Science and Innovation grant PID2019-109805RB-I00 (ECID) cofunded by FEDER.This author was partially supported by the Polish National Science Center (NCN) grant UMO-2017/25/B/ST6/02010.This author was partially supported by the Polish National Science Center (NCN) grant UMO-2017/25/B/ST6/02553.
Publisher Copyright:
© 2022 The Author(s)
PY - 2022/6/19
Y1 - 2022/6/19
N2 - 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 stable if 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 selectors and generalized universally strong selectors, that are used to provide a set of transmission schedules. Making use of these structures, we propose two local-knowledge packet-oblivious routing scheduling algorithms. The first proposed routing scheduling algorithm only needs 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 is close 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.
AB - 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 stable if 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 selectors and generalized universally strong selectors, that are used to provide a set of transmission schedules. Making use of these structures, we propose two local-knowledge packet-oblivious routing scheduling algorithms. The first proposed routing scheduling algorithm only needs 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 is close 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.
KW - Adversarial queuing
KW - Interference
KW - Packet latency
KW - Routing scheduling algorithms
KW - Stability
KW - Wireless networks
UR - http://www.scopus.com/inward/record.url?scp=85127530741&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85127530741&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2022.03.038
DO - 10.1016/j.tcs.2022.03.038
M3 - Article
AN - SCOPUS:85127530741
SN - 0304-3975
VL - 921
SP - 20
EP - 35
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -