The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.
DOI: 10.1109/vetecs.2003.1207859
|View full text |Cite
|
Sign up to set email alerts
|

UTRA TDD dynamic channel allocation in uplink with slow reallocation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…Slow DCA allocates resources to cells and fast DCA reallocates resources to bearer services. The slow DCA algorithm dynamically allocates resource units to a cell-related priority and preference lists, based on negotiation and measurements between adjacent cells, which classify the time slots so as to avoid the inter-cell interference, used as input to fast DCA [6]. As more advanced approaches to DCA, multi-dimensional optimization frameworks and solution have been proposed to show that dynamic resource allocation (DRA) can effectively handle the asymmetric traffic load over the UL and DL, while warranting the required signal-to-interference ratio (SIR) [8,9].…”
Section: Illustrating Examples For Inter-cell Interferencementioning
confidence: 99%
See 3 more Smart Citations
“…Slow DCA allocates resources to cells and fast DCA reallocates resources to bearer services. The slow DCA algorithm dynamically allocates resource units to a cell-related priority and preference lists, based on negotiation and measurements between adjacent cells, which classify the time slots so as to avoid the inter-cell interference, used as input to fast DCA [6]. As more advanced approaches to DCA, multi-dimensional optimization frameworks and solution have been proposed to show that dynamic resource allocation (DRA) can effectively handle the asymmetric traffic load over the UL and DL, while warranting the required signal-to-interference ratio (SIR) [8,9].…”
Section: Illustrating Examples For Inter-cell Interferencementioning
confidence: 99%
“…It averages the interference level of each slot so as to avoid the excessive interference. In most of the fast DCA algorithms, the priority metric is introduced to prioritize each time slot when a bearer service requires radio resource in the cell [6,10]. A straightforward approach is to select a time slot for each cell in a random manner, which is referred to as a random channel allocation (RCA) scheme [6,10,15].…”
Section: The Existing Fast Dca Algorithms For the Td-scdma Systemmentioning
confidence: 99%
See 2 more Smart Citations
“…Without special channel allocation scheme implemented, channels can be randomly assigned to calls [2]. Random allocation can be summarized as followed:…”
Section: A Random Allocationmentioning
confidence: 99%