Collision-Free Channel Assignment Is Possible in IEEE802.11-Based Wireless Mesh Networks

Yoshihiro, Takuya; Noi, Takahiro

doi:10.1109/wcnc.2017.7925889

Cited by 12 publications

(11 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, a significant progress is brought in CASCA [9], which introduces a new CSMA-aware interference model. The CSMA-aware model allows two links located within the carrier-sense range to use the same channel, whereas making two links that invoke hidden-terminal problem use different channels.…”

Section: Related Workmentioning

confidence: 99%

“…To achieve collision-free transmission on the commodity 802.11 hardware, accurate interference model is very important. In this paper, we use the CSMA-aware interference model introduced in CASCA [9]. The CSMA-aware interference model is built on top of the single disk model, in which both the communication range and the interference range are the same, and is denoted by R. Therefore, given the 2D coordination of nodes in V , link (u, v, q) ∈ E exists if the distance between nodes u and v is smaller than R, and both u and v have a NIC assigned with channel q.…”

Section: B Csma-aware Interference Modelmentioning

confidence: 99%

“…Yoshihiro et al [9] proposed the first collision-free static channel assignment CASCA (CSMA-Aware Static Channel Assignment) for MCMR WMNs within 3-5 orthogonal channels. CASCA introduces a CSMA-aware interference model which allows two links located within the carriersense range to share the same channel, whereas making two links that invoke hidden-terminal problem use different channels.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks

Tian

Yoshihiro

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: B Csma-aware Interference Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks

Tian

Yoshihiro

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…The election mechanism is an effective solution to avoid access collision and improve access efficiency. Compared with the distributed resource scheduling mechanism of IEEE802.11 protocol based on the competition [4] and the IEEE802.15.4 protocol based on the competition and reservation [5], the IEEE802.16 mechanism [6] based on elections and reservations can improve the resource utilization efficiency of the channel while reducing conflicts [7]. During the access process, due to direct channel occupancy, the competition mechanism has a severe collision and a low probability of success.…”

Section: A Motivationmentioning

confidence: 99%

Research on the Impact of Interaction Times in Distributed Wireless Ad Hoc Networks

Xin

2020

IEEE Access

View full text Add to dashboard Cite

The distributed wireless ad hoc network caters to users' demands for high reliability, low latency, and low cost. It has the characteristics of low operation and maintenance costs, strong scalability, no center, and self-organization, and has wide application prospects in 5G and industrial Internet of Things. The access process is a key process for the operation of distributed wireless ad hoc networks, which has a huge impact on its performance. The distributed election mechanism is an effective solution to avoid access collision and achieve efficient access. The number of interactions in the election mechanism will affect the amount of information obtained by the nodes, which will affect the performance of the network's election success probability, delay, and efficiency. When the number of interactions is small, the node obtains less information, and the collision and waste of time slots are serious, resulting in deterioration of network performance. Increasing the number of interactions can increase the amount of information acquired by the nodes, but it will also increase network delay and network overhead. However, the current research on the number of interactions is insufficient. Therefore, this paper studies the impact of the number of interactions on the legal election set and establishes the analytical models of election success probability, delay, and efficiency. The range of interaction times is determined by maximizing the efficiency, election success probability and minimizing delay. Finally, simulation results show that the number of interactions should be adjusted according to the network scale and efficiency.

show abstract

“…Based on mathematically model and realtime experiments the effectiveness of the proposed algorithm has been measured and it is found that the proposed algorithm has better network throughput as compared to existing schemes. Authors in [15] proposed CSMA-aware Static Channel Assignment algorithm that assigns collision free channel. Based on CSMA-aware interference model and link limitation strategy proposed algorithm reduces the interference among nodes.…”

Section: Related Workmentioning

confidence: 99%

Performance evaluation of interference aware topology power and flow control channel assignment algorithm

Saini¹,

Sohi²

2020

IJECE

View full text Add to dashboard Cite

Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.

show abstract

Collision-Free Channel Assignment Is Possible in IEEE802.11-Based Wireless Mesh Networks

Cited by 12 publications

References 12 publications

Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks

Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks

Research on the Impact of Interaction Times in Distributed Wireless Ad Hoc Networks

Performance evaluation of interference aware topology power and flow control channel assignment algorithm

Contact Info

Product

Resources

About