2013 International Conference on Communication and Signal Processing 2013
DOI: 10.1109/iccsp.2013.6577074
|View full text |Cite
|
Sign up to set email alerts
|

Network selection in wireless heterogeneous networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…Results show convergence to stable configurations in different scenarios, including underloaded vs. congested RATs and different service costs. Bush-Morsteller and Boltzmann-Gibbs CODIPAS-RL are compared in a WiMAX/WLAN scenario in [236], where the latter shows faster convergence. Moreover, Multiplicative Weighted Imitative CODIPAS-RL is used to benchmark the network-assisted solution in [93] (Section VI-D1), showing low performance in terms of convergence speed, per-user switchings, and system utility compared to other learning schemes, that however exploit more information and network assistance.…”
Section: ) Stochastic Learning Automata (Sla)mentioning
confidence: 99%
“…Results show convergence to stable configurations in different scenarios, including underloaded vs. congested RATs and different service costs. Bush-Morsteller and Boltzmann-Gibbs CODIPAS-RL are compared in a WiMAX/WLAN scenario in [236], where the latter shows faster convergence. Moreover, Multiplicative Weighted Imitative CODIPAS-RL is used to benchmark the network-assisted solution in [93] (Section VI-D1), showing low performance in terms of convergence speed, per-user switchings, and system utility compared to other learning schemes, that however exploit more information and network assistance.…”
Section: ) Stochastic Learning Automata (Sla)mentioning
confidence: 99%
“…Bush Mosteller based CODIPAS-RL is a stochastic model of reinforcement learning where users decide which action to take stochastically: each user's strategy is defined by the probability of undertaking each of the two actions available to them. After every user has selected an action according to their probability, every user receives the corresponding utility and revises their strategy [6,11,12]. The action of each user is determined based on (1)…”
Section: Bush Mosteller Based Codipas-rlmentioning
confidence: 99%
“…System performance should be guaranteed by a network selection scheme while satisfying subjective requirements such as user preferences. Although bit error rate (BER) was evaluated in [15] and packet loss rate (PLR) and average download cost were simulated in [7], there is a lack of more comprehensive simulations showing the actual impact of network selection on system performance such as average user equipment (UE) SINR and spectral efficiency.…”
Section: Introductionmentioning
confidence: 99%
“…The network selection problem has been modeled using Markov chain [2] [3][4] [5], utility theory [6] [7], fuzzy logic theory [8] [9][10], game theory [11], multiple attribute decision making (MADM) [9][12] [13] [14], reinforcement learning [15] and fittingness-factor based schemes [16]. Markov chain and game theory methods provide better precision at the cost of higher complexity and slower decision making.…”
Section: Introductionmentioning
confidence: 99%