TY - GEN
T1 - Interference Management for Multimedia Femtocell Networks with Coalition Formation Gameformation game
AU - Ma, Bojiang
AU - Cheung, Man Hon
AU - Wong, Vincent W.S.
PY - 2013/6
Y1 - 2013/6
N2 - Recently, the multimedia content delivery has replaced the traditional voice communication as the major source of traffic in wireless networks. The deployment of femtocells is promising in satisfying the requirements of these multimedia applications if the interference among the femtocell access points (FAPs) is well-managed. In this paper, we study the interference management problem of the FAPs in a cooperative multimedia femtocell network. We consider the network setting where the players (i.e., the FAPs) can coordinate their transmissions to reduce the level of interference within a coalition. We first formulate the interference management problem as a coalition formation game in partition form with negative externalities, where the payoff of a player depends on actions of other players in the same coalition and in different coalitions. Based on the solution concept of recursive core in coalitional games, we propose an efficient coalition formation algorithm, RECORD, to achieve a final stable coalition structure. Simulation results show that the RECORD algorithm results in a substantially higher flow throughput and aggregate utility than some previously proposed scheduling algorithms. © 2013 IEEE.
AB - Recently, the multimedia content delivery has replaced the traditional voice communication as the major source of traffic in wireless networks. The deployment of femtocells is promising in satisfying the requirements of these multimedia applications if the interference among the femtocell access points (FAPs) is well-managed. In this paper, we study the interference management problem of the FAPs in a cooperative multimedia femtocell network. We consider the network setting where the players (i.e., the FAPs) can coordinate their transmissions to reduce the level of interference within a coalition. We first formulate the interference management problem as a coalition formation game in partition form with negative externalities, where the payoff of a player depends on actions of other players in the same coalition and in different coalitions. Based on the solution concept of recursive core in coalitional games, we propose an efficient coalition formation algorithm, RECORD, to achieve a final stable coalition structure. Simulation results show that the RECORD algorithm results in a substantially higher flow throughput and aggregate utility than some previously proposed scheduling algorithms. © 2013 IEEE.
UR - http://www.scopus.com/inward/record.url?scp=84891369915&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84891369915&origin=recordpage
U2 - 10.1109/ICC.2013.6655581
DO - 10.1109/ICC.2013.6655581
M3 - RGC 32 - Refereed conference paper (with host publication)
T3 - IEEE International Conference on Communications
SP - 6112
EP - 6117
BT - 2013 IEEE International Conference on Communications (ICC)
A2 - Kim, Dong-In
A2 - Mueller, Peter
PB - IEEE
T2 - 2013 IEEE International Conference on Communications (ICC 2013)
Y2 - 9 June 2013 through 13 June 2013
ER -