Computer Science – Information Theory
Scientific paper
2008-02-15
Computer Science
Information Theory
This paper is accepted for publication at the IEEE ICC Workshop on Cooperative Communications and Networking
Scientific paper
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.
Debbah Merouane
Han Zhangang
Hj\orungnes Are
Saad Walid
No associations
LandOfFree
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-37739