On a Coexisting Scheme for Multiple Flows in Multi-radio Multi-channel Wireless Mesh Networks

Cao, Zhanmao; Huang, Qisong; Wu, Chase Q.; Wenkang, Kong; Hou, Aiqin

doi:10.1007/978-981-15-2767-8_1

Cited by 1 publication

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The goal of CA is take full usage of the radio resource, which is represented in interference-free or more coexisting active links at a moment. Furthermore, they proposed optimal schemes of combinatorial routing and scheduling for concurrent flows in their recent work [4]. The considered factors in the model in the latest work [11], i.e., the major parameters, are of available channels, radios equipped, topology, and traffic requests.…”

Section: Related Workmentioning

confidence: 99%

“…For the multi-pair or multi-flow problem, Cao et al explored and addressed various issues in resource-aware situation [6]. They also designed a combinatorial scheme with consistent coexisting links over a topology of 64 nodes [11], and a co-existing scheme with optimal joint routing and scheduling [4]. More research efforts are needed in this line of research to support concurrent data flows in WMNs with limited resources.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Cao

Huang

2020

COMSIS J

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%