2011
DOI: 10.1109/tnet.2011.2158655
|View full text |Cite
|
Sign up to set email alerts
|

Practical Adaptive User Association Policies for Wireless Systems With Dynamic Interference

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 21 publications
0
19
0
Order By: Relevance
“…In this work, however, we do not consider load balancing because when partition time is not orthogonalized among adjacent clusters, inter-cluster interferences from adjacent clusters may become severe. This makes complicated dynamic inter-cell interference unavoidable, and the analysis of flow-level dynamics is not applicable [24,25,27]. In this regard, we consider the case where all cells have the equal partition length.…”
Section: System Modelmentioning
confidence: 99%
“…In this work, however, we do not consider load balancing because when partition time is not orthogonalized among adjacent clusters, inter-cluster interferences from adjacent clusters may become severe. This makes complicated dynamic inter-cell interference unavoidable, and the analysis of flow-level dynamics is not applicable [24,25,27]. In this regard, we consider the case where all cells have the equal partition length.…”
Section: System Modelmentioning
confidence: 99%
“…[7] provides an analysis which identifies for a limited set of LB schemes the conditions under which a scheme provides optimum results w.r.t call blocking. The recent publication [8] analyzes wireless systems under consideration of dynamic coupling between user association and inter-cell interference with the aim to minimize the overall delay of user data in the network.…”
Section: A Related Workmentioning
confidence: 99%
“…The T T T parameter defines the time during which the HO condition defined in formula (8) has to evaluate to true, before a HO is triggered. It takes the values 0.00, 0.02, 0.04 and 0.08 s in this study.…”
Section: Simulation Description and Performance Metricsmentioning
confidence: 99%
See 1 more Smart Citation
“…In [6], the upper and lower bounds on the moments of the queue length of the coupled-processors model are obtained by formulating a moments problem and solving a semidefinite relaxation of the original problem. This analysis method is applied in [7] to study the impact of user association policies on flow-level performance in interference-limited wireless networks. Although the semidefinite relaxation method can be applied to study the coupled-processors model with more than two queues, the size of the formulated optimization problem scales exponentially as the number of queues increases.…”
Section: Introductionmentioning
confidence: 99%