Spectrum Sharing for Device-to-Device Communications in Cellular Networks: A Game Theoretic Approach

被引:0
作者
Xiao, Yong [1 ]
Chen, Kwang-Cheng [2 ]
Yuen, Chau [1 ]
DaSilva, Luiz A. [3 ,4 ]
机构
[1] Singapore Univ Technol & Design, Singapore, Singapore
[2] Natl Taiwan Univ, Grad Inst Commun Engn, Taipei, Taiwan
[3] Trinity Coll Dublin, CTVR, Dublin, Ireland
[4] Virginia Tech, Dept Elect & Comp Engn, Charlottesville, VA 22903 USA
来源
2014 IEEE INTERNATIONAL SYMPOSIUM ON DYNAMIC SPECTRUM ACCESS NETWORKS (DYSPAN) | 2014年
基金
爱尔兰科学基金会;
关键词
Device-to-device communication; stable marriage; stable roommates; matching market; spectrum sharing; cellular network; game theory; ALGORITHMS; FRAMEWORK;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies the spectrum sharing problem between device-to-device (D2D) and cellular communications in a cellular network. In this network, the D2D links can access the spectrum controlled by a mobile network operator. Each D2D link can either access the sub-bands occupied by cellular subscribers or obtain a sub-band for its exclusive use. The D2D links with exclusive use of sub-bands can also share spectrum with each other. We observe that the above spectrum sharing problem is complex and there may not exist a stable spectrum sharing structure. We establish a hierarchical matching market with incomplete information to model and analyze the above D2D spectrum sharing problem. In our model, each D2D link is selfish and autonomous. We seek a Bayesian equilibrium of our market that achieves a stable spectrum sharing structure among all the D2D links. We derive a sufficient condition for which the Bayesian equilibrium exists. We propose a distributed algorithm which can detect whether this sufficient condition is satisfied and, if satisfied, achieve the Bayesian equilibrium. Our algorithm does not require each D2D link to know the payoffs of others and has the worst case complexity of O(L-3 J) in each iteration where L is the number of D2D links, J is the number of cellular sub-bands.
引用
收藏
页码:60 / 71
页数:12
相关论文
共 28 条
  • [11] Goldsmith A., 2005, Wireless Communications
  • [12] The stable roommates problem with ties
    Irving, RW
    Manlove, DF
    [J]. JOURNAL OF ALGORITHMS, 2002, 43 (01) : 85 - 105
  • [13] Iwama K., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P443
  • [14] Iwama K., 2008, IEEE INT C INF ED RE
  • [15] Kaufman B., 2013, IEEE T WIRE IN PRESS
  • [16] Knuth D.E., 1996, CRM P LECT NOTES, V10
  • [17] Mukherjee A., 2012, INT ITG WORKSH SMART
  • [18] Myerson R. B., 1997, Game Theory: Analysis of Conflict
  • [19] Osseiran A., 2009, ICT MOB SUMM SANT SP
  • [20] Paul U, 2011, IEEE INFOCOM SER, P882, DOI 10.1109/INFCOM.2011.5935313