Title :
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
Author :
Saad, Walid ; Han, Zhu ; Debbah, Mérouane ; Hjørungnes, Are
Author_Institution :
UniK - Univ. Grad. Center, Univ. of Oslo, Oslo
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.
Keywords :
MIMO communication; distributed algorithms; game theory; radio networks; transmitting antennas; coalitional game theory; distributed merge algorithm; distributed split algorithm; single antenna transmitter; virtual MIMO formation; wireless networks; Communications Society; Costs; Game theory; MIMO; Partitioning algorithms; Radio transmitters; Receiving antennas; Time division multiple access; Transmitting antennas; Wireless networks;
Conference_Titel :
Communications Workshops, 2008. ICC Workshops '08. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2052-0
Electronic_ISBN :
978-1-4244-2052-0
DOI :
10.1109/ICCW.2008.65
