TY - JOUR
T1 - Frequency resource sharing and allocation scheme based on coalition formation game in hybrid D2D-cellular network
AU - Ou, Qing
AU - Zhang, Rongqing
AU - Luan, Xi
AU - Cheng, Yuxin
AU - Wu, Jun
AU - Wu, Jianjun
N1 - Publisher Copyright:
© 2015 Qing Ou et al.
PY - 2015
Y1 - 2015
N2 - A distributed cooperation scheme on frequency resource sharing is proposed to improve the quality of service (QoS) in device-to-device (D2D) communications underlaying cellular networks. Specifically, we formulate the resource allocation problem as a coalition formation game with transferable utility, in which all users have the incentive to cooperate with some others and form a competitive group to maximize the probability of obtaining their favorite spectrum resources. Taking the cost for coalition formation into account, such as the path loss for data sharing, we prove that the core of the proposed game is empty, which shows the impossibility of grand coalition. Hence, we propose a distributed merge-and-split based coalition formation algorithm based on a new defined Max-Coalition order to effectively solve the coalition game. Compared with the exhaustive search, our algorithm has much lower computer complexity. In addition, we prove that stability and convergence of the proposed algorithm using the concept of a defection function. Finally, the simulation results show that the proposed scheme achieves a suboptimal performance in terms of network sum rate compared with the centralized optimal resource allocation scheme obtained via exhaustive search.
AB - A distributed cooperation scheme on frequency resource sharing is proposed to improve the quality of service (QoS) in device-to-device (D2D) communications underlaying cellular networks. Specifically, we formulate the resource allocation problem as a coalition formation game with transferable utility, in which all users have the incentive to cooperate with some others and form a competitive group to maximize the probability of obtaining their favorite spectrum resources. Taking the cost for coalition formation into account, such as the path loss for data sharing, we prove that the core of the proposed game is empty, which shows the impossibility of grand coalition. Hence, we propose a distributed merge-and-split based coalition formation algorithm based on a new defined Max-Coalition order to effectively solve the coalition game. Compared with the exhaustive search, our algorithm has much lower computer complexity. In addition, we prove that stability and convergence of the proposed algorithm using the concept of a defection function. Finally, the simulation results show that the proposed scheme achieves a suboptimal performance in terms of network sum rate compared with the centralized optimal resource allocation scheme obtained via exhaustive search.
UR - http://www.scopus.com/inward/record.url?scp=84925433291&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84925433291&partnerID=8YFLogxK
U2 - 10.1155/2015/301932
DO - 10.1155/2015/301932
M3 - Article
AN - SCOPUS:84925433291
SN - 1687-5869
VL - 2015
JO - International Journal of Antennas and Propagation
JF - International Journal of Antennas and Propagation
M1 - 301932
ER -