Congestion Games for Distributed Radio Access Selection in Broadband Networks

Abstract

Nowadays networks are characterized by the abundance of diverse Radio Access Interfaces (RAI) in the same operating area. The various wireless interfaces can belong to the same Radio Access Technology or not. In such a scenario, a mobile user will be able to select selfishly one of the available radio interfaces in order to enhance its own performance. Therefore, the radio access selection policy is vital and must be designed astutely to avoid resource wastage. In this paper, the RAI selection process is apprehended as a congestion game which is a class of noncooperative games in which users share a common set of limited resources. The cost sustained by a given user depends upon the congestion impact inflected by other users sharing the same resource. Devising distributed resource sharing schemes that optimize user air interface selection depends crucially on the existence of Nash equilibria for the modelling congestion games. In this paper, we model the downlink access for three main broadband technologies (WiMAX, WiFi and 3.5G HSDPA) and study the existence of pure Nash equilibria for various multi-RAI scenarios involving those technologies.

Distributed hedonic coalition formation for dynamic network selection of multiple services

“…(8) implies that user n prefers being a member of coalition S α ⊆ N (t) with n ∈ S α over coalition S β ⊆ N (t) with n ∈ S β ,or at least, n prefers both coalitions equally. Furthermore, we propose an incremental preference function f n for any user n ∈ N (t) and any coalition S k such that n ∈ S k : (9) where user m ∈ S k \ {n} and φ n (S k ), φ m (S k \ {n}) is the payoff received by each user in coalition given by (7).…”

“…Therefore, by inspecting (7), (8)and (9), we have Property 2: The proposed network selection coalition formation game is reformulated as a hedonic coalition formation game (N, ), with the preference relation n given by (8) for any user n ∈ N (t).…”

“…Moreover, due to the low complexity nature and being independent of any centralized coordination among different networks, the distributed or user-driven network selection approach has drawn extensive attentions in recent years [4][5][6][7][8][9][10], and game theory provided a suitable mathematical tool to model the distributed user's strategic decision behavior. Congestion game and evolutionary game approaches were used in [8] and [9] respectively to study the competition among users to share the limited amount of bandwidth.…”

“…Congestion game and evolutionary game approaches were used in [8] and [9] respectively to study the competition among users to share the limited amount of bandwidth. Authors in [10] proposed a non-cooperative game approach that models the selection process as competition between the Service Providers 1 (SPs) and users.…”

Reinforcement Learning Based Network Selection for Hybrid VLC and RF Systems

“…In LTE, WLAN and VLC standards, the user achieved instantaneous rate is discrete, which is determined by the user's location and varies with the fading effect over time. Similar to the lecture [15], we make a set of discrete achievable peak rates 1, 2, , We use the uplink dominant traffic to examine the convergence performance of the proposed algorithm. Since observation 1 has revealed that the uplink of VLC could hardly support the high uplink performance requirement, we can remove VLC to reduce the action space.…”