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.

Spectrum Sharing in Cognitive Radio Networks

Abstract: In this paper, we present a novel joint power/channel allocation scheme that uses a distributed pricing strategy to improve the network's performance. According to this scheme, the spectrum allocation problem is modeled as a non-cooperative game. A price-based iterative water-filling (PIWF) algorithm is proposed, which allows users to converge to the Nash Equilibrium (NE). This PIWF algorithm can be implemented distributively, with CRs repeatedly negotiating their best transmission powers and spectrum. We propose a protocol that implements our price- based resource allocation algorithm. The proposed MAC protocol allows multiple CR pairs to first contend through an admission phase, and then to iteratively negotiate their transmission powers and spectrum via control-packet exchanges. Subsequently, CRs proceed concurrently with their data transmissions. Simulations are used to study the performance of our protocol and demonstrate its effectiveness in improving the overall network throughput and reducing the average transmission power.

A Deep Reinforcement Learning-Based Framework for Dynamic Resource Allocation in Multibeam Satellite Systems

Abstract: Dynamic resource allocation (DRA) is the key technology to improve the network performance in resource-limited multibeam satellite (MBS) systems. The aim is to find a policy that maximizes the expected long-term resource utilization. Existing iterative metaheuristics DRA optimization algorithms are not practical due to the high computational complexity. To solve the problem of unknown dynamics and prohibitive computation, a deep reinforcement learning-based framework (DRLF) is proposed for DRA problems in MBS systems. A novel image-like tensor reformulation on the system environments is adopted to extract traffic spatial and temporal features. A use case of dynamic channel allocation in DRLF is simulated and shows the effectiveness of the proposed DRLF in time-varying scenarios.

An analysis of statistical multiplexing in an ATM transport network

Abstract: The traffic characteristics of an asynchronous transfer mode (ATM) network are analyzed by theoretical methods. A new method is proposed to express the burstiness of the cell arrival process. Both statistical multiplexing and statistical bandwidth allocation are quantitatively evaluated. When packetized video traffic and voice traffic are multiplexed, the number of multiplexable sources strongly depends on the peak bit rate of the multiplexed video sources, and statistical bandwidth allocation is ineffective without control. On the other hand, lowering the peak bit rate of video traffic effectively improves bandwidth utilization. >

Optimal Resource Allocation for Multiuser MIMO-OFDM Systems With User Rate Constraints

Abstract: With the proliferation of wireless services, personal connectivity is quickly becoming ubiquitous. As the user population demands greater multimedia interactivity, data rate requirements are set to soar. Future wireless systems, e.g., multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM), need to cater to not only a burgeoning subscriber pool but also to a higher throughput per user. Furthermore, resource allocation for multiuser MIMO-OFDM systems is vital for the optimization of the subcarrier and power allocations to improve overall system performance. Using convex optimization techniques, this paper proposes an efficient solution to minimize the total transmit power subject to each user's data rate requirement. Using a Lagrangian dual decomposition, the complexity is reduced from one that is exponential in the number of subcarriers M to one that is only linear in M. To keep the complexity low, linear beamforming is incorporated at both the transmitter and the receiver. Although frequency-flat fading has been known to plague OFDM resource allocation systems, a modification, i.e., dual proportional fairness, seamlessly handles flat or partially frequency-selective fading. Due to the nonconvexity of the optimization problem, the proposed solution is not guaranteed to be optimal. However, for a realistic number of subcarriers, the duality gap is practically zero, and optimal resource allocation can be evaluated efficiently. Simulation results show large performance gains over a fixed subcarrier allocation.

On the Performance Analysis of Network-Coded Cooperation in Wireless Networks

Abstract: In this letter, a network-coded cooperation scheme with dynamic coding mechanism (DC-NCC) is proposed. In DC-NCC, the relay dynamically adapts forming the network-coded data based on the observed instantaneous source-to-relay channel quality, and then forwards the network-coded data towards corresponding destinations. Under the assumption (denoted as A) that each destination can reliably overhear the data from other sources, the diversity-multiplexing tradeoff of DC-NCC is proved to outperform that of conventional cooperation (CC), This verifies that DC-NCC outperforms CC in bandwidth efficiency. Moreover, DC-NCC offers reduced system outage probability and single-pair outage probability compared with CC, and achieves the same full diversity order as CC at high signal-to-noise ratio (SNR). Numerical results also show that with dynamic coding, DC-NCC avoids unnecessary error propagation which can be caused by coding those erroneous data into network-coded data. Finally the performance of DC-NCC is discussed in case the assumption A is removed. For a wireless network composed of N source-destination (s-d) pairs and a single relay node, although there is a certain outage probability increase for each s-d pair, DC-NCC still achieves a diversity-multiplexing tradeoff superior to CC.