Maximize concurrent data flows in multi-radio multi-channel wireless mesh networks

Zhanmao Cao, Qisong Huang, Chase Q. Wu

Research output: Contribution to journalArticlepeer-review

Abstract

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 lay-ers 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. Simula-tions 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.

Original languageEnglish (US)
Pages (from-to)759-777
Number of pages19
JournalComputer Science and Information Systems
Volume17
Issue number3
DOIs
StatePublished - Oct 2020

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Keywords

  • Coexisting links
  • Concurrent flows
  • Routing and scheduling
  • Wireless Mesh Networks

Fingerprint Dive into the research topics of 'Maximize concurrent data flows in multi-radio multi-channel wireless mesh networks'. Together they form a unique fingerprint.

Cite this