TY - JOUR
T1 - On a coexisting scheme for multiple flows in multi-radio multi-channel wireless mesh networks
AU - Cao, Zhanmao
AU - Huang, Qisong
AU - Wu, Chase Q.
AU - Kong, Wenkang
AU - Hou, Aiqin
N1 - Funding Information:
Acknowledgement. This research is sponsored by National Nature Science Union Foundation of China under Grant No. U1609202 and the Key Research and Development Plan of Shaanxi Province, China under Grant No. 2018GY-011 with Northwest University, P.R. China.
Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2020.
PY - 2020
Y1 - 2020
N2 - Multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) hold the promise to become the next-generation networks to provide the service of ubiquitous computing, access to the Internet, and support for a large number of data flows. Many applications in WMNs can be modeled as a multi-flow coexistence problem. Assembling links distributed in orthogonal channels to support multiple flows is essentially a combinatorial optimization problem, which concerns channel assignment, path finding, and link scheduling. To make full use of network resources, links in different channel layers should be concatenated to compose data transfer paths for multiple flows with awareness of nodes’ free interfaces and available channels. Based on the analysis of traffic behaviors, this paper designs a coexisting algorithm to maximize the number of flows. Simulations are conducted in combinatorial cases with various traffic requests of multiple pairs, and the results show the efficacy of the proposed algorithm over a random network topology. This scheme can be used to develop routing and scheduling solutions for multi-flow network tasks through prior computing.
AB - Multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) hold the promise to become the next-generation networks to provide the service of ubiquitous computing, access to the Internet, and support for a large number of data flows. Many applications in WMNs can be modeled as a multi-flow coexistence problem. Assembling links distributed in orthogonal channels to support multiple flows is essentially a combinatorial optimization problem, which concerns channel assignment, path finding, and link scheduling. To make full use of network resources, links in different channel layers should be concatenated to compose data transfer paths for multiple flows with awareness of nodes’ free interfaces and available channels. Based on the analysis of traffic behaviors, this paper designs a coexisting algorithm to maximize the number of flows. Simulations are conducted in combinatorial cases with various traffic requests of multiple pairs, and the results show the efficacy of the proposed algorithm over a random network topology. This scheme can be used to develop routing and scheduling solutions for multi-flow network tasks through prior computing.
KW - Coexisting links
KW - Multiple flows
KW - Routing and scheduling
KW - Wireless mesh networks
UR - http://www.scopus.com/inward/record.url?scp=85093076110&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85093076110&partnerID=8YFLogxK
U2 - 10.1007/978-981-15-2767-8_1
DO - 10.1007/978-981-15-2767-8_1
M3 - Conference article
AN - SCOPUS:85093076110
SN - 1865-0929
VL - 1163
SP - 3
EP - 11
JO - Communications in Computer and Information Science
JF - Communications in Computer and Information Science
T2 - 10th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2019
Y2 - 12 December 2019 through 14 December 2019
ER -