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
23 Dec 2010
TL;DR: The proposed resource scheduling combined with channel sensing can effectively manage the heterogeneous interference problem and is verified by computer simulation.
Abstract: In this paper, we consider resource allocation in femtocell networks to maximize the throughput while minimizing interference to macro-cell users nearby. This can be achieved by dynamically allocating the spectrum resource in a cognitive radio way of avoiding the use of spectrum resources occupied by macro-users nearby. The proposed scheme comprises two steps; channel sensing and resource scheduling. The femto base station detects the channel occupation by estimating the energy in sub-channels in a group-wise manner and then allocates sub-channels with the lowest interference signature to femto-users. The proposed resource scheduling combined with channel sensing can effectively manage the heterogeneous interference problem. Finally, the effectiveness of the proposed scheme is verified by computer simulation.
49 citations
Patent•
13 Sep 2016
TL;DR: In this article, the authors present a system and methods for selecting available channels free of radar signals from a plurality of 5 GHz radio frequency channels, which can facilitate false detections and/or network downtime in exemplary mesh networks employing dynamic frequency selection (DFS) channels.
Abstract: The present invention relates to wireless networks and more specifically to systems and methods for selecting available channels free of radar signals from a plurality of 5 GHz radio frequency channels. In non-limiting embodiments, exemplary systems, methods, and apparatuses are provided that can facilitate reducing false detections and/or network downtime in exemplary mesh networks employing dynamic frequency selection (DFS) channels. In a non-limiting aspect, radar information can be propagated among exemplary mesh nodes, including location information, to facilitate reducing false detections and/or network downtime in exemplary mesh networks. In addition, in further non-limiting aspects, exemplary embodiments can transmit signals to facilitate silencing one or more DFS channels and/or collaborative mesh node identification and/or discrimination of radar signals and false detections, among other non-limiting aspects provided.
49 citations
TL;DR: Simulation results demonstrate that the proposed dynamic genetic algorithms based on the new sophisticated crossover and mutation operators ensure the validity of channels and the fast convergence to the best solution in a highly dynamic environment.
Abstract: This paper presents the problem formulation, development, and use of a robust dynamic genetic algorithm (GA) for channel allocation in cognitive radio. This approach offers an efficient way to access available spectrum for both primary and secondary users. The proposed dynamic genetic algorithms based on the new sophisticated crossover and mutation operators ensure the validity of channels and the fast convergence to the best solution in a highly dynamic environment. Compared with existing methods, simulation results demonstrate that our approach algorithm produces satisfactory results with reduced network interference and enhance efficiently the spectrum throughput.
49 citations
TL;DR: This paper presents a time-aware admission control and resource allocation scheme in wireless networks in the context of a future generation cellular network that efficiently reduces the number of reallocations while remaining within a given utility bound.
Abstract: This paper presents a time-aware admission control and resource allocation scheme in wireless networks in the context of a future generation cellular network. The quality levels (and their respective utility) of different connections are specified using discrete resource-utility (R-U) functions. The scheme uses these R-U functions for allocating and reallocating bandwidth to connections, aiming to maximize the accumulated utility of the system. However, different applications react differently to resource reallocations. Therefore, at each allocation time point, the following factors are taken into account: the age of the connection, a disconnection (drop) penalty, and the sensitiveness to reallocation frequency. The evaluation of our approach shows a superior performance compared to a recent adaptive bandwidth allocation scheme (RBBS). In addition, we have studied the overhead that performing a reallocation imposes on the infrastructure. To minimize this overhead, we present an algorithm that efficiently reduces the number of reallocations while remaining within a given utility bound.
49 citations
TL;DR: This paper provides an overview of the CDMA-related QoS provisioning techniques in the avenues of packet scheduling, power allocation, and network coordination, summarizes state-of-the-art research results, and identifies further research issues.
Abstract: One of the major challenges in supporting multimedia services over Internet protocol (IP)-based code-division multiple-access (CDMA) wireless networks is the quality-of-service (QoS) provisioning with efficient resource utilization. Compared with the circuit-switched voice service in the second-generation CDMA systems (i.e., IS-95), heterogeneous multimedia applications in future IP-based CDMA networks require more complex QoS provisioning and more sophisticated management of the scarce radio resources. This paper provides an overview of the CDMA-related QoS provisioning techniques in the avenues of packet scheduling, power allocation, and network coordination, summarizes state-of-the-art research results, and identifies further research issues.
49 citations