2015
DOI: 10.1109/twc.2015.2417155
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting User Demand Diversity in Heterogeneous Wireless Networks

Abstract: Radio resource management (RRM) is crucial for improving resource utilization in heterogeneous wireless networks. Existing work attempts to exploit the network diversity to gain throughput improvement for users, which, however, neglects the impact of user demand on RRM. Armed with the idea that the ultimate goal of communications is to serve users with personalized demand, we introduce another dimension of potential performance gain, user demand diversity gain. This gain derives from the elaborate matching bet… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 51 publications
(28 citation statements)
references
References 24 publications
0
28
0
Order By: Relevance
“…No-regret learning [33] and stochasticlearning automata [31] converge to the local optimum. To satisfy the above two requirement simultaneously, we resort to trial and error learning algorithm [36], [37], which is fully distributed and statistically converges to the best NE (efficient NE). However, to satisfy the convergence conditions of the algorithm, it is necessary to design the coefficients based on the value of the utility function that are measured multiple times.…”
Section: Distributed Learning For Achieving Nash Equilibriummentioning
confidence: 99%
See 1 more Smart Citation
“…No-regret learning [33] and stochasticlearning automata [31] converge to the local optimum. To satisfy the above two requirement simultaneously, we resort to trial and error learning algorithm [36], [37], which is fully distributed and statistically converges to the best NE (efficient NE). However, to satisfy the convergence conditions of the algorithm, it is necessary to design the coefficients based on the value of the utility function that are measured multiple times.…”
Section: Distributed Learning For Achieving Nash Equilibriummentioning
confidence: 99%
“…In the algorithm, G(x) and F(x) are strictly decreasing functions, which denote the probability of accepting the outcome of an experiment. According to [36], [37], they have the general forms:…”
Section: A Learning-based Spectrum Access Algorithmmentioning
confidence: 99%
“…The studies [14] and [15] have explored the problem of optimizing the user-centric satisfaction while considering userdemand diversity. However, their proposed optimization function and system model do not follow the specific-accesstechnology constraints.…”
Section: Related Work and Motivationsmentioning
confidence: 99%
“…Instead, a generalized problem formulation is proposed. Furthermore, the optimization problem in [14] do not consider the user preferences.…”
Section: Related Work and Motivationsmentioning
confidence: 99%
“…This vision is important since many newly emerging traffic types such as virtual reality need customized performance requirements. Although there is extensive research on network selection, e.g., [2][3], the utility design differentiating uplink and downlink requirements of different traffic types proposed in this paper seems to be absent. Second, the idea of transfer learning [4] based algorithm is used in network selection.…”
Section: Introductionmentioning
confidence: 99%