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 published on a yearly basis
Papers
More filters
TL;DR: This article considers optimization of the set of collaborative relays and link asymmetries together with subcarrier and power allocation and solves each sub-problem in an asymptotically optimal and alternating manner.
Abstract: This paper addresses the resource allocation problem in collaborative relay-assisted OFDMA networks. Recent works on the subject usually ignored either the selection of relays, asymmetry of the source-to-relay and relay-to-destination links or the imperfections of channel state information. In this article we take into account all these together and our focus is two-fold. Firstly, we consider the problem of asymmetric radio resource allocation, where the objective is to maximize the system throughput of the source-to-destination link under various constraints. In particular, we consider optimization of the set of collaborative relays and link asymmetries together with subcarrier and power allocation. Using a dual approach, we solve each sub-problem in an asymptotically optimal and alternating manner. Secondly, we pay attention to the effects of imperfections in the channel-state information needed in resource allocation decisions. We derive theoretical expressions for the solutions and illustrate them through simulations. The results validate clearly the additional performance gains through an asymmetric cooperative scheme compared to the other recently proposed resource allocation schemes.
48 citations
TL;DR: This paper proposes an effective dynamic spectrum access algorithm to improve the spectrum utilization and reliable communication in the multi-hop cognitive wireless network, and adopts the Pareto distribution to model their behaviors.
48 citations
10 Apr 2011
TL;DR: A polynomial-time algorithm based on continuity relaxation and dual minimization is proposed for jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system.
Abstract: We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system. The optimization objective is to maximize the weighted sum-rate under total and individual power constraints on the transmitters. By observing the special structure of a three-dimensional assignment problem derived from the original problem, we propose a polynomial-time algorithm based on continuity relaxation and dual minimization. The proposed method is shown to be optimal for all relaying strategies that give a concave rate function in terms of power constraints.
47 citations
14 Jun 1992
TL;DR: The authors determine the blocking performance of channel allocation algorithms where every channel is available for use in every cell and where decisions are made by mobiles based only on local observations and suggest that an aggressive algorithm could provide substantially reduced blocking.
Abstract: The authors determine the blocking performance of channel allocation algorithms where every channel is available for use in every cell and where decisions are made by mobiles based only on local observations. Using a novel Erlang-B approximation method, together with simulation, they demonstrate that even the simplest algorithm, the timid, compares favorably with impractical, centrally administered fixed channel allocation. The results suggest that an aggressive algorithm, that is, one requiring call reconfigurations, could provide substantially reduced blocking. Practical algorithms are presented that take major steps toward achieving the excellent performance of the best aggressive algorithm but that have the stability of the timid algorithm. >
47 citations
TL;DR: This paper investigates the computation offloading problem in a hierarchical network architecture, and proposes a scheme of joint channel allocation and resource management, named JCRM, to make offloading decisions and maximize the long-term network utility with considering stochastic task arrival/dispatch and dynamic changes in available resources.
Abstract: To accommodate ever-increasing computational workloads while satisfying the requirements of delay-sensitive tasks, mobile edge computing (MEC) is proposed to offload the tasks to nearby edge servers. Nevertheless, it can introduce new technical issues in terms of transmission and computation overheads affected by the underlying offloading decisions. In this paper, we investigate the computation offloading problem in a hierarchical network architecture, where tasks can be offloaded to nearby micro-BS and further forwarded to macro-BS equipped with an MEC server. Specifically, we propose a scheme of joint channel allocation and resource management, named JCRM, to make offloading decisions and maximize the long-term network utility with considering stochastic task arrival/dispatch and dynamic changes in available resources. As the formulated utility maximization problem is a mixed-integer non-linear stochastic programming problem that is directly intractable, we, therefore, leverage the Lyapunov optimization technique to decouple the original problem into three separate sub-problems. Based on the solutions to those sub-problems, our proposed scheme can make optimal offloading-downloading decisions with maximizing the overall task offloading rate. Finally, we verify the long-term network stability and near-optimal performance of JCRM via both theoretical analysis and extensive simulations.
47 citations