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: Two different adaptive subcarrier allocation algorithms are proposed and analyzed and their aim is to share the network bandwidth among users on the basis of specific channel conditions without loosing bandwidth efficiency and fairness.
Abstract: WiMax is one of the most important technologies for providing a broadband wireless access (BWA) in a metropolitan area. The use of OFDM transmissions has been proposed to reduce the effect of multipath fading in wireless communications. Moreover, multiple access is achieved by resorting to the OFDMA scheme. Adaptive subcarrier allocation techniques have been selected to exploit the multiuser diversity, leading to an improvement of performance by assigning subchannels to the users accordingly with their channel conditions. A method to allocate subcarriers is to assign almost an equal bandwidth to all users (fair allocation). However, it is well known that this method limits the bandwidth efficiency of the system. In order to lower this drawback, in this paper, two different adaptive subcarrier allocation algorithms are proposed and analyzed. Their aim is to share the network bandwidth among users on the basis of specific channel conditions without loosing bandwidth efficiency and fairness. Performance comparisons with the static and the fair allocation approaches are presented in terms of bit error rate and throughput to highlight the better behavior of the proposed schemes in particular when users have different distances from the BS.
71 citations
Patent•
24 Mar 2008
TL;DR: In this paper, the authors propose techniques for bandwidth allocation in communication systems such as OFDM, OFDMA, or SC-FDMA systems to improve spectral efficiency and increase flexibility and adaptability with scalable single or multiple-carrier bandwidth allocation characteristics.
Abstract: Techniques for bandwidth allocation in communication systems such as OFDM, OFDMA, or SC-FDMA systems to improve spectral efficiency and increase flexibility and adaptability with scalable single or multiple-carrier bandwidth allocation characteristics.
70 citations
TL;DR: Numerical results demonstrate that the proposed greedy algorithm can achieve close-to-optimal performance and that the heuristic algorithm provides good performance, even though it is inferior than that of the greedy, with much lower complexity.
Abstract: In this paper, we present a framework for resource allocations for multicast device-to-device (D2D) communications underlaying the uplink of a Long-Term Evolution (LTE) network. The objective is to maximize the sum throughput of active cellular users (CUs) and feasible D2D multicast groups in a cell, while meeting a certain signal-to-interference-plus-noise ratio (SINR) constraint for both the CUs and the D2D groups. We formulate the general problem of power and channel allocation as a mixed integer nonlinear programming (MINLP) problem, where one D2D group can reuse the channels of multiple CUs and where the channel of each CU can be reused by multiple D2D groups. Distinct from existing approaches in the literature, our formulation and solution methods provide an effective and flexible means to utilize radio resources in cellular networks and share them with multicast groups without causing harmful interference to each other. The MINLP problem is transformed so that it can be solved optimally by a variant of the generalized Bender decomposition method with provable convergence. A greedy algorithm and a low-complexity heuristic solution are then devised. The performance of all schemes is evaluated through extensive simulations. Numerical results demonstrate that the proposed greedy algorithm can achieve close-to-optimal performance and that the heuristic algorithm provides good performance, even though it is inferior than that of the greedy, with much lower complexity.
70 citations
TL;DR: A novel mechanism which consists of a newly developed optimization approach, called basis transformation method, for the joint resource management, and a specially devised pricing scheme for the reward determination is proposed, which demonstrates its superiority in improving social welfare, network capacity, and utility of the BS.
Abstract: In this paper, a downlink cellular traffic offloading framework with social-aware device-to-device (D2D) content sharing and proactive caching is studied. In the considered system model, each user equipment (UE) is intelligent to determine which content(s) to request/cache and to share according to its own preference. As the central controller, the base station (BS) can establish cellular transmissions and/or incentivize D2D communications for content dissemination (including proactive caching). By taking into account wireless features, social characteristics, and device intelligence, we formulate a welfare maximization problem integrating power control, channel allocation, link scheduling, and reward design. To solve this complicated problem, we propose a novel mechanism which consists of a newly developed optimization approach, called basis transformation method , for the joint resource management, and a specially devised pricing scheme for the reward determination. Theoretical and simulation results examine the desired properties of our proposed mechanism, and demonstrate its superiority in improving social welfare, network capacity, and utility of the BS.
70 citations
TL;DR: This paper shows that the GIRG always possesses a unique NE for a two-player version of the game, irrespective of any channel realization or initial system parameters such as power budgets and noise power, and derives explicitly a sufficient condition under which the NE achieves Pareto-optimality.
Abstract: This paper considers the multiuser power control problem in Gaussian frequency-flat interference relay channels using a game-theoretic framework. While a lot of attention has been paid to Gaussian interference games, where sufficient conditions for the uniqueness of the Nash equilibrium (NE) have been established, these types of games have not been studied in the context of interference relay channels. We consider here Gaussian interference relay games (GIRGs), where instead of allocating the power budget across a set of sub-channels, each player aims to decide the optimal power control strategy across a set of hops. We show that the GIRG always possesses a unique NE for a two-player version of the game, irrespective of any channel realization or initial system parameters such as power budgets and noise power. Furthermore, we derive explicitly a sufficient condition under which the NE achieves Pareto-optimality. To facilitate decentralized implementation, we propose a distributed and asynchronous algorithm. We also prove that the proposed algorithm always converges to the unique NE from an arbitrary starting point. We then conclude that the distributed game-theoretic approach exhibits great potential in the context of interference relay channels and qualifies as a practically appealing candidate for power control.
70 citations