{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:18:32Z","timestamp":1767183512026},"reference-count":0,"publisher":"National Library of Serbia","issue":"3","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.2298\/csis200216019c","type":"journal-article","created":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T09:13:01Z","timestamp":1600852381000},"page":"759-777","source":"Crossref","is-referenced-by-count":3,"title":["Maximize concurrent data flows in multi-radio multi-channel wireless mesh networks"],"prefix":"10.2298","volume":"17","author":[{"given":"Zhanmao","family":"Cao","sequence":"first","affiliation":[{"name":"Department of Computer Science, South China Normal University Guangzhou, Guangdong, China"}]},{"given":"Qisong","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, South China Normal University Guangzhou, Guangdong, China"}]},{"suffix":"Q.","given":"Chase","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, New Jersey Institute of Technology Newark, New Jersey, USA"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:05:11Z","timestamp":1685347511000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02142000019C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.2298\/csis200216019c","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}