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: A distributed game based channel allocation (GBCA) Algorithm is proposed by taking into account both network topology and routing information and it is proved that there exists at least one Nash Equilibrium for the problem.
Abstract: In this paper, multi-channel allocation in wireless sensor and actuator networks is formulated as an optimization problem which is NP-hard. In order to efficiently solve this problem, a distributed game based channel allocation (GBCA) Algorithm is proposed by taking into account both network topology and routing information. For both tree/forest routing and non-tree/forest routing scenarios, it is proved that there exists at least one Nash Equilibrium for the problem. Furthermore, the sub- optimality of Nash Equilibrium and the convergence of the Best Response dynamics are also analyzed. Simulation results demonstrate that GBCA significantly reduces the interference and dramatically improves the network performance in terms of delivery ratio, throughput, channel access delay, and energy consumption.
88 citations
••
08 Jun 1994TL;DR: A simple speed estimation is proposed and based on this estimate one can implement a number of dynamic channel allocation algorithms on such a hierarchical network which comprises cells of different sizes.
Abstract: The huge amount of handoffs generated by microcells creates a problem for the future PCN. To alleviate the problem, we propose a hierarchical cellular system which comprises cells of different sizes. Ideally, one would like to use large cells to serve high-mobility users. A challenging issue is to obtain a good estimate of the user speed. A simple speed estimation is proposed and based on this estimate one can implement a number of dynamic channel allocation algorithms on such a hierarchical network. A comparative study of these algorithms will be presented based on a detailed simulation model. >
88 citations
•
23 Jul 2010TL;DR: A novel fractional frequency reuse (FFR) scheme combined with interference suppression for orthogonal frequency division multiple access (OFDMA) networks, which are currently being considered in LTE-A and WiMAX IEEE 802.16m standardization processes is discussed.
Abstract: The downlink performance of cellular networks is known to be strongly limited by inter-cell interference. In order to mitigate this interference, a number of frequency reuse schemes have recently been proposed. This paper discusses a novel fractional frequency reuse (FFR) scheme combined with interference suppression for orthogonal frequency division multiple access (OFDMA) networks, which are currently being considered in LTE-A and WiMAX IEEE 802.16m standardization processes. We confine to the case of cell edge users and show that the novel FFR scheme improves the spectral efficiency by allowing one out-of-cell interference. Then the proposed subcarrier and rate allocation ensures interference exploitation by the mobile station (MS) which results in the reduction of power consumption at the base stations (BSs). Interestingly no inter-cell interference coordination but only a priori frequency planning is required in the proposed scheme.
88 citations
••
07 Nov 2002TL;DR: An analytical model for cellular networks with a combined adaptive bandwidth allocation and traffic-restriction mechanism is developed and two important quality-of-service (QoS) metrics, degradation ratio and upgrade/degrade frequency are derived.
Abstract: An analytical model is developed for cellular networks with a combined adaptive bandwidth allocation and traffic-restriction mechanism. Instead of focusing only on the bandwidth utilization and forced-termination probability, we derive two important quality-of-service (QoS) metrics, degradation ratio and upgrade/degrade frequency. We show numerically that these two metrics must be taken into account in order to support the QoS specified by each client. The effects of system loads and clients' mobility on system performance are also investigated. Even under the various distributions of mobility, the simulation results are shown to match our analytical results, implying the applicability of our analytical model to more general cases.
88 citations
••
TL;DR: A novel approach to solving the dynamic channel assignment (DCA) problem by using a form of realtime reinforcement learning known as Q-learning in conjunction with neural network representation, capable of achieving a performance similar to that achieved by the MAXIAVIAL, but with a significantly reduced computational complexity.
Abstract: One of the fundamental issues in the operation of a mobile communication system is the assignment of channels to cells and to calls. This paper presents a novel approach to solving the dynamic channel assignment (DCA) problem by using a form of real-time reinforcement learning known as Q-learning in conjunction with neural network representation. Instead of relying on a known teacher the system is designed to learn an optimal channel assignment policy by directly interacting with the mobile communication environment. The performance of the Q-learning based DCA was examined by extensive simulation studies on a 49-cell mobile communication system under various conditions. Comparative studies with the fixed channel assignment (FCA) scheme and one of the best dynamic channel assignment strategies, MAXAVAIL, have revealed that the proposed approach is able to perform better than the FCA in various situations and capable of achieving a performance similar to that achieved by the MAXAVAIL, but with a significantly reduced computational complexity.
88 citations