Partially overlapped channels not considered harmful

Mishra, Arunesh; Shrivastava, Vivek; Banerjee, Suman; Arbaugh, William A.

doi:10.1145/1140103.1140286

Cited by 212 publications

(143 citation statements)

References 20 publications

Supporting

Mentioning

141

Contrasting

Order By: Relevance

“…Kodialam and Nandagopal [13] also proposed an algorithm that maximizes the network throughput subject to the minimum rate requirements for each flow. It has been also recently shown in two independent works in [21,22] that using partially-overlapped frequency channels can further improve network performance. Last but not least, the study of channel assignment when smart directed antennas are used is presented in [23].…”

Section: Introductionmentioning

confidence: 96%

Congestion-aware channel assignment for multi-channel wireless mesh networks

Rad

Wong

2009

Computer Networks

View full text Add to dashboard Cite

a b s t r a c tIn this paper, we propose a distributed congestion-aware channel assignment (DCACA) algorithm for multi-channel wireless mesh networks (MC-WMNs). The frequency channels are assigned according to the congestion measures which indicate the congestion status at each link. Depending on the selected congestion measure (e.g., queueing delay, packet loss probability, and differential backlog), various design objectives can be achieved. Our proposed distributed algorithm is simple to implement as it only requires each node to perform a local search. Unlike most of the previous channel assignment schemes, our proposed algorithm assigns not only the non-overlapped (i.e., orthogonal) frequency channels, but also the partially-overlapped channels. In this regard, we introduce the channel overlapping and mutual interference matrices which model the frequency overlapping among different channels. Simulation results show that in the presence of elastic traffic (e.g., TCP Vegas or TCP Reno) sources, our proposed DCACA algorithm increases the aggregate throughput and also decreases the average packet round-trip compared with the previously proposed Load-Aware channel assignment algorithm. Furthermore, in a congested IEEE 802.11b network setting, compared with the use of three non-overlapped channels, the aggregate network throughput can further be increased by 25% and the average round-trip time can be reduced by more than one half when all the 11 partially-overlapped channels are used.

show abstract

Section: Introductionmentioning

confidence: 96%

Congestion-aware channel assignment for multi-channel wireless mesh networks

Rad

Wong

2009

Computer Networks

View full text Add to dashboard Cite

show abstract

“…Therefore, the optimized Interference aware Joint Channel Assignment (I-JCA) model proposed in this paper is based on the utilization of joint channels available in 2.4 GHz ISM band. Normally, the joint channel assignment is considered as harmful due to adjacent channel interference [23]. However, this peril is turned into an advantage through a systematic optimize approach of utilizing the spectral re-usability of joint channels available in free spectrum [24].…”

Section: Introductionmentioning

confidence: 99%

Optimized interference aware joint channel assignment model for wireless mesh network

Ali

Ngadi

2015

Telecommun Syst

View full text Add to dashboard Cite

In this paper, linear optimization is used to model the interference aware joint channel assignment problem in Wireless Mesh Networks. The model selects the channels for the interfering links such that interference is minimized, overall throughput of the network is maximized, and network capacity is fairly distributed among the interfering links. The interference is minimized by classifying the interfering links into four different classes depending upon the geometric location of the sender and receiver of a link (i.e., Sender Connected, Asymmetric Incomplete State, Symmetric Incomplete State, and Far Hidden interfering links). Further, the classes of interfering links are assigned with distinct channels through optimized spectral re-usability of joint channels available in 2.4 GHz ISM band. As a result, it increases the simultaneous transmissions among the interfering links which in turn increases the aggregate throughput of the network while ensuring that capacity is fairly distributed among the interfering links. Numerical results indicated that joint channel assignment model has achieved better performance than non-overlapping channel assignment models. Hence, this validates the model, which can serve as a benchmark in the design and deployment of wireless mesh networks.

show abstract

“…A number of channel assignment solutions have been proposed in the literature [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22], including dynamic and static/quasi-static approaches [5]. The dynamic approaches [6][7][8] require channel switching at very fast time scales (e.g., per packet or a handful of packets) and hence require coordination and tight timing synchronization between nodes.…”

Section: Introductionmentioning

confidence: 99%

“…In addition, partially overlapping channels have been used together with the non-overlapping channels in some channel assignment approaches to further improve the network capacity of MR-MC WMNs [16,[19][20][21]. Mohsenian et al [16] have proposed the use of partially overlapping channels in their Joint Optimal Channel Assignment and Congestion Control (JOCAC) algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…The authors have further proposed the channel overlapping matrix and mutual interference matrices to model the non-overlapping and partially overlapping channels [19]. Mishra et al [20] have formally modeled the degree of overlap between partially overlapping channels. Naveed et al [21] have used the model in their work to take advantage of partially overlapping channels to further improve spatial reuse and enhance network throughput.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Feasibility of optimally assigning channels by exhaustive search in commercial multi-radio wireless mesh networks

et al. 2009

View full text Add to dashboard Cite

Channel assignment problems in multi-radio wireless mesh networks (WMNs) have been shown to be NP-hard in various scenarios in the literature. By far, most of research efforts have focused on developing efficient approximation algorithms that run reasonably fast and provide good quality channel assignment rather than the optimal one. However, from the practical network design and deployment standpoint, engineers care more about whether it is feasible to optimally assign channels in the simplest way (i.e., exhaustive search), as most of existing commercial WMNs are of small/medium scale. In this paper, we attempt to answer this practical question. We study the complexity of general channel assignment problems with certain basic and common properties. The results show that the complexity in terms of the number of different possible assignments is exponential in the number of wireless links. Furthermore, we estimate the theoretical runtime of determining the optimal channel assignment by exhaustive search and validate it through experiments. We show that, given certain computing power (e.g., an off-the-shelf notebook PC), it is feasible to optimally solve channel assignment problems in small-scale and medium-scale commercial multi-radio WMNs. In other words, approximation algorithms are not needed for most of current commercial WMNs.

show abstract

Partially overlapped channels not considered harmful

Cited by 212 publications

References 20 publications

Congestion-aware channel assignment for multi-channel wireless mesh networks

Congestion-aware channel assignment for multi-channel wireless mesh networks

Optimized interference aware joint channel assignment model for wireless mesh network

Feasibility of optimally assigning channels by exhaustive search in commercial multi-radio wireless mesh networks

Contact Info

Product

Resources

About