scispace - formally typeset
Search or ask a question
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
More filters
Proceedings ArticleDOI
03 Apr 2006
TL;DR: A new fully distributed and self-managed channel selection algorithm is introduced that does not require direct communication between APs nor explicit estimation of the network interference graph, and is guaranteed to convergence under a wide range of network conditions and topologies.
Abstract: In this paper we consider the problem of a wireless LAN selecting a channel to minimise interference with other WLANs. We focus on interfering infrastructure-mode networks, where each access point (AP) or base station has a wired backhaul link. We introduce a new fully distributed and self-managed channel selection algorithm that does not require direct communication between APs nor explicit estimation of the network interference graph. The sole information required by the algorithm is feedback to each WLAN on the presence of interference on a chosen channel; such feedback is already commonly provided by WLAN protocols such as 802.11. We establish that convergence of the distributed algorithm is guaranteed provided that the channel selection problem is feasible. Extensive simulation results are presented that demonstrate rapid convergence under a wide range of network conditions and topologies. While the scope of the present paper is confined to infrastructure networks with static topology, the utility of the proposed algorithm in situations where the network topology is time-varying is briefly discussed.

128 citations

Proceedings ArticleDOI
01 Sep 2010
TL;DR: FlashLinQ leverages the fine-grained parallel channel access offered by OFDM and incorporates an analog energy-level-based signaling scheme that enables signal-to-interference ratio (SIR)-based distributed scheduling, leading to significant gains over a CSMA/CA system using RTS/CTS.
Abstract: This paper proposes FlashLinQ - a synchronous peer-to-peer wireless PHY/MAC network architecture for distributed channel allocation. By leveraging the fine-grained parallel channel access of OFDM, FlashLinQ develops an analog energy-level based signaling scheme that enables SIR (Signal to Interference Ratio) based distributed scheduling. This new signaling mechanism and the corresponding allocation algorithms permit efficient channel-aware spatial resource allocation, leading to significant gains over a CSMA/CA system with RTS/CTS. FlashLinQ is a complete system architecture including (i) timing and frequency synchronization derived from cellular spectrum, (ii) peer discovery, (iii) link management, and (iv) channelaware distributed power, data-rate and link scheduling. We implement FlashLinQ over licensed spectrum on a DSP/FPGA platform. In this paper, we present performance results for FlashLinQ using both implementation and simulations.

128 citations

Patent
08 May 2002
TL;DR: In this paper, a channel swapping mechanism was proposed to improve the dynamic frequency selection (DFS) algorithm used in wireless LANs by adding a swapping mechanism to avoid the problem of sub-optimal channel selection.
Abstract: The present invention enhances the dynamic frequency selection 9DFS) algorithms used in Wireless LANs by adding a channel swapping mechanism. The aim of the traditional DFS algorithm is to dynamically select channels in a wireless LAN in such a way that the best performance is achieved. However, not always the optimal channel selection is achieved. This invention describes an addition to the DFS algorithm in such a way that two APs can decide to swap channels instead of one AP switching to another channel. To avoid the problem of sub-optimal channel selection, a requesting AP sends Swap Requests to other APs in order to sense the willingness of other APs to swap channels with the requesting AP.

127 citations

Journal ArticleDOI
Guokai Zeng1, Bo Wang1, Yong Ding1, Li Xiao1, Matt W. Mutka1 
TL;DR: Simulations show that those algorithms greatly outperform the single-channel multicast algorithm, and observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.
Abstract: The wireless mesh network is an emerging technology that provides high quality service to end users as the "last milerdquo of the Internet. Furthermore, multicast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes. However, unlike other wireless networks, such as sensor networks and MANETs, where multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, wireless mesh networks need to maximize throughput. This paper proposes two multicast algorithms: the level channel assignment (LCA) algorithm and the multichannel multicast (MCM) to improve the throughput for multichannel and multi-interface mesh networks. The algorithms build efficient multicast trees by minimizing the number of relay nodes and total hop count distances of the trees. The algorithms use dedicated channel assignment strategies to reduce the interference to improve the network capacity. We also demonstrate that using partially overlapping channels can further diminish the interference. Furthermore, additional interfaces help to increase the bandwidth, and multiple gateways can further shorten the total hop count distance. Simulations show that those algorithms greatly outperform the single-channel multicast algorithm. We also observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.

127 citations

Journal ArticleDOI
TL;DR: This paper presents a proposed time fair CSMA (TFCSMA) which utilizes an interesting baseline property for estimating a target throughput for each competing station so that its minimum contention window could be adjusted in a distributed manner and is ideally suited for practical scenarios where stations frequently adapt their data rates to changing channel conditions.
Abstract: Under a multirate network scenario, the IEEE 802.11 DCF MAC fails to provide airtime fairness for all competing stations since the protocol is designed for ensuring max-min throughput fairness. As such, the maximum achievable throughput by any station gets bounded by the slowest transmitting peer. In this paper, we present an analytical model to study the delay and throughput characteristics of such networks so that the rate anomaly problem of IEEE DCF multirate networks could be mitigated. We call our proposal time fair CSMA (TFCSMA) which utilizes an interesting baseline property for estimating a target throughput for each competing station so that its minimum contention window could be adjusted in a distributed manner. As opposed to the previous work in this area, TFCSMA is ideally suited for practical scenarios where stations frequently adapt their data rates to changing channel conditions. In addition, TFCSMA also accounts for packet errors due to the time varying properties of the wireless channel. We thoroughly compare the performance of our proposed protocol with IEEE 802.11 and other existing protocols under different network scenarios and traffic conditions. Our comprehensive simulations validate the efficacy of our method toward providing high throughput and time fair channel allocation.

126 citations


Network Information
Related Topics (5)
Wireless network
122.5K papers, 2.1M citations
95% related
Wireless ad hoc network
49K papers, 1.1M citations
94% related
Network packet
159.7K papers, 2.2M citations
94% related
Wireless
133.4K papers, 1.9M citations
92% related
Fading
55.4K papers, 1M citations
91% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202315
202259
2021181
2020268
2019293
2018292