TY - GEN
T1 - Overlapping coalition formation games for cooperative interference management in small cell networks
AU - Zhang, Zengfeng
AU - Song, Lingyang
AU - Han, Zhu
AU - Saad, Walid
AU - Lu, Zhaohua
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2013
Y1 - 2013
N2 - In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a new approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing works which assume that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as an overlapping coalition formation game. In this game, each small cell base station can choose to participate in one or more cooperative groups (or coalitions) simultaneously, so as to optimize the tradeoff between the benefits and costs associated with cooperation. We study the properties of the proposed game and we show that it exhibits negative externalities due to interference. Then, we propose a novel decentralized algorithm that allows the small cell base stations to interact and self-organize into a stable overlapping coalitional structure. Simulation results show that the proposed algorithm results in a notable performance advantage in terms of the total system sum-rate, relative to the noncooperative case and the classical algorithms for coalitional games with non-overlapping coalitions.
AB - In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a new approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing works which assume that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as an overlapping coalition formation game. In this game, each small cell base station can choose to participate in one or more cooperative groups (or coalitions) simultaneously, so as to optimize the tradeoff between the benefits and costs associated with cooperation. We study the properties of the proposed game and we show that it exhibits negative externalities due to interference. Then, we propose a novel decentralized algorithm that allows the small cell base stations to interact and self-organize into a stable overlapping coalitional structure. Simulation results show that the proposed algorithm results in a notable performance advantage in terms of the total system sum-rate, relative to the noncooperative case and the classical algorithms for coalitional games with non-overlapping coalitions.
UR - http://www.scopus.com/inward/record.url?scp=84881596589&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881596589&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2013.6554639
DO - 10.1109/WCNC.2013.6554639
M3 - Conference contribution
AN - SCOPUS:84881596589
SN - 9781467359399
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 643
EP - 648
BT - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
T2 - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
Y2 - 7 April 2013 through 10 April 2013
ER -