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
25 May 2007
TL;DR: This work designs a dynamic channel assignment algorithm for IEEE 802.11 wireless networks that assigns channels dynamically in a way that minimizes channel interference generated by neighboring access points (APs) on a reference access point, resulting in higher throughput.
Abstract: We design a dynamic channel assignment algorithm for IEEE 802.11 wireless networks. Our algorithm assigns channels dynamically in a way that minimizes channel interference generated by neighboring access points (APs) on a reference access point, resulting in higher throughput. We implement and simulate our algorithm using two versions (I: pick rand and II: pick first) and different number of APs (4, 9, 16, and 25). Analysis of our algorithm shows an improvement by a factor of 4 (by lowering the total interference on an AP by 6 dBm on average) over default settings of having all APs use the same channel. As the number of APs is increased in a given service area, dynamic channel assignment becomes crucial; otherwise overlapping channel interference becomes a limiting factor.
87 citations
10 Apr 2011
TL;DR: This paper model the radio spectrum allocation problem as a sealed-bid reserve auction, and proposes SMALL, which is a Strategy-proof Mechanism for radio spectrum ALLocation, and extends it to adapt to multi-radio spectrum buyers, which can bid for more than one radio.
Abstract: With the growing deployment of wireless communication technologies, radio spectrum is becoming a scarce resource. Thus mechanisms to efficiently allocate the available spectrum are of interest. In this paper, we model the radio spectrum allocation problem as a sealed-bid reserve auction, and propose SMALL, which is a Strategy-proof Mechanism for radio spectrum ALLocation. Furthermore, we extend SMALL to adapt to multi-radio spectrum buyers, which can bid for more than one radio.
87 citations
TL;DR: A channel-aware scheduling algorithm conceived for a point-to-multipoint WiMAX architecture that aims at enabling downlink traffic delivery with differentiated service treatment, even in nonideal channel conditions is proposed.
Abstract: In the last few years, standardization activities within the IEEE 802.16 Working Group have resulted in the publication of specifications for an air interface of Fixed broadband wireless access systems. WiMAX is the commercial name of products compliant with the approved IEEE 802.16 standard. Although the standard suggests the main principles in designing a QoS architecture to support multimedia broadband services, implementation details are left to manufacturers. This article addresses a channel-aware scheduling algorithm conceived for a point-to-multipoint WiMAX architecture. It aims at enabling downlink traffic delivery with differentiated service treatment, even in nonideal channel conditions. A technique to compensate for channel errors is proposed to preserve QoS and fairness of a WF2Q+ based scheduling algorithm. The performance behavior of the proposed algorithm is confirmed by the outputs of a comprehensive simulation campaign.
87 citations
20 Mar 2003
TL;DR: Simulations show that the proposed dynamic resource allocation scheme for OFDMA-based wireless broadband networks yields significant lower outage probability and higher throughput than existing multiple access methods.
Abstract: This paper presents a dynamic resource allocation scheme for OFDMA-based wireless broadband networks. The problem of maximizing the total packet throughput subject to individual user's outage probability constraint is formulated. The proposed algorithm assumes a finite buffer for the arrival packets and dynamically allocates the radio resource based on users' channel characteristics, traffic patterns and QoS requirements. By performing the radio resource allocation into two steps, namely bandwidth allocation and channel assignment, efficient admission control is realized with low complexity. Specifically, the number of channels to be assigned to each user is first determined based on its traffic requirement and the average SNR. The second stage of the algorithm finds the best channel allocation for the users. Simulations show that the algorithm yields significant lower outage probability and higher throughput than existing multiple access methods.
86 citations
TL;DR: The results show that the use of channel bonding can provide significant performance gains, even in scenarios with a high density of WLANs, although it may also cause unfair situations in which some W LANs receive most of the transmission opportunities while others starve.
Abstract: Next-generation wireless local area networks (WLANs) will support the use of wider channels, which is known as channel bonding, to achieve higher throughput. However, because both the channel center frequency and the channel width are autonomously selected by each WLAN, the use of wider channels may also increase the competition with other WLANs operating in the same area for the available channel resources. In this paper, we analyze the interactions between a group of neighboring WLANs that use channel bonding and evaluate the impact of those interactions on the achievable throughput. A continuous-time Markov network model that is able to capture the coupled dynamics of a group of overlapping WLANs is introduced and validated. The results show that the use of channel bonding can provide significant performance gains, even in scenarios with a high density of WLANs, although it may also cause unfair situations in which some WLANs receive most of the transmission opportunities while others starve.
86 citations