A distributed coalition formation framework for fair user cooperation in wireless networks

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

Research output: Contribution to journalArticle

159 Citations (Scopus)

Abstract

Cooperation in wireless networks allows single antenna devices to improve their performance by forming virtual multiple antenna systems. However, performing a distributed and fair cooperation constitutes a major challenge. In this work, we model cooperation in wireless networks through a game theoretical algorithm derived from a novel concept from coalitional game theory. A simple and distributedmerge-and-split algorithm is constructed to form coalition groups among single antenna devices and to allow them to maximize their utilities in terms of rate while accounting for the cost of cooperation in terms of power. The proposed algorithm enables the users to self-organize into independent disjoint coalitions and the resulting clustered network structure is characterized through novel stability notions. In addition, we prove the convergence of the algorithm and we investigate how the network structure changes when different fairness criteria are chosen for apportioning the coalition worth among its members. Simulation results show that the proposed algorithm can improve the individual user"s payoff up to 40.42% as well as efficiently cope with the mobility of the distributed users.

Original languageEnglish
Article number5285181
Pages (from-to)4580-4593
Number of pages14
JournalIEEE Transactions on Wireless Communications
Volume8
Issue number9
DOIs
StatePublished - Sep 1 2009

Fingerprint

Coalition Formation
Wireless Networks
Wireless networks
Coalitions
Antennas
Network Structure
Antenna
Coalitional Games
Multiple Antennas
Game theory
Game Theory
Fairness
Disjoint
Maximise
Framework
Game
Costs
Simulation

Keywords

  • Coalition formation
  • Coalitional games
  • Cooperative networks
  • Game theory
  • Virtual MIMO

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

A distributed coalition formation framework for fair user cooperation in wireless networks. / Saad, Walid; Han, Zhu; Debbah, Mérouane; Hjørungnes, Are.

In: IEEE Transactions on Wireless Communications, Vol. 8, No. 9, 5285181, 01.09.2009, p. 4580-4593.

Research output: Contribution to journalArticle

Saad, Walid ; Han, Zhu ; Debbah, Mérouane ; Hjørungnes, Are. / A distributed coalition formation framework for fair user cooperation in wireless networks. In: IEEE Transactions on Wireless Communications. 2009 ; Vol. 8, No. 9. pp. 4580-4593.
@article{e099297f65a74ce0967fbde4da10eb72,
title = "A distributed coalition formation framework for fair user cooperation in wireless networks",
abstract = "Cooperation in wireless networks allows single antenna devices to improve their performance by forming virtual multiple antenna systems. However, performing a distributed and fair cooperation constitutes a major challenge. In this work, we model cooperation in wireless networks through a game theoretical algorithm derived from a novel concept from coalitional game theory. A simple and distributedmerge-and-split algorithm is constructed to form coalition groups among single antenna devices and to allow them to maximize their utilities in terms of rate while accounting for the cost of cooperation in terms of power. The proposed algorithm enables the users to self-organize into independent disjoint coalitions and the resulting clustered network structure is characterized through novel stability notions. In addition, we prove the convergence of the algorithm and we investigate how the network structure changes when different fairness criteria are chosen for apportioning the coalition worth among its members. Simulation results show that the proposed algorithm can improve the individual user{"}s payoff up to 40.42{\%} as well as efficiently cope with the mobility of the distributed users.",
keywords = "Coalition formation, Coalitional games, Cooperative networks, Game theory, Virtual MIMO",
author = "Walid Saad and Zhu Han and M{\'e}rouane Debbah and Are Hj{\o}rungnes",
year = "2009",
month = "9",
day = "1",
doi = "10.1109/TWC.2009.080522",
language = "English",
volume = "8",
pages = "4580--4593",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - A distributed coalition formation framework for fair user cooperation in wireless networks

AU - Saad, Walid

AU - Han, Zhu

AU - Debbah, Mérouane

AU - Hjørungnes, Are

PY - 2009/9/1

Y1 - 2009/9/1

N2 - Cooperation in wireless networks allows single antenna devices to improve their performance by forming virtual multiple antenna systems. However, performing a distributed and fair cooperation constitutes a major challenge. In this work, we model cooperation in wireless networks through a game theoretical algorithm derived from a novel concept from coalitional game theory. A simple and distributedmerge-and-split algorithm is constructed to form coalition groups among single antenna devices and to allow them to maximize their utilities in terms of rate while accounting for the cost of cooperation in terms of power. The proposed algorithm enables the users to self-organize into independent disjoint coalitions and the resulting clustered network structure is characterized through novel stability notions. In addition, we prove the convergence of the algorithm and we investigate how the network structure changes when different fairness criteria are chosen for apportioning the coalition worth among its members. Simulation results show that the proposed algorithm can improve the individual user"s payoff up to 40.42% as well as efficiently cope with the mobility of the distributed users.

AB - Cooperation in wireless networks allows single antenna devices to improve their performance by forming virtual multiple antenna systems. However, performing a distributed and fair cooperation constitutes a major challenge. In this work, we model cooperation in wireless networks through a game theoretical algorithm derived from a novel concept from coalitional game theory. A simple and distributedmerge-and-split algorithm is constructed to form coalition groups among single antenna devices and to allow them to maximize their utilities in terms of rate while accounting for the cost of cooperation in terms of power. The proposed algorithm enables the users to self-organize into independent disjoint coalitions and the resulting clustered network structure is characterized through novel stability notions. In addition, we prove the convergence of the algorithm and we investigate how the network structure changes when different fairness criteria are chosen for apportioning the coalition worth among its members. Simulation results show that the proposed algorithm can improve the individual user"s payoff up to 40.42% as well as efficiently cope with the mobility of the distributed users.

KW - Coalition formation

KW - Coalitional games

KW - Cooperative networks

KW - Game theory

KW - Virtual MIMO

UR - http://www.scopus.com/inward/record.url?scp=70350311164&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350311164&partnerID=8YFLogxK

U2 - 10.1109/TWC.2009.080522

DO - 10.1109/TWC.2009.080522

M3 - Article

AN - SCOPUS:70350311164

VL - 8

SP - 4580

EP - 4593

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 9

M1 - 5285181

ER -