Network Formation Games Among Relay Stations in Next Generation Wireless Networks
Walid Saad, Zhu Han, Tamer Ba\c{s}ar, M\'erouane Debbah, and Are, Hj{\o}rungnes

TL;DR
This paper introduces a game-theoretic distributed algorithm for forming relay station networks in next-generation wireless systems, optimizing structure and performance through autonomous, utility-maximizing decisions.
Contribution
It proposes a novel distributed myopic algorithm for network formation among relay stations, ensuring convergence to Nash trees and adaptability to environmental changes.
Findings
Significant utility gains over no relay stations and simple algorithms.
Average number of hops remains low, not exceeding 3 even with 25 RSs.
Algorithm adapts well to mobility and new station deployment.
Abstract
The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the RSs and their serving base station in the \emph{uplink} of the next generation wireless multi-hop systems. Unlike existing literature which mainly focused on performance analysis, we propose a distributed algorithm for studying the \emph{structure} and \emph{dynamics} of the network. We formulate a network formation game among the RSs whereby each RS aims to maximize a cross-layer utility function that takes into account the benefit from cooperative transmission, in terms of reduced bit error rate, and the costs in terms of the delay due to multi-hop transmission. For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
