Paper Info
Title
Learning Algorithms for Scheduling in Wireless Networks with Unknown Channel Statistics.
Abstract
We study the problem of learning channel statistics in order to efficiently schedule transmissions in wireless networks subject to interference constraints. In particular, we focus on the primary interference model which requires that at any time the set of activated links be a matching in the corresponding graph. We propose a distributable algorithm that forms greedy matchings in the graph in order to learn the channels' transmission rates, while simultaneously exploiting previous observations to obtain high throughput. Comparison to the offline solution shows our algorithm to have good performance that scales well with the number of links in the network. We then turn our attention to the stochastic setting where packets randomly arrive to the network and await transmission in queues at the nodes. We develop a queue-length-based scheduling policy that uses the channel learning algorithm as a component. We analyze our method in time varying environments and show that it achieves the same stability region as that of a greedy matching policy with full channel knowledge (i.e., half of the full stability region).
Year
DOI
Venue
2018
10.1145/3209582.3209586
Mobihoc '18: The Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Los Angeles CA USA June, 2018
Keywords
Field
DocType
Wireless networks, network control, transmission scheduling
Wireless network,Computer science,Scheduling (computing),Network packet,Queue,Communication channel,Algorithm,Computer network,Channel statistics,Interference (wave propagation),Throughput
Conference
Issue
ISBN
Citations 
s and Innovations
978-1-4503-5770-8
0
PageRank 
References 
Authors
0.34
16
3
Name
Order
Citations
PageRank
Thomas Stahlbuhk131.91
Brooke Shrader26711.06
Eytan Modiano33714314.44