TY - GEN
T1 - Dynamic bandwidth allocation in mobile social networks with multiple homing access
AU - Su, Zhou
AU - Xu, Qichao
AU - Zhang, Kuan
AU - Yang, Kan
AU - Shen, Xuemin Sherman
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/11/30
Y1 - 2015/11/30
N2 - In this paper, we propose a dynamic bandwidth allocation scheme based on Stackelberg game for a heterogeneous network to simultaneously offer mobile social users with bandwidth via multiple homing access. In specific, network operators in the heterogeneous network compete with each other to determine the price of the bandwidth based on the prediction of mobile social users' demands. Then, mobile social users with the same interests form a social community as a coalition to dynamically request bandwidth and share the cost with each other. We formulate the bandwidth allocation problem as a Stackelberg game to model the interactions among mobile social users and network operators. In addition, with a backward induction, an iterative algorithm is proposed to obtain the Stackelberg equilibrium. Finally, simulation results show that the proposed scheme can improve both the efficiency ratio of bandwidth allocation and load balance of networks compared with uniform bandwidth allocation, random bandwidth allocation, and single access scheme.
AB - In this paper, we propose a dynamic bandwidth allocation scheme based on Stackelberg game for a heterogeneous network to simultaneously offer mobile social users with bandwidth via multiple homing access. In specific, network operators in the heterogeneous network compete with each other to determine the price of the bandwidth based on the prediction of mobile social users' demands. Then, mobile social users with the same interests form a social community as a coalition to dynamically request bandwidth and share the cost with each other. We formulate the bandwidth allocation problem as a Stackelberg game to model the interactions among mobile social users and network operators. In addition, with a backward induction, an iterative algorithm is proposed to obtain the Stackelberg equilibrium. Finally, simulation results show that the proposed scheme can improve both the efficiency ratio of bandwidth allocation and load balance of networks compared with uniform bandwidth allocation, random bandwidth allocation, and single access scheme.
KW - Mobile social networks (MSNs)
KW - Stackelberg game
KW - bandwidth allocation
KW - multiple homing access
UR - https://www.scopus.com/pages/publications/84975691286
U2 - 10.1109/WCSP.2015.7341307
DO - 10.1109/WCSP.2015.7341307
M3 - 会议稿件
AN - SCOPUS:84975691286
T3 - 2015 International Conference on Wireless Communications and Signal Processing, WCSP 2015
BT - 2015 International Conference on Wireless Communications and Signal Processing, WCSP 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Conference on Wireless Communications and Signal Processing, WCSP 2015
Y2 - 15 October 2015 through 17 October 2015
ER -