Maximize Concurrent Data Flows in Multi-radio Multi-channel Wireless Mesh Networks

Zhanmao Cao1, Qisong Huang1 and Chase Q. Wu2

  1. Department of Computer Science, South China Normal University
    Guangzhou, Guangdong 510631, China
  2. Department of Computer Science, New Jersey Institute of Technology
    Newark, New Jersey 07102, USA


Multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) have emerged as the broadband networks to provide access to the Internet for ubiq-uitous 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.

Key words

Concurrent flows, routing and scheduling, coexisting links, Wireless Mesh Networks

Digital Object Identifier (DOI)

Publication information

Volume 17, Issue 3 (October 2020)
Year of Publication: 2020
ISSN: 1820-0214 (Print) 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

DownloadAvailable in PDF
Portable Document Format

How to cite

Cao, Z., Huang, Q., Wu, C. Q.: Maximize Concurrent Data Flows in Multi-radio Multi-channel Wireless Mesh Networks. Computer Science and Information Systems, Vol. 17, No. 3, 759–777. (2020),