A Load Aware Channel Assignment and Link Scheduling Algorithm for Multi-channel Multi-radio Wireless Mesh Networks

An Adaptive Channel Reconfiguration Algorithm for Multi-Channel Multi-Radio Wireless Mesh Networks

“…The collection of traffic demands from the nodes and the propagation of channel reassignment and LS to the nodes is handled on similar lines of channel assignment protocol described in [6]. In this work, the channel assignment algorithm (LoCALS) given in [11] is used for finding the CA for a given traffic demand.…”

“…The CA and LS for each cluster is found using LoCALS [11]. The two other naive reconfiguration policies are: Dynamic Channel Assignment Scheme (DCAS) and Static Channel Assignment Scheme (SCAS).…”

“…This requires that the profiling of the traffic matrices must be done in such a way that the two traffic matrices that share vicinity in the profile must have similar optimal CA individually. The CA algorithm LoCALS [11], finds the CA and LS for a given traffic demand based on the relative ordering of the expected loads in the interference region of each edge. (Refer [11] for more details).…”

“…The CA algorithm LoCALS [11], finds the CA and LS for a given traffic demand based on the relative ordering of the expected loads in the interference region of each edge. (Refer [11] for more details).…”

“…The static nature of the mesh routers can be utilized to provide link level synchronization among them and the links can be scheduled in time slots to make the network interference free. In our earlier work [11], we have shown that considering the traffic demand in finding the CA and Link Scheduling (LS) in MC-MR WMNs is beneficial in terms of achieved throughput under different network and traffic scenarios. And, we proposed a polynomially bounded heuristic algorithm called Load aware Channel Assignment and Link Scheduling (LoCALS) for efficient CA and LS.…”