A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks - CentraleSupélec Access content directly
Conference Papers Year : 2008

A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks

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.
Fichier principal
Vignette du fichier
1569093199.pdf (130.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00353190 , version 1 (14-01-2009)

Identifiers

  • HAL Id : hal-00353190 , version 1

Cite

Walid Saad, Han Zhu, Merouane Debbah, Are Hjorungnes. A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks. ChinaCom2008, May 2008, China. 5 p. ⟨hal-00353190⟩
117 View
162 Download

Share

Gmail Facebook X LinkedIn More