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: The results indicate that with reasonable signaling overhead, the RRC protocol and the associated algorithms yield excellent performance for both real-time and non real- time services, even under fast fading.
Abstract: This paper presents a radio resource control (RRC) scheme for OFDMA systems where dynamic resource allocation is realized at both a radio network controller (RNC) and base stations (BSs). The scheme is semi-distributed in the sense that the RRC decision is split between RNC and BSs. RNC makes decision on which channel is used by which BS at super-frame level and BSs then make decision on which user is assigned to which channel at frame-level. Two optimization problems for RNC and BSs are formulated and computationally efficient algorithms that perform the function of interference avoidance and traffic/channel adaptation are developed. Numerical analysis is performed under several cell configurations to show tradeoffs between sector interference suppression and dynamic interference avoidance. The results indicate that with reasonable signaling overhead, the protocol and the associated algorithms yield excellent performance for both real-time and non real-time services, even under fast fading

314 citations

Proceedings ArticleDOI
Javad Abdoli1, Ming Jia1, Jianglei Ma1
31 Aug 2015
TL;DR: A spectrally-localized waveform is proposed based on filtered orthogonal frequency division multiplexing (f-OFDM) that can achieve a desirable frequency localization for bandwidths as narrow as a few tens of subcarriers, while keeping the inter-symbol interference/inter-carrier interference (ISI/ICI) within an acceptable limit.
Abstract: A spectrally-localized waveform is proposed based on filtered orthogonal frequency division multiplexing (f-OFDM). By allowing the filter length to exceed the cyclic prefix (CP) length of OFDM and designing the filter appropriately, the proposed f-OFDM waveform can achieve a desirable frequency localization for bandwidths as narrow as a few tens of subcarriers, while keeping the inter-symbol interference/inter-carrier interference (ISI/ICI) within an acceptable limit. Enabled by the proposed f-OFDM, an asynchronous filtered orthogonal frequency division multiple access (f-OFDMA)/filtered discrete-Fourier transform-spread OFDMA (f-DFT-S-OFDMA) scheme is introduced, which uses the spectrum shaping filter at each transmitter for side lobe leakage elimination and a bank of filters at the receiver for inter-user interference rejection. Per-user downsampling and short fast Fourier transform (FFT) are used at the receiver to ensure a reasonable complexity of implementation. The proposed scheme removes the inter-user time-synchronization overhead required in the synchronous OFDMA/DFT-S-OFDMA. The performance of the asynchronous f-OFDMA is evaluated and compared with that of the universal-filtered OFDM (UF-OFDM), proposed in [1], [2].

314 citations

Journal ArticleDOI
TL;DR: This work proposes a gradient-based scheduling framework for OFDM scheduling that has prohibitively high computational complexity but reveals guiding principles that are used to generate lower complexity sub-optimal algorithms.
Abstract: Orthogonal frequency division multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (long term evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations.

311 citations

Proceedings ArticleDOI
25 Nov 2001
TL;DR: Targeted at multi-hop wireless sensor networks, a set of low power MAC design principles have been proposed, and a novel ultra-low power MAC is designed to be distributed in nature to support scalability, survivability and adaptability requirements.
Abstract: Targeted at multi-hop wireless sensor networks, a set of low power MAC design principles have been proposed, and a novel ultra-low power MAC is designed to be distributed in nature to support scalability, survivability and adaptability requirements. Simple CSMA and spread spectrum techniques are combined to trade off bandwidth and power efficiency. A distributed algorithm is used to do dynamic channel assignment. A novel wake-up radio scheme is incorporated to take advantage of new radio technologies. The notion of mobility awareness is introduced into an adaptive protocol to reduce network maintenance overhead. The resulting protocol shows much higher power efficiency for typical sensor network applications.

305 citations

Journal ArticleDOI
TL;DR: This paper forms the energy-efficient resource allocation problem in heterogeneous cognitive radio networks with femtocells as a Stackelberg game and proposes a gradient based iteration algorithm to obtain the StACkelberg equilibrium solution.
Abstract: Both cognitive radio and femtocell have been considered as promising techniques in wireless networks. However, most of previous works are focused on spectrum sharing and interference avoidance, and the energy efficiency aspect is largely ignored. In this paper, we study the energy efficiency aspect of spectrum sharing and power allocation in heterogeneous cognitive radio networks with femtocells. To fully exploit the cognitive capability, we consider a wireless network architecture in which both the macrocell and the femtocell have the cognitive capability. We formulate the energy-efficient resource allocation problem in heterogeneous cognitive radio networks with femtocells as a Stackelberg game. A gradient based iteration algorithm is proposed to obtain the Stackelberg equilibrium solution to the energy-efficient resource allocation problem. Simulation results are presented to demonstrate the Stackelberg equilibrium is obtained by the proposed iteration algorithm and energy efficiency can be improved significantly in the proposed scheme.

304 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