A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks - Computer Science > Information TheoryReport as inadecuate




A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: This paper introduces a novel concept from coalitional game theory whichallows the dynamic formation of coalitions among wireless nodes. A simple anddistributed merge and split algorithm for coalition formation is constructed.This algorithm is applied to study the gains resulting from the cooperationamong single antenna transmitters for virtual MIMO formation. The aim is tofind an ultimate transmitters coalition structure that allows cooperating usersto maximize their utilities while accounting for the cost of coalitionformation. Through this novel game theoretical framework, the wireless networktransmitters are able to self-organize and form a structured network composedof disjoint stable coalitions. Simulation results show that the proposedalgorithm can improve the average individual user utility by 26.4% as well ascope with the mobility of the distributed users.



Author: Walid Saad, Zhu Han, Merouane Debbah, Are Hjørungnes

Source: https://arxiv.org/







Related documents