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 proceedingConference contribution

46 Citations (Scopus)

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
Title of host publicationIEEE International Conference on Communications
Pages311-315
Number of pages5
DOIs
StatePublished - Sep 1 2008
EventICC 2008 - 2008 IEEE International Conference on Communications Workshops - Beijing, China
Duration: May 19 2008May 23 2008

Other

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

Fingerprint

Transmitters
Wireless networks
Game theory
MIMO systems
Antennas
Costs

ASJC Scopus subject areas

  • Media Technology

Cite this

Saad, W., Han, Z., Debbah, M., & Hjørungnes, A. (2008). A distributed merge and split algorithm for fair cooperation in wireless networks. In IEEE International Conference on Communications (pp. 311-315). [4531913] https://doi.org/10.1109/ICCW.2008.65

A distributed merge and split algorithm for fair cooperation in wireless networks. / Saad, Walid; Han, Zhu; Debbah, Mérouane; Hjørungnes, Are.

IEEE International Conference on Communications. 2008. p. 311-315 4531913.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Saad, W, Han, Z, Debbah, M & Hjørungnes, A 2008, A distributed merge and split algorithm for fair cooperation in wireless networks. in IEEE International Conference on Communications., 4531913, pp. 311-315, ICC 2008 - 2008 IEEE International Conference on Communications Workshops, Beijing, China, 5/19/08. https://doi.org/10.1109/ICCW.2008.65
Saad W, Han Z, Debbah M, Hjørungnes A. A distributed merge and split algorithm for fair cooperation in wireless networks. In IEEE International Conference on Communications. 2008. p. 311-315. 4531913 https://doi.org/10.1109/ICCW.2008.65
Saad, Walid ; Han, Zhu ; Debbah, Mérouane ; Hjørungnes, Are. / A distributed merge and split algorithm for fair cooperation in wireless networks. IEEE International Conference on Communications. 2008. pp. 311-315
@inproceedings{7aa858e16950422cb2e16de5d99b8386,
title = "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.",
author = "Walid Saad and Zhu Han and M{\'e}rouane Debbah and Are Hj{\o}rungnes",
year = "2008",
month = "9",
day = "1",
doi = "10.1109/ICCW.2008.65",
language = "English",
isbn = "9781424420513",
pages = "311--315",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

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

AU - Saad, Walid

AU - Han, Zhu

AU - Debbah, Mérouane

AU - Hjørungnes, Are

PY - 2008/9/1

Y1 - 2008/9/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/ICCW.2008.65

DO - 10.1109/ICCW.2008.65

M3 - Conference contribution

SN - 9781424420513

SP - 311

EP - 315

BT - IEEE International Conference on Communications

ER -