TY - GEN
T1 - Coalition formation games for relay transmission
T2 - 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011
AU - Niyato, Dusit
AU - Wang, Ping
AU - Saad, Walid
AU - Han, Zhu
AU - Hjørungnes, Are
PY - 2011/6/23
Y1 - 2011/6/23
N2 - Relay transmission or cooperative communication is an advanced technique that can improve the performance of data transmission among wireless nodes. However, while the performance (e.g., throughput) of a source node can be improved through cooperation with a number of relays, this improvement comes at the expense of a degraded performance for the relay nodes due to the resources that they dedicate for helping the source node in its transmission. In this paper, we formulate a coalitional game among the wireless nodes that seek to improve their performance by relaying each other's data. The game is classified as a coalition formation game in which the nodes can take individual and distributed decisions to join or split from a given coalition while ensuring that their individual throughput is maximized. A Markov chain model is proposed to investigate the stability of the resulting coalitional structures. Further, we consider the practical case in which the wireless nodes do not have an exact and perfect knowledge of the parameters (e.g., channel quality) in coalition formation. For this scenario, we analyze the stability of the partitions resulting from the proposed coalition formation game under uncertainty. We also define the conditions needed for obtaining the stable and unstable coalitional structures among the nodes that are performing cooperative transmission.
AB - Relay transmission or cooperative communication is an advanced technique that can improve the performance of data transmission among wireless nodes. However, while the performance (e.g., throughput) of a source node can be improved through cooperation with a number of relays, this improvement comes at the expense of a degraded performance for the relay nodes due to the resources that they dedicate for helping the source node in its transmission. In this paper, we formulate a coalitional game among the wireless nodes that seek to improve their performance by relaying each other's data. The game is classified as a coalition formation game in which the nodes can take individual and distributed decisions to join or split from a given coalition while ensuring that their individual throughput is maximized. A Markov chain model is proposed to investigate the stability of the resulting coalitional structures. Further, we consider the practical case in which the wireless nodes do not have an exact and perfect knowledge of the parameters (e.g., channel quality) in coalition formation. For this scenario, we analyze the stability of the partitions resulting from the proposed coalition formation game under uncertainty. We also define the conditions needed for obtaining the stable and unstable coalitional structures among the nodes that are performing cooperative transmission.
KW - coalitional game theory
KW - Cooperative communications and networking
KW - Markov chain
UR - http://www.scopus.com/inward/record.url?scp=79959308883&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959308883&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2011.5779259
DO - 10.1109/WCNC.2011.5779259
M3 - Conference contribution
AN - SCOPUS:79959308883
SN - 9781612842547
T3 - 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011
SP - 920
EP - 925
BT - 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011
Y2 - 28 March 2011 through 31 March 2011
ER -