scholarly journals Distributed joint channel assignment, routing and scheduling for wireless mesh networks

2008 ◽  
Vol 31 (7) ◽  
pp. 1436-1446 ◽  
Author(s):  
Xin Wang ◽  
J.J. Garcia-Luna-Aceves
2016 ◽  
Vol 2016 ◽  
pp. 1-24 ◽  
Author(s):  
Omar M. Zakaria ◽  
Aisha-Hassan A. Hashim ◽  
Wan H. Hassan ◽  
Othman O. Khalifa ◽  
M. Azram ◽  
...  

Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.


2020 ◽  
Vol 17 (3) ◽  
pp. 759-777
Author(s):  
Zhanmao Cao ◽  
Qisong Huang ◽  
Chase Wu

Multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) have emerged as the broadband networks to provide access to the Internet for ubiquitous computing with the support for a large number of data flows. Many applications in WMNs can be abstracted as a multi-flow coexistence problem to carry out multiple concurrent data transfers. More specifically, links in different channel layers must be concatenated to compose multiple data transfer paths based on nodes? free interfaces and available channels. This is typically formulated as a combinatorial optimization problem with various stages including channel assignment, path computing, and link scheduling. This paper analyzes traffic behaviors and designs a coexisting algorithm to maximize the number of concurrent data flows. Simulations are conducted in combinatorial cases of channel and radio with various traffic requests of multiple pairs. The experimental results show the efficacy of the coexisting algorithm over a randomly generated topology. This scheme can be used to develop routing and scheduling solutions for various multi-flow network applications through prior computing.


Sign in / Sign up

Export Citation Format

Share Document