Hierarchical network formation games in the uplink of multi-hop wireless networks

Walid Saad, Quanyan Zhu, Tamer Başar, Zhu Han, Are Hjørungnes

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

15 Citations (Scopus)

Abstract

In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the uplink of a wireless multi-hop network. Unlike existing literature which focused on the performance assessment of hierarchical multi-hop networks given an existing topology, this paper investigates the problem of the formation of this topology among a number of nodes that seek to send data in the uplink to a central base station through multihop. We model the problem as a hierarchical network formation game and we divide the network into different hierarchy levels, whereby the nodes belonging to the same level engage in a non-cooperative Nash game for selecting their next hop. As a solution to the game, we propose a novel equilibrium concept, the hierarchical Nash equilibrium, for a sequence of multi-stage Nash games, which can be found by backward induction analytically. For finding this equilibrium, we propose a distributed myopic dynamics algorithm, based on fictitious play, in which each node computes the mixed strategies that maximize its utility which represents the probability of successful transmission over the multi-hop communication path in the presence of interference. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved expected utility per user up to 125.6% relative to a nearest neighbor algorithm.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
StatePublished - Dec 1 2009
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United States
Duration: Nov 30 2009Dec 4 2009

Other

Other2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
CountryUnited States
CityHonolulu, HI
Period11/30/0912/4/09

Fingerprint

Wireless networks
Topology
Network architecture
Base stations
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Saad, W., Zhu, Q., Başar, T., Han, Z., & Hjørungnes, A. (2009). Hierarchical network formation games in the uplink of multi-hop wireless networks. In GLOBECOM - IEEE Global Telecommunications Conference [5426293] https://doi.org/10.1109/GLOCOM.2009.5426293

Hierarchical network formation games in the uplink of multi-hop wireless networks. / Saad, Walid; Zhu, Quanyan; Başar, Tamer; Han, Zhu; Hjørungnes, Are.

GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5426293.

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

Saad, W, Zhu, Q, Başar, T, Han, Z & Hjørungnes, A 2009, Hierarchical network formation games in the uplink of multi-hop wireless networks. in GLOBECOM - IEEE Global Telecommunications Conference., 5426293, 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009, Honolulu, HI, United States, 11/30/09. https://doi.org/10.1109/GLOCOM.2009.5426293
Saad W, Zhu Q, Başar T, Han Z, Hjørungnes A. Hierarchical network formation games in the uplink of multi-hop wireless networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5426293 https://doi.org/10.1109/GLOCOM.2009.5426293
Saad, Walid ; Zhu, Quanyan ; Başar, Tamer ; Han, Zhu ; Hjørungnes, Are. / Hierarchical network formation games in the uplink of multi-hop wireless networks. GLOBECOM - IEEE Global Telecommunications Conference. 2009.
@inproceedings{36fe495e22be479baa5666dbf0ebbe76,
title = "Hierarchical network formation games in the uplink of multi-hop wireless networks",
abstract = "In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the uplink of a wireless multi-hop network. Unlike existing literature which focused on the performance assessment of hierarchical multi-hop networks given an existing topology, this paper investigates the problem of the formation of this topology among a number of nodes that seek to send data in the uplink to a central base station through multihop. We model the problem as a hierarchical network formation game and we divide the network into different hierarchy levels, whereby the nodes belonging to the same level engage in a non-cooperative Nash game for selecting their next hop. As a solution to the game, we propose a novel equilibrium concept, the hierarchical Nash equilibrium, for a sequence of multi-stage Nash games, which can be found by backward induction analytically. For finding this equilibrium, we propose a distributed myopic dynamics algorithm, based on fictitious play, in which each node computes the mixed strategies that maximize its utility which represents the probability of successful transmission over the multi-hop communication path in the presence of interference. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved expected utility per user up to 125.6{\%} relative to a nearest neighbor algorithm.",
author = "Walid Saad and Quanyan Zhu and Tamer Başar and Zhu Han and Are Hj{\o}rungnes",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2009.5426293",
language = "English",
isbn = "9781424441488",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Hierarchical network formation games in the uplink of multi-hop wireless networks

AU - Saad, Walid

AU - Zhu, Quanyan

AU - Başar, Tamer

AU - Han, Zhu

AU - Hjørungnes, Are

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the uplink of a wireless multi-hop network. Unlike existing literature which focused on the performance assessment of hierarchical multi-hop networks given an existing topology, this paper investigates the problem of the formation of this topology among a number of nodes that seek to send data in the uplink to a central base station through multihop. We model the problem as a hierarchical network formation game and we divide the network into different hierarchy levels, whereby the nodes belonging to the same level engage in a non-cooperative Nash game for selecting their next hop. As a solution to the game, we propose a novel equilibrium concept, the hierarchical Nash equilibrium, for a sequence of multi-stage Nash games, which can be found by backward induction analytically. For finding this equilibrium, we propose a distributed myopic dynamics algorithm, based on fictitious play, in which each node computes the mixed strategies that maximize its utility which represents the probability of successful transmission over the multi-hop communication path in the presence of interference. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved expected utility per user up to 125.6% relative to a nearest neighbor algorithm.

AB - In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the uplink of a wireless multi-hop network. Unlike existing literature which focused on the performance assessment of hierarchical multi-hop networks given an existing topology, this paper investigates the problem of the formation of this topology among a number of nodes that seek to send data in the uplink to a central base station through multihop. We model the problem as a hierarchical network formation game and we divide the network into different hierarchy levels, whereby the nodes belonging to the same level engage in a non-cooperative Nash game for selecting their next hop. As a solution to the game, we propose a novel equilibrium concept, the hierarchical Nash equilibrium, for a sequence of multi-stage Nash games, which can be found by backward induction analytically. For finding this equilibrium, we propose a distributed myopic dynamics algorithm, based on fictitious play, in which each node computes the mixed strategies that maximize its utility which represents the probability of successful transmission over the multi-hop communication path in the presence of interference. Simulation results show that the proposed algorithm presents significant gains in terms of average achieved expected utility per user up to 125.6% relative to a nearest neighbor algorithm.

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

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

U2 - 10.1109/GLOCOM.2009.5426293

DO - 10.1109/GLOCOM.2009.5426293

M3 - Conference contribution

SN - 9781424441488

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -