Network formation games for distributed uplink tree construction in IEEE 802.16J networks

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

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

12 Citations (Scopus)

Abstract

This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7% and 17.3% compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages5165-5169
Number of pages5
DOIs
StatePublished - Dec 1 2008
Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States
Duration: Nov 30 2008Dec 4 2008

Other

Other2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
CountryUnited States
CityNew Orleans, LA
Period11/30/0812/4/08

Fingerprint

Packet networks
Base stations
Topology
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Saad, W., Han, Z., Debbah, M., & Hjørungnes, A. (2008). Network formation games for distributed uplink tree construction in IEEE 802.16J networks. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 5165-5169). [4698762] https://doi.org/10.1109/GLOCOM.2008.ECP.987

Network formation games for distributed uplink tree construction in IEEE 802.16J networks. / Saad, Walid; Han, Zhu; Debbah, Mérouane; Hjørungnes, Are.

GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 5165-5169 4698762.

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

Saad, W, Han, Z, Debbah, M & Hjørungnes, A 2008, Network formation games for distributed uplink tree construction in IEEE 802.16J networks. in GLOBECOM - IEEE Global Telecommunications Conference., 4698762, pp. 5165-5169, 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008, New Orleans, LA, United States, 11/30/08. https://doi.org/10.1109/GLOCOM.2008.ECP.987
Saad W, Han Z, Debbah M, Hjørungnes A. Network formation games for distributed uplink tree construction in IEEE 802.16J networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 5165-5169. 4698762 https://doi.org/10.1109/GLOCOM.2008.ECP.987
Saad, Walid ; Han, Zhu ; Debbah, Mérouane ; Hjørungnes, Are. / Network formation games for distributed uplink tree construction in IEEE 802.16J networks. GLOBECOM - IEEE Global Telecommunications Conference. 2008. pp. 5165-5169
@inproceedings{270c089d0086499a92deb4f6243f992e,
title = "Network formation games for distributed uplink tree construction in IEEE 802.16J networks",
abstract = "This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7{\%} and 17.3{\%} compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.",
author = "Walid Saad and Zhu Han and M{\'e}rouane Debbah and Are Hj{\o}rungnes",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2008.ECP.987",
language = "English",
isbn = "9781424423248",
pages = "5165--5169",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Network formation games for distributed uplink tree construction in IEEE 802.16J networks

AU - Saad, Walid

AU - Han, Zhu

AU - Debbah, Mérouane

AU - Hjørungnes, Are

PY - 2008/12/1

Y1 - 2008/12/1

N2 - This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7% and 17.3% compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.

AB - This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7% and 17.3% compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.

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

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

U2 - 10.1109/GLOCOM.2008.ECP.987

DO - 10.1109/GLOCOM.2008.ECP.987

M3 - Conference contribution

AN - SCOPUS:67249158479

SN - 9781424423248

SP - 5165

EP - 5169

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -