An Online Learning Approach to Shortest Path and Backpressure Routing in Wireless Networks
We consider the problem of adaptive routing in wireless communication networks. The problem is investigated in the online learning context, where the link states are assumed to be random variables drawn from unknown distributions, independent and identically distributed across links and time. This s...
Main Authors: | Omer Amar, Ilana Sarfati, Kobi Cohen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10143188/ |
Similar Items
-
A General Framework for Intersection Traffic Control With Backpressure Routing
by: Sen Bai, et al.
Published: (2021-01-01) -
Shortest Path Algorithms for Pedestrian Navigation Systems
by: Kyriakos Koritsoglou, et al.
Published: (2022-05-01) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01) -
Traffic Balancing Method in Shortest Path Routing
by: Mohamed Abdulqader, Makarem
Published: (2007) -
A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm
by: Luay Jabbar, et al.
Published: (2023-02-01)