Abstract
This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge and split algorithm for coalition formation is constructed. This algorithm is applied to study the gains resulting from the cooperation among single antenna transmitters for virtual MIMO formation. The aim is to find an ultimate transmitters coalition structure that allows cooperating users to maximize their utilities while accounting for the cost of coalition formation. Through this novel game theoretical framework, the wireless network transmitters are able to self-organize and form a structured network composed of disjoint stable coalitions. Simulation results show that the proposed algorithm can improve the average individual user utility by 26.4% as well as cope with the mobility of the distributed users.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Communications |
| Pages | 311-315 |
| Number of pages | 5 |
| DOIs | |
| State | Published - Sep 1 2008 |
| Event | ICC 2008 - 2008 IEEE International Conference on Communications Workshops - Beijing, China Duration: May 19 2008 → May 23 2008 |
Other
| Other | ICC 2008 - 2008 IEEE International Conference on Communications Workshops |
|---|---|
| Country | China |
| City | Beijing |
| Period | 5/19/08 → 5/23/08 |
Fingerprint
ASJC Scopus subject areas
- Media Technology
Cite this
A distributed merge and split algorithm for fair cooperation in wireless networks. / Saad, Walid; Han, Zhu; Debbah, Mérouane; Hjørungnes, Are.
IEEE International Conference on Communications. 2008. p. 311-315 4531913.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A distributed merge and split algorithm for fair cooperation in wireless networks
AU - Saad, Walid
AU - Han, Zhu
AU - Debbah, Mérouane
AU - Hjørungnes, Are
PY - 2008/9/1
Y1 - 2008/9/1
N2 - This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge and split algorithm for coalition formation is constructed. This algorithm is applied to study the gains resulting from the cooperation among single antenna transmitters for virtual MIMO formation. The aim is to find an ultimate transmitters coalition structure that allows cooperating users to maximize their utilities while accounting for the cost of coalition formation. Through this novel game theoretical framework, the wireless network transmitters are able to self-organize and form a structured network composed of disjoint stable coalitions. Simulation results show that the proposed algorithm can improve the average individual user utility by 26.4% as well as cope with the mobility of the distributed users.
AB - This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge and split algorithm for coalition formation is constructed. This algorithm is applied to study the gains resulting from the cooperation among single antenna transmitters for virtual MIMO formation. The aim is to find an ultimate transmitters coalition structure that allows cooperating users to maximize their utilities while accounting for the cost of coalition formation. Through this novel game theoretical framework, the wireless network transmitters are able to self-organize and form a structured network composed of disjoint stable coalitions. Simulation results show that the proposed algorithm can improve the average individual user utility by 26.4% as well as cope with the mobility of the distributed users.
UR - http://www.scopus.com/inward/record.url?scp=50249164835&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50249164835&partnerID=8YFLogxK
U2 - 10.1109/ICCW.2008.65
DO - 10.1109/ICCW.2008.65
M3 - Conference contribution
SN - 9781424420513
SP - 311
EP - 315
BT - IEEE International Conference on Communications
ER -