A distributed merge and split algorithm for fair cooperation in wireless networks

Walid Saad, Zhu Han, Mérouane Debbah, Are Hjørungnes

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

49 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationICC 2008 - 2008 IEEE International Conference on Communications Workshops, Workshops Proceedings
Pages311-315
Number of pages5
DOIs
StatePublished - 2008
EventICC 2008 - 2008 IEEE International Conference on Communications Workshops - Beijing, China
Duration: May 19 2008 → May 23 2008

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

OtherICC 2008 - 2008 IEEE International Conference on Communications Workshops
CountryChina
CityBeijing
Period5/19/08 → 5/23/08

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Access to Document

Fingerprint Dive into the research topics of 'A distributed merge and split algorithm for fair cooperation in wireless networks'. Together they form a unique fingerprint.

Cite this