How to Effectively Use Multiple Channels in Wireless Mesh Networks

Li, Ming; Scalabrino, Nicola; Fang, Yuguang; Gregori, Enrico; Chlamtac, I.

doi:10.1109/tpds.2008.256

Cited by 24 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to [51], the switching delay in 802.11a is around 328 microseconds, which is equal to the time of transmission of 1024 byte in a rate of 25 Mbps using the same technology. Furthermore, Li et al [52] show that this latency can rise, up to scale of seconds due to the effect of upper layer protocols. The authors in [53] presented an experimental study on the interruption associated with channel switching, which is in order of 10 seconds with the use of OLSR protocol due to fast link failure update in channel switching.…”

Section: Problem Formulation 31 Re-configuration Problem Descriptionmentioning

confidence: 99%

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

Omar

Hashim

Hassan³

et al. 2016

KSII TIIS

View full text Add to dashboard Cite

Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and rerouting cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path rerouting resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm reassigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, rerouting cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the

show abstract

Section: Problem Formulation 31 Re-configuration Problem Descriptionmentioning

confidence: 99%

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

Omar

Hashim

Hassan³

et al. 2016

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…Therefore, we ſx the minimum time period between reconſgurations (α) to 5 minutes. As studies conducted in [22] show, channel reconſguration takes time in the order of seconds though the channel switching of the router radios may be of the order of milliseconds. Hence we assume β to take value of 3 secs.…”

Section: A Description Of Real Trafſc Tracesmentioning

confidence: 99%

Integrating traffic estimation and dynamic channel reconfiguration in Wireless Mesh Networks

Balachandran

Franklin

Murthy

2009

2009 International Conference on High Performance Computing (HiPC)

View full text Add to dashboard Cite

Careful Channel Assignment (CA) and Link Scheduling (LS), tuned to the trafſc demand in the network, are required to efſciently utilize Multi-Channel Multi-Radio (MC-MR) Wireless Mesh Networks (WMNs).In a dynamic network, where the trafſc demand keeps changing with time, we need to reconſgure the CA and LS to suit to the changing demands. But, a change in CA leads to disruption of trafſc resulting in a less reliable and lossy network. In this paper, we propose a theoretical framework to evaluate the efſciency of channel reconſguration by taking into consideration the two conƀicting objectives of maximizing network throughput and minimizing the reconſguration overhead. A channel reconſguration scheme that takes into account the current state of the network can ſnd a new CA with signiſcantly less overhead caused by reconſguration. We propose and evaluate polynomially bounded heuristic algorithms for performing demandbased and state aware channel reconſguration. Further, in a highly dynamic network scenario, performing reconſguration very frequently to suit every trafſc demand will lead to high reconſguration overhead. Whereas doing it less frequently will lead to underutilization of the network. Hence, we propose a scheme that employs prediction techniques to estimate the future trafſc demands in order to reduce the frequency of reconſguration considering the long term trafſc demand and conduct simulation studies to evaluate this scheme.

show abstract

“…If we use the optimal CA for every traffic demand in the network, without considering the current state of the network, it will lead to lot of reconfigurations and will heavily disrupt the ongoing traffic in the network. In [11], the authors have shown that though the channel switching time of the interface cards are in the order of micro seconds, the average traffic disruption time due to channel reconfiguration is in the order of seconds. If these reconfigurations happen frequently, the loss of packets and under utilization of the network will make WMNs very unreliable.…”

Section: Introductionmentioning

confidence: 99%

Demand Based State Aware Channel Reconfiguration Algorithm for Multi-Channel Multi-Radio Wireless Mesh Networks

Franklin

Balachandran

Murthy

et al. 2010

2010 INFOCOM IEEE Conference on Computer Communications Workshops

View full text Add to dashboard Cite

Efficient utilization of Multi Channel-Multi Radio (MC-MR) Wireless Mesh Networks (WMNs) can be achieved only by intelligent Channel Assignment (CA) and Link Scheduling (LS). Due to the dynamic nature of traffic demand in WMNs, the CA has to be reconfigured whenever traffic demand changes, in order to achieve maximum throughput in the network. The reconfiguration of CA requires channel switching which leads to disruption of ongoing traffic in the network. The existing CA algorithms for MC-MR WMNs in the literature do not consider the channel reconfiguration overhead that occurs due to this channel switching. In this paper, we propose a novel reconfiguration framework that considers both network throughput and reconfiguration overhead to quantitatively evaluate a reconfiguration algorithm. Based on the reconfiguration framework, we propose an online heuristic algorithm for CA called Demand based State Aware channel Reconfiguration Algorithm (DeSARA) that finds the CA for the current traffic demand by considering the existing CA of the network to minimize the reconfiguration overhead. We show through simulations that DeSARA outperforms both static CA and fully dynamic CA in terms of total achieved throughput.

show abstract

How to Effectively Use Multiple Channels in Wireless Mesh Networks

Cited by 24 publications

References 23 publications

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

Integrating traffic estimation and dynamic channel reconfiguration in Wireless Mesh Networks

Demand Based State Aware Channel Reconfiguration Algorithm for Multi-Channel Multi-Radio Wireless Mesh Networks

Contact Info

Product

Resources

About