2004
DOI: 10.1023/b:mone.0000042499.64488.ba
|View full text |Cite
|
Sign up to set email alerts
|

Up- and Downlink Admission/Congestion Control and Maximal Load in Large Homogeneous CDMA Networks

Abstract: This paper proposes scalable admission and congestion control schemes that allow each base station to decide independently of the others what set of voice users to serve and/or what bit rates to offer to elastic traffic users competing for bandwidth. These algorithms are primarily meant for large CDMA networks with a random but homogeneous user distribution. They take into account in an exact way the influence of geometry on the combination of inter-cell and intra-cell interferences as well as the existence of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
54
0

Year Published

2007
2007
2015
2015

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 25 publications
(54 citation statements)
references
References 12 publications
0
54
0
Order By: Relevance
“…A simple sufficient condition for the spectral radius of F to be less than η is that each row sum of F is less than η. In general, we can set η strictly less than 1 as a safety margin, as suggested in [1]. Setting η = 1, γ is feasible if for all i we have…”
Section: Assignment Of Sinr Valuesmentioning
confidence: 99%
“…A simple sufficient condition for the spectral radius of F to be less than η is that each row sum of F is less than η. In general, we can set η strictly less than 1 as a safety margin, as suggested in [1]. Setting η = 1, γ is feasible if for all i we have…”
Section: Assignment Of Sinr Valuesmentioning
confidence: 99%
“…Namely, as the probability, that the free process is close to the boundary of the truncated part of the space; 3 . However, for a complicated admission condition (complicated form of the space truncation) it is difficult or even impossible to evaluate analytically this probability, even in the (most simple) Poisson case of the stationary distribution of the free process.…”
Section: B Multi-rate Erlang Loss Model and Its Blocking Probabilitiesmentioning
confidence: 99%
“…The present work adopts the approach proposed in [6] (with a background in [2,3,12]) that is implemented in the dimensioning tool of Orange. It consists in proposing some "virtual" network control mechanism (not necessarily meant to be implemented in network controllers) that however is simple enough and can by studied by the classical tools of queueing theory.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…To consider the random locations of nodes and the interference, we use stochastic geometry [6,7], which is recently widely used in the analysis of wireless networks. Interference depends upon the path loss and the fading characteristics of wireless channels.…”
Section: Introductionmentioning
confidence: 99%