Distributed Learning and Coordination in Cognitive Infrastructureless Networks of Unknown Size

作     者：Kumar, Rohit Darak, Sumit J. Hanawal, Manjesh K. Yadav, Ankit 

作者机构：Natl Inst Technol Delhi Dept Elect & Commun Engn New Delhi 110040 India Indian Inst Technol Delhi Dept Elect & Commun Engn New Delhi 110020 India Indian Inst Technol Ind Engn & Operat Res Bombay 400076 Maharashtra India Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA 

出 版 物：《IEEE SYSTEMS JOURNAL》 (IEEE系统杂志)

年 卷 期：2020年第14卷第2期

页      面：2085-2096页

核心收录：

学科分类：0810[工学-信息与通信工程] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：INSPIRE Faculty Fellowship [IFA-14/ENG-73] DST IIT Bombay IRCC SEED [16IRCCSG010] DST, Government of India 

主　　题：Distributed algorithms infrastructureless network multiplayer bandit opportunistic spectrum access 

摘      要：The cognitive infrastructureless network has received significant attention to reduce signaling load in next-generation networks, which are expected to be ultradense with very high peak rate but relatively lower expected traffic per user. Research in this area has evolved from the distributed algorithms requiring prior knowledge of the number of secondary users (SUs) U to the existing algorithms, which can estimate U independently by counting the number of collisions. The major drawback of these algorithms is the large number of collisions leading to wastage of power and bring down the effective life of battery operated SUs. In this paper, we develop algorithms that learn faster and incurs fewer collisions. We assume unknown U with two types of networks: fixed U (i.e., static networks) and time-varying U (i.e., dynamic networks). Proposed algorithms are based on the multiplayer multi-armed bandit (MAB) approach. We show that the proposed algorithms offer constant regret (i.e., throughput loss) with high probability and sub-linear regret in static and dynamic networks, respectively. Theoretical analysis, simulation, and experimental results demonstrate the efficacy of the proposed algorithms in terms of vacant spectrum utilization, regret, and the number of collisions. Fewer collisions significantly increase the operational life of SUs.