{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:21Z","timestamp":1754157921205,"version":"3.41.2"},"reference-count":18,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2009,9,4]],"date-time":"2009-09-04T00:00:00Z","timestamp":1252022400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9,4]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>Wireless mesh networks (WMNs) have evolved quickly during the last several years. They are widely used in a lot of fields. Channel allocation provides basic means to guarantee mesh networks\u2019 good performance such as efficient routing. The purpose of this paper is to study channel allocation in mesh networks.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>First, the papers in channel allocation fields are surveyed, and then the limitations in existing methods noted. Graph theory is used to find a better model to represent the problem and algorithms are proposed based on this model. Simulation proved that algorithms are better than the previous conflict graph\u2010based approaches.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The paper analyzes the conflict graph\u2010based model and finds its limitations, then proposes a bipartite graph\u2010based model. Algorithms were devised based on this model. Simulation results illustrate that the algorithms can reduce the starvation ratio and improve the bandwidth utilization, compared with previous conflict graph\u2010based algorithms.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>The research of this paper is based on an ideal network environment without interference or noises. It will be better if the noises are considered in future work.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>To study the routing strategies of WMNs, it is not sufficient to only consider path length as routing metric since the nodes are heterogeneous. The routing metrics should include the channel bandwidths which are the results of channel allocation.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>This paper presents a new bipartite graph\u2010based model to represent the channel allocation problem in mesh networks. This model is more efficient and includes more information compared with conflict graph model, and it also proposes channel allocation algorithms based on bipartite graph\u2010based model. The algorithms can reduce starvation ratio and improve the bandwidth utilization.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370910991839","type":"journal-article","created":{"date-parts":[[2009,10,5]],"date-time":"2009-10-05T12:30:27Z","timestamp":1254745827000},"page":"233-248","source":"Crossref","is-referenced-by-count":4,"title":["A new channel assignment algorithm for wireless mesh networks"],"prefix":"10.1108","volume":"5","author":[{"given":"Jianjun","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongming","family":"Fei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022021919562529500_b1","unstructured":"Adya, A. et al. (2004), \u201cA multi\u2010 radio unification protocol for IEEE 802.11 wireless networks\u201d, paper presented at Broadnets, San Jose, CA, October."},{"key":"key2022021919562529500_b2","doi-asserted-by":"crossref","unstructured":"Akyildiz, I.F. and Wang, X. (2005), \u201cA survey on wireless mesh networks\u201d, IEEE Communications Magazine, Vol. 43 No. 9, pp. S23\u2010S30.","DOI":"10.1109\/MCOM.2005.1509968"},{"key":"key2022021919562529500_b3","doi-asserted-by":"crossref","unstructured":"Ashish, R., Kartik, G. and Tzicker, C. (2005), \u201cCentralized channel assignment and routing algorithms for multi\u2010channel wireless mesh networks\u201d, Mobile Computing and Communications Review, Vol. 8 No. 2.","DOI":"10.1145\/997122.997130"},{"key":"key2022021919562529500_b4","doi-asserted-by":"crossref","unstructured":"Bahl, P., Chandra, R. and Dunagan, J. (2004), \u201cSSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad\u2010hoc wireless networks\u201d, paper presented at ACM MobiCom 2004, Philadelphia, PA.","DOI":"10.1145\/1023720.1023742"},{"key":"key2022021919562529500_b5","unstructured":"Cao, L. and Zheng, H. (2005), \u201cDistributed spectrum allocation via local bargaining\u201d, Sensor and Ad Hoc Communications and Networks, September, pp. 475\u201086."},{"key":"key2022021919562529500_b6","unstructured":"Grandblaise, D. et al. (2002), \u201cDynamic spectrum allocation (DSA) and recongurability\u201d, SDR Forum Technical."},{"key":"key2022021919562529500_b7","doi-asserted-by":"crossref","unstructured":"Haykin, S. (2005), \u201cCognitive radio: brain\u2010empowered wireless communications\u201d, IEEE Journal on Selected Areas in Communications, Vol. 23 No. 2, pp. 201\u201020.","DOI":"10.1109\/JSAC.2004.839380"},{"key":"key2022021919562529500_b8","doi-asserted-by":"crossref","unstructured":"Ko, B. et al. (2006), \u201cDistributed channel assignment in multi\u2010radio 802.11 mesh networks\u201d, Columbia University Technical Report.","DOI":"10.1109\/WCNC.2007.727"},{"key":"key2022021919562529500_b9","unstructured":"Kyasanur, P. and Vaidya, N.H. (2004), \u201cRouting and interface assignment in multi\u2010channel multi\u2010interface wireless networks\u201d, UIUC Technical Report."},{"key":"key2022021919562529500_b10","doi-asserted-by":"crossref","unstructured":"Marina, M. and Das, S. (2005), \u201cA topology control approach for utilizing multiple channels in multi\u2010radio wireless mesh networks\u201d, paper presented at Broadnets 2005 Symposium, Boston, MA.","DOI":"10.1109\/ICBN.2005.1589641"},{"key":"key2022021919562529500_b11","doi-asserted-by":"crossref","unstructured":"Raman, B. (2006), \u201cChannel allocation in 802.11\u2010based mesh networks\u201d, paper presented at IEEE Infocom 2006, Barcelona.","DOI":"10.1109\/INFOCOM.2006.317"},{"key":"key2022021919562529500_b12","doi-asserted-by":"crossref","unstructured":"Ramachandran, K. et al. (2006), \u201cInterference\u2010aware channel assignment in multi\u2010radio wireless mesh networks\u201d, paper presented at IEEE Infocom 2006, Barcelona.","DOI":"10.1109\/INFOCOM.2006.177"},{"key":"key2022021919562529500_b13","doi-asserted-by":"crossref","unstructured":"Tang, J. Xue, G. and Zhang, W. (2005), \u201cInterference\u2010aware topology control and QoS routing in multi\u2010channel wireless mesh networks\u201d, paper presented at International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).","DOI":"10.1145\/1062689.1062700"},{"key":"key2022021919562529500_b14","unstructured":"Yan, W. and Wu, W. (2000), Data Structure, Section Edition, Tsinghua University Press, Beijing."},{"key":"key2022021919562529500_b15","doi-asserted-by":"crossref","unstructured":"Zheng, H. and Peng, C. (2005), \u201cCollaboration and fairness in opportunistic spectrum access\u201d, IEEE Journal on Selected Areas in Communications,Vol. 5, February, pp. 3132\u20106.","DOI":"10.1109\/ICC.2005.1494982"},{"key":"key2022021919562529500_b16","doi-asserted-by":"crossref","unstructured":"Zhao, Q. and Sadler, B. (2007), \u201cDynamic spectrum access:signal process, networking, and regulatory policy\u201d, IEEE Signal Processing Magazine, Vol. 24 No. 3, pp. 78\u201089.","DOI":"10.1109\/MSP.2007.361604"},{"key":"key2022021919562529500_b17","unstructured":"Ashish, R. and Tzi\u2010cker, C. (2005), \u201cArchitecture and algorithms for an IEEE 802.11\u2010based multi\u2010channel wireless mesh network\u201d, IEEE Infocom 2005."},{"key":"key2022021919562529500_b18","doi-asserted-by":"crossref","unstructured":"Kodialam, M. and Nandagopal, T. (2005), \u201cCharacterizing the capacity region in multi\u2010radio multi\u2010channel wireless mesh networks\u201d, ACM Mobicom.","DOI":"10.1145\/1080829.1080837"}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370910991839","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370910991839\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370910991839\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:13Z","timestamp":1753403053000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/5\/3\/233-248\/163036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,4]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9,4]]}},"alternative-id":["10.1108\/17427370910991839"],"URL":"https:\/\/doi.org\/10.1108\/17427370910991839","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2009,9,4]]}}}