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.

Energy-Efficient User Association and Resource Allocation for Multistream Carrier Aggregation

Abstract: Multistream carrier aggregation (MSCA) is a promising technique to boost data rates by enabling users to connect with multiple base stations (BSs) simultaneously. In this paper, we investigate joint user association and resource allocation for MSCA systems to achieve energy efficiency (EE) balance among different BSs. We aim at maximizing the weighted summation of EE values for different BSs, which is modeled as a nonconvex combinatorial sum-of-ratios optimization problem. To develop an upper bound algorithm, we first relax the combinatorial variables and then transform the problem into a series of convex optimization problems by the successive convex approximation (SCA) method. We also propose a low-complexity suboptimal algorithm, which divides the original optimization problem into two steps: user association and channel allocation, as well as power allocation. Numerical results show that the proposed algorithms can achieve flexible EE tradeoff among BSs, and the EE can be significantly improved with MSCA.

Distributed Learning Algorithms for Spectrum Sharing in Spatial Random Access Wireless Networks

Abstract: We consider distributed optimization over orthogonal collision channels in spatial random access networks. Users are spatially distributed and each user is in the interference range of a few other users. Each user is allowed to transmit over a subset of the shared channels with a certain attempt probability. We study both the non-cooperative and cooperative settings. In the former, the goal of each user is to maximize its own rate irrespective of the utilities of other users. In the latter, the goal is to achieve proportionally fair rates among users. Simple distributed learning algorithms are developed to solve these problems. The efficiencies of the proposed algorithms are demonstrated via both theoretical analysis and simulation results.

Cross-Tier Interference Mitigation for Two-Tier OFDMA Femtocell Networks with Limited Macrocell Information

Abstract: Femtocells that use co-channel allocation with macrocells can considerably increase wireless coverage and system capacity, especially for indoor and cell-edge users. However, the benefit is realized only when cross-tier interference between femtocells and macrocells is well managed. We propose a power allocation algorithm for femtocells in downlink OFDMA systems that effectively reduces cross-tier interference by considering the influence on neighboring macro mobile stations (MSs), when only limited channel information about those MSs is available. The use of the proposed scheme enables femtocells to maintain their high throughputs while significantly reducing the performance degradation of neighboring macro MSs, with only the information that is available to the femtocells in practice.

Automatic control channel planning in adaptive channel allocation systems

Abstract: Methods and systems for allocating control channels in a radiocommunication system are disclosed. Control channels are each linked to a dedicated traffic channels such that when the dedicated traffic channel is allocated to a particular cell, so is its respective control channel. Implementation according to the present invention is independent of the particular ACA scheme used to determine traffic channel allocation.

Opportunistic Cooperation via Relay Selection with Minimal Information Exchange

Abstract: Opportunistic cooperation is a technique where in each transmission the best relay (or k best relays) are chosen to assist. In a multiuser cooperative network, coordinating the cooperating users requires exchange of channel information between various nodes. As the number of nodes increases, this information exchange can get out of hand. In this work, we propose an opportunistic cooperation technique where at most two bits of information per relay are exchanged for each cooperation period (one bit feedback and one bit feedforward). Our method does not need any carrier sensing technique or any information regarding source-relay channels for its operation. We show that this frugal technique is capable of achieving the same diversity-multiplexing tradeoff (DMT) achieved by distributed space-time-coded cooperation protocols (DSTC) in Laneman and Wornell (2003). Also we show how bandwidth allocation between a user and its partner affects the diversity-multiplexing tradeoff.