A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks

Walid Saad, Zhu Han, Mérouane Debbah, Are Hjørungnes, Tamer Başar

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

16 Citations (Scopus)

Abstract

In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their serving base station (BS) in an IEEE 802.16j WiMAX network. Unlike existing literature, which focused on the performance assessment of the network in the presence of the RSs, we investigate the topology and dynamics of the tree structure in the uplink of an 802.16j network. We model the problem as a network formation game, where each RS aims to maximize its utility that accounts for the gains from cooperation in terms of bit error rate (BER) and the delay costs resulting from multi-hop transmission. The proposed utility model is based on the concept of the R-factor which is a parameter suitable for assessing the performance of VoIP services. For forming the tree structure, we propose a distributed myopic best response dynamics in which each RS can autonomously choose the path that connects it to the BS through other relays while optimizing its utility. Using the proposed dynamics, the RSs can self-organize into the tree structure, and adapt this topology to environmental changes such as mobility while converging to a Nash tree network. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved MS utility reaching up to 42.57% compared to the star topology where all RSs are directly connected to the BS, and up to 44.78% compared to the case with no RSs.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Conference on Communications, ICC 2009 - Dresden, Germany
Duration: Jun 14 2009Jun 18 2009

Other

Other2009 IEEE International Conference on Communications, ICC 2009
CountryGermany
CityDresden
Period6/14/096/18/09

Fingerprint

Base stations
Topology
Bit error rate
Stars
Dynamic response
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Saad, W., Han, Z., Debbah, M., Hjørungnes, A., & Başar, T. (2009). A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks. In IEEE International Conference on Communications [5198608] https://doi.org/10.1109/ICC.2009.5198608

A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks. / Saad, Walid; Han, Zhu; Debbah, Mérouane; Hjørungnes, Are; Başar, Tamer.

IEEE International Conference on Communications. 2009. 5198608.

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

Saad, W, Han, Z, Debbah, M, Hjørungnes, A & Başar, T 2009, A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks. in IEEE International Conference on Communications., 5198608, 2009 IEEE International Conference on Communications, ICC 2009, Dresden, Germany, 6/14/09. https://doi.org/10.1109/ICC.2009.5198608
Saad W, Han Z, Debbah M, Hjørungnes A, Başar T. A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks. In IEEE International Conference on Communications. 2009. 5198608 https://doi.org/10.1109/ICC.2009.5198608
Saad, Walid ; Han, Zhu ; Debbah, Mérouane ; Hjørungnes, Are ; Başar, Tamer. / A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks. IEEE International Conference on Communications. 2009.
@inproceedings{f8e86a16d6474408999cd34ceffa40c7,
title = "A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks",
abstract = "In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their serving base station (BS) in an IEEE 802.16j WiMAX network. Unlike existing literature, which focused on the performance assessment of the network in the presence of the RSs, we investigate the topology and dynamics of the tree structure in the uplink of an 802.16j network. We model the problem as a network formation game, where each RS aims to maximize its utility that accounts for the gains from cooperation in terms of bit error rate (BER) and the delay costs resulting from multi-hop transmission. The proposed utility model is based on the concept of the R-factor which is a parameter suitable for assessing the performance of VoIP services. For forming the tree structure, we propose a distributed myopic best response dynamics in which each RS can autonomously choose the path that connects it to the BS through other relays while optimizing its utility. Using the proposed dynamics, the RSs can self-organize into the tree structure, and adapt this topology to environmental changes such as mobility while converging to a Nash tree network. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved MS utility reaching up to 42.57{\%} compared to the star topology where all RSs are directly connected to the BS, and up to 44.78{\%} compared to the case with no RSs.",
author = "Walid Saad and Zhu Han and M{\'e}rouane Debbah and Are Hj{\o}rungnes and Tamer Başar",
year = "2009",
month = "11",
day = "19",
doi = "10.1109/ICC.2009.5198608",
language = "English",
isbn = "9781424434350",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - A game-based self-organizing uplink tree for VoIP services in IEEE 802.16j networks

AU - Saad, Walid

AU - Han, Zhu

AU - Debbah, Mérouane

AU - Hjørungnes, Are

AU - Başar, Tamer

PY - 2009/11/19

Y1 - 2009/11/19

N2 - In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their serving base station (BS) in an IEEE 802.16j WiMAX network. Unlike existing literature, which focused on the performance assessment of the network in the presence of the RSs, we investigate the topology and dynamics of the tree structure in the uplink of an 802.16j network. We model the problem as a network formation game, where each RS aims to maximize its utility that accounts for the gains from cooperation in terms of bit error rate (BER) and the delay costs resulting from multi-hop transmission. The proposed utility model is based on the concept of the R-factor which is a parameter suitable for assessing the performance of VoIP services. For forming the tree structure, we propose a distributed myopic best response dynamics in which each RS can autonomously choose the path that connects it to the BS through other relays while optimizing its utility. Using the proposed dynamics, the RSs can self-organize into the tree structure, and adapt this topology to environmental changes such as mobility while converging to a Nash tree network. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved MS utility reaching up to 42.57% compared to the star topology where all RSs are directly connected to the BS, and up to 44.78% compared to the case with no RSs.

AB - In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their serving base station (BS) in an IEEE 802.16j WiMAX network. Unlike existing literature, which focused on the performance assessment of the network in the presence of the RSs, we investigate the topology and dynamics of the tree structure in the uplink of an 802.16j network. We model the problem as a network formation game, where each RS aims to maximize its utility that accounts for the gains from cooperation in terms of bit error rate (BER) and the delay costs resulting from multi-hop transmission. The proposed utility model is based on the concept of the R-factor which is a parameter suitable for assessing the performance of VoIP services. For forming the tree structure, we propose a distributed myopic best response dynamics in which each RS can autonomously choose the path that connects it to the BS through other relays while optimizing its utility. Using the proposed dynamics, the RSs can self-organize into the tree structure, and adapt this topology to environmental changes such as mobility while converging to a Nash tree network. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved MS utility reaching up to 42.57% compared to the star topology where all RSs are directly connected to the BS, and up to 44.78% compared to the case with no RSs.

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

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

U2 - 10.1109/ICC.2009.5198608

DO - 10.1109/ICC.2009.5198608

M3 - Conference contribution

SN - 9781424434350

BT - IEEE International Conference on Communications

ER -