Utility-Based Resource Allocation for Multi-Channel Decentralized Networks

被引:26
作者
Sheng, Min [1 ]
Xu, Chao [1 ]
Wang, Xijun [1 ]
Zhang, Yan [1 ]
Han, Weijia [1 ]
Li, Jiandong [1 ]
机构
[1] Xidian Univ, State Key Lab ISN, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Decentralized networks; distributed resource allocation; learning; game theory; COGNITIVE RADIO NETWORKS; WIRELESS NETWORKS; SELF-ORGANIZATION; LEARNING APPROACH; POWER-CONTROL; GAMES; INFORMATION; EQUILIBRIA; SYSTEMS;
D O I
10.1109/TCOMM.2014.2357028
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The architecture of decentralization makes future wireless networks more flexible and scalable. However, due to the lack of the central authority (e.g., BS or AP), the limitation of spectrum resource, and the coupling among different users, designing efficient resource allocation strategies for decentralized networks faces a great challenge. In this paper, we address the distributed channel selection and power control problem for a decentralized network consisting of multiple users, i.e., transmit-receiver pairs. Particularly, we first take the users' interactions into account and formulate the distributed resource allocation problem as a noncooperative transmission control game (NTCG). Then, a utility-based transmission control algorithm (UTC) is developed based on the formulated game. Our proposed algorithm is completely distributed as there is no information exchange among different users and hence, is especially appropriate for this decentralized network. Furthermore, we prove that the global optimal solution can be asymptotically obtained with the devised algorithm, and more importantly, in contrast to existing utility-based algorithms, our method does not require that the converging point is one Nash equilibrium (NE) of the formulated game. In this light, our algorithm can be adopted to achieve efficient resource allocation in more general use cases.
引用
收藏
页码:3610 / 3620
页数:11
相关论文
共 30 条
[1]   A Survey of Self Organisation in Future Cellular Networks [J].
Aliu, Osianoh Glenn ;
Imran, Ali ;
Imran, Muhammad Ali ;
Evans, Barry .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2013, 15 (01) :336-361
[2]  
[Anonymous], ACHIEVING PARETO OPT
[3]  
[Anonymous], 2004, WIRELESS COMMUNICATI
[4]  
[Anonymous], 2013, GAME THEORY ANAL CON
[5]   GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm [J].
Babadi, Behtash ;
Tarokh, Vahid .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (12) :6228-6252
[6]  
Bacci G., 2014, P INT WORKSH RES ALL, P1
[7]   Self-Organization in Small Cell Networks: A Reinforcement Learning Approach [J].
Bennis, Mehdi ;
Perlaza, Samir M. ;
Blasco, Pol ;
Han, Zhu ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (07) :3202-3212
[8]   Potential Games for Energy-Efficient Power Control and Subcarrier Allocation in Uplink Multicell OFDMA Systems [J].
Buzzi, Stefano ;
Colavolpe, Giulio ;
Saturnino, Daniela ;
Zappone, Alessio .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2012, 6 (02) :89-103
[9]   A payoff-based learning procedure and its application to traffic games [J].
Cominetti, Roberto ;
Melo, Emerson ;
Sorin, Sylvain .
GAMES AND ECONOMIC BEHAVIOR, 2010, 70 (01) :71-83
[10]   Distributed Interference Management in Two-Tier CDMA Femtocell Networks [J].
Duy Trong Ngo ;
Le, Long Bao ;
Tho Le-Ngoc ;
Hossain, Ekram ;
Kim, Dong In .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (03) :979-989