A learning-based distributed algorithm for scheduling in multi-hop wireless networks

被引:6
作者
Park, Daehyun [1 ]
Kang, Sunjung [2 ]
Joo, Changhee [3 ]
机构
[1] UNIST, ECE, Ulsan, South Korea
[2] OSU, ECE, Columbus, OH USA
[3] Korea Univ, CSE, Seoul, South Korea
关键词
Wireless communication; Spread spectrum communication; Complexity theory; Interference; Wireless networks; Heuristic algorithms; Dynamic scheduling; Distributed algorithm; learning; multi-hop networks; provable efficiency; wireless scheduling; MULTIARMED BANDIT; THROUGHPUT; ACCESS;
D O I
10.23919/JCN.2021.000030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We address the joint problem of learning and scheduling in multi-hop wireless network without a prior knowledge on link rates. Previous scheduling algorithms need the link rate information, and learning algorithms often require a centralized entity and polynomial complexity. These become a major obstacle to develop an efficient learning-based distributed scheme for resource allocation in large-scale multi-hop networks. In this work, by incorporating with learning algorithm, we develop provably efficient scheduling scheme under packet arrival dynamics without a priori link rate information. We extend the results to distributed implementation and evaluation their performance through simulations.
引用
收藏
页码:99 / 110
页数:12
相关论文
共 30 条
[1]   Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret [J].
Anandkumar, Animashree ;
Michael, Nithin ;
Tang, Kevin ;
Swami, Ananthram .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2011, 29 (04) :731-745
[2]   ASYMPTOTICALLY EFFICIENT ALLOCATION RULES FOR THE MULTIARMED BANDIT PROBLEM WITH MULTIPLE PLAYS .1. IID REWARDS [J].
ANANTHARAM, V ;
VARAIYA, P ;
WALRAND, J .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1987, 32 (11) :968-976
[3]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[4]   Wireless link scheduling with power control and SINR constraints [J].
Borbash, Steven A. ;
Ephremides, Anthony .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (11) :5106-5111
[5]   Distributed Link Scheduling With Constant Overhead [J].
Bui, Loc X. ;
Sanghavi, Sujay ;
Srikant, R. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2009, 17 (05) :1467-1480
[6]  
Chen Wei, 2013, INT C MACH LEARN
[7]   Distributed Link Scheduling Under SINR Model in Multihop Wireless Networks [J].
Choi, Jin-Ghoo ;
Joo, Changhee ;
Zhang, Junshan ;
Shroff, Ness B. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (04) :1204-1217
[8]   On Improving Throughput of Multichannel ALOHA using Preamble-based Exploration [J].
Choi, Jinho .
JOURNAL OF COMMUNICATIONS AND NETWORKS, 2020, 22 (05) :380-389
[9]   Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations [J].
Gai, Yi ;
Krishnamachari, Bhaskar ;
Jain, Rahul .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (05) :1466-1478
[10]  
Gai Y, 2011, GLOB TELECOMM CONF