scispace - formally typeset
Search or ask a question
Topic

Channel allocation schemes

About: Channel allocation schemes is a research topic. Over the lifetime, 10656 publications have been published within this topic receiving 182117 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This article provides a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes, and other important issues in resource allocation such as overlay cells, frequency planning, and power control.
Abstract: This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed/centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.

1,273 citations

Journal ArticleDOI
TL;DR: In order to derive upper performance bounds for transmitter power control schemes, algorithms that are optimum in the sense that the interference probability is minimized are suggested.
Abstract: Most cellular radio systems provide for the use of transmitter power control to reduce cochannel interference for a given channel allocation. Efficient interference management aims at achieving acceptable carrier-to-interference ratios in all active communication links in the system. Such schemes for the control of cochannel interference are investigated. The effect of adjacent channel interference is neglected. As a performance measure, the interference (outage) probability is used, i.e., the probability that a randomly chosen link is subject to excessive interference. In order to derive upper performance bounds for transmitter power control schemes, algorithms that are optimum in the sense that the interference probability is minimized are suggested. Numerical results indicate that these upper bounds exceed the performance of conventional systems by an order of magnitude regarding interference suppression and by a factor of 3 to 4 regarding the system capacity. The structure of the optimum algorithm shows that efficient power control and dynamic channel assignment algorithms are closely related. >

1,256 citations

Journal ArticleDOI
TL;DR: Compared to the direct transmission and traditional multihop protocols, the results reveal that optimum relay channel signaling can significantly outperform multihip protocols, and that power allocation has a significant impact on the performance.
Abstract: We consider three-node wireless relay channels in a Rayleigh-fading environment. Assuming transmitter channel state information (CSI), we study upper bounds and lower bounds on the outage capacity and the ergodic capacity. Our studies take into account practical constraints on the transmission/reception duplexing at the relay node and on the synchronization between the source node and the relay node. We also explore power allocation. Compared to the direct transmission and traditional multihop protocols, our results reveal that optimum relay channel signaling can significantly outperform multihop protocols, and that power allocation has a significant impact on the performance.

1,208 citations

Proceedings ArticleDOI
15 May 2000
TL;DR: A multiuser convex optimization problem is derived to find the optimal allocation of subchannels, and a low-complexity adaptive subchannel allocation algorithm is proposed that performs almost as well as the optimal solution.
Abstract: This paper investigates the problem of dynamic multiuser subchannel allocation in the downlink of OFDM systems. The assumptions are that the channel model is quasi-static and that the base station has perfect channel information. In traditional TDMA or FDMA systems, resource allocation for each user is non-adaptively fixed, and the water-filling power spectrum is known to be optimal. Since the subchannel allocations among the users are not optimized, a group of users is likely to suffer from poor channel gains resulting from large path loss and random fading. To resolve this problem, we derive a multiuser convex optimization problem to find the optimal allocation of subchannels, and propose a low-complexity adaptive subchannel allocation algorithm. Simulation results show that the proposed algorithm performs almost as well as the optimal solution. Also, a higher spectral efficiency is achieved for a larger number of users in a cell due to the multiuser diversity.

1,184 citations

Journal ArticleDOI
TL;DR: A set of proportional fairness constraints is imposed to assure that each user can achieve a required data rate, as in a system with quality of service guarantees, and a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed.
Abstract: Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless local area network (LAN) systems. The sum capacity of MU-OFDM is maximized when each subchannel is assigned to the user with the best channel-to-noise ratio for that subchannel, with power subsequently distributed by water-filling. However, fairness among the users cannot generally be achieved with such a scheme. In this paper, a set of proportional fairness constraints is imposed to assure that each user can achieve a required data rate, as in a system with quality of service guarantees. Since the optimal solution to the constrained fairness problem is extremely computationally complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. In the proposed algorithm, subchannel allocation is first performed by assuming an equal power distribution. An optimal power allocation algorithm then maximizes the sum capacity while maintaining proportional fairness. The proposed algorithm is shown to achieve about 95% of the optimal capacity in a two-user system, while reducing the complexity from exponential to linear in the number of subchannels. It is also shown that with the proposed resource allocation algorithm, the sum capacity is distributed more fairly and flexibly among users than the sum capacity maximization method.

1,084 citations


Network Information
Related Topics (5)
Wireless network
122.5K papers, 2.1M citations
95% related
Wireless ad hoc network
49K papers, 1.1M citations
94% related
Network packet
159.7K papers, 2.2M citations
94% related
Wireless
133.4K papers, 1.9M citations
92% related
Fading
55.4K papers, 1M citations
91% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202315
202259
2021181
2020268
2019293
2018292