Weighted conflict-aware channel assignment in 802.11-based mesh networks

Lee, Changryeol; Shin, Donghoon; Choi, Sunghee

doi:10.1109/icact.2016.7423399

Cited by 3 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, because their model simply regards a pair of two links with 2-hop distance as a hidden terminal, the effect is quite limited. Lee, et al [13] proposed a channel assignment scheme considering the interference, hidden terminals, and exposed terminals. Their optimization is based on a weighted conflict graph in which 2-hop and 3-hop link pairs have higher weight than neighboring link pairs to care the hidden terminal effect.…”

Section: Related Workmentioning

confidence: 99%

Achieving Hidden-Terminal-Free Channel Assignment in IEEE802.11-Based Multi-Radio Multi-Channel Wireless Mesh Networks

Tian

Noi

Yoshihiro

2021

IEICE Trans. Commun.

View full text Add to dashboard Cite

Wireless Mesh Networks (WMNs) are often designed on IEEE 802.11 standards and are being widely studied due to their adaptability in practical network scenarios, where the overall performance has been improved by the use of the Multi-Radio and Multi-Channel (MRMC) configuration. However, because of the limitation on the number of available orthogonal channels and radios on each router, the network still suffers from low throughput due to packet collisions. Many studies have demonstrated that the optimized channel assignment to radio interfaces so as to avoid interference among wireless links is an effective solution. However, no existing channel assignment scheme can achieve hidden-terminal-free transmission and thus avoid communication performance degradation given the limited number of orthogonal channels. In this paper, we propose a new static channel assignment scheme CASCA (CSMA-aware Static Channel Assignment) based on a Partial MAX-SAT formulation of the channel assignment problem that incorporates a CSMA-aware interference model. The evaluation results show that CASCA achieves hidden-terminal-freedom in both grid and random topology networks with 3-4 orthogonal channels with preservation of network connectivity. In addition, the network simulation results show that CASCA presents good communication performance with low MAC-layer collision rate.

show abstract

Section: Related Workmentioning

confidence: 99%

Achieving Hidden-Terminal-Free Channel Assignment in IEEE802.11-Based Multi-Radio Multi-Channel Wireless Mesh Networks

Tian

Noi

Yoshihiro

2021

IEICE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…The preliminary version of this paper was presented at the 18th International Conference on Advanced Communications Technology [1]. communications, resulting in a significant degradation of network performance.…”

Section: Introductionmentioning

confidence: 99%

“…Supported by theoretical guarantees, we validate the performance of the proposed algorithm through simulations. This paper is the extended version of the preliminary paper [1]. The expansion encompasses a thorough proof of the NPhardness of the given problem, incorporating hop distance rather than Euclidean distance for conflict graphs and presenting extensive simulation results along with a study of parameters.…”

Section: Introductionmentioning

confidence: 99%

A Conflict-Aware Channel Assignment in Multi-Radio Multi-Channel Wireless Mesh Networks

Shin,

Lee,

Choi

2024

IEEE Access

View full text Add to dashboard Cite

This paper proposes a theoretical model-driven channel assignment scheme designed to enhance network performance in multi-radio multi-channel wireless mesh networks. Unlike previous conflict graph-based channel assignments that addressed co-channel interference and hidden terminal problems while overlooking an exposed terminal problem, our proposed approach integrates these problems comprehensively to mitigate network performance degradation. Given a communication graph, we establish a conflict graph based on hop distance for practical implementation. The weighted conflict graph is constructed by analyzing packet collision conditions under the IEEE 802.11 standard with the CSMA/CA protocol, considering not only the transmission range and interference range but also the carrier sensing range simultaneously. Given a weighted conflict graph and available channel lists on each router, we devise a Weighted Soft List Coloring problem to address the channel assignment challenge. We prove the NP-hardness of this problem by establishing its dual problem, Max list-Cut. We present an approximation algorithm with worst-case performance at most twice the optimal solution while preserving network topology. We substantiate the performance of the proposed channel assignment algorithm through simulations in various topologies. The proposed algorithm, on average, demonstrates a network throughput increase of 162% and 174% compared to the greedy heuristic algorithm with 3 channels and 12 channels, respectively.INDEX TERMS Channel assignment in IEEE 802.11 networks, multi-radio and multi-channel, weighted soft list coloring problem, Max list-Cut problem, approximation algorithm.

show abstract

FMHT: A Novel Framework for Mitigating Hidden Terminal Issue in Wireless Mesh Network

Naveen

Vasanth²

2018

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Weighted conflict-aware channel assignment in 802.11-based mesh networks

Cited by 3 publications

References 9 publications

Achieving Hidden-Terminal-Free Channel Assignment in IEEE802.11-Based Multi-Radio Multi-Channel Wireless Mesh Networks

Achieving Hidden-Terminal-Free Channel Assignment in IEEE802.11-Based Multi-Radio Multi-Channel Wireless Mesh Networks

A Conflict-Aware Channel Assignment in Multi-Radio Multi-Channel Wireless Mesh Networks

FMHT: A Novel Framework for Mitigating Hidden Terminal Issue in Wireless Mesh Network

Contact Info

Product

Resources

About