A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
复制标题
DOI：
10.1109/iccw.2008.65
复制
发表时间：
2008-02
期刊：
影响因子：
--
通讯作者：
Walid Saad;Zhu Han;M. Debbah;A. Hjørungnes
中科院分区：
文献类型：
--
作者：
Walid Saad;Zhu Han;M. Debbah;A. Hjørungnes
本文从联盟博弈理论中引入了一个新的概念，该概念允许无线节点之间动态地形成联盟。构造了一种简单、分布式的联盟形成合并分裂算法。将该算法应用于虚拟MIMO编队中单天线发射机之间的协作增益研究。其目的是找到一种最终的发送者联盟结构，允许合作用户最大化他们的效用，同时考虑联盟形成的成本。通过这种新颖的博弈论框架，无线网络发送者能够自组织并形成由不相交的稳定联盟组成的结构化网络。仿真结果表明，该算法在应对分布式用户移动性的同时，使平均个体用户利用率提高了26.4%。
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.