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.
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
Walid Saad,Zhu Han,M. Debbah,A. Hjørungnes
Published 2008 in ICC Workshops - 2008 IEEE International Conference on Communications Workshops
ABSTRACT
PUBLICATION RECORD
- Publication year
2008
- Venue
ICC Workshops - 2008 IEEE International Conference on Communications Workshops
- Publication date
2008-02-15
- Fields of study
Mathematics, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-10 of 10 references · Page 1 of 1
CITED BY
Showing 1-78 of 78 citing papers · Page 1 of 1