{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T10:57:52Z","timestamp":1777546672614,"version":"3.51.4"},"reference-count":31,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T00:00:00Z","timestamp":1543708800000},"content-version":"vor","delay-in-days":335,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61601337"],"award-info":[{"award-number":["61601337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771354"],"award-info":[{"award-number":["61771354"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["2017CFB593"],"award-info":[{"award-number":["2017CFB593"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Recent research activities have shown that opportunistic routing can achieve considerable performance gains in Cognitive Radio Ad hoc Networks (CRAHNs). Most of these studies focused on designing appropriate metrics to select and prioritize the forwarding candidates. However, in multiple\u2010flow networks, a small number of nodes may always be with the higher priority order for different flows. Thus, some nodes may easily become overloaded with too much traffic and be severely congested. To overcome this problem, we propose a load balancing opportunistic routing (LBOR) scheme to maximize the total throughput of the whole network. We first formulate the problem of maximizing the total throughput of the network as a linear programming problem. Then, we develop heuristic load balancing candidate forwarder sorting and selection algorithms. Simulation results and comparisons demonstrate that our proposed LBOR scheme outperforms existing opportunistic routing protocols with nonload balancing methods in CRAHNs.<\/jats:p>","DOI":"10.1155\/2018\/9412782","type":"journal-article","created":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T23:35:02Z","timestamp":1543793702000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Load Balancing Opportunistic Routing for Cognitive Radio Ad Hoc Networks"],"prefix":"10.1155","volume":"2018","author":[{"given":"Wenxuan","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4833-8604","authenticated-orcid":false,"given":"Xing","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6094-1203","authenticated-orcid":false,"given":"Junwei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guosheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,12,2]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/98.788210"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.08.019"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2017.1600117"},{"key":"e_1_2_11_4_2","doi-asserted-by":"crossref","unstructured":"SaleemY. YauK.-L. A. MohamadH.et al. Joint channel selection and cluster-based routing scheme based on reinforcement learning for cognitive radio networks International Conference on Computer Communications and Control Technology 2015 21\u201325.","DOI":"10.1109\/I4CT.2015.7219529"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2626721"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-016-1212-4"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.03.005"},{"key":"e_1_2_11_8_2","first-page":"1","article-title":"User social activity-based routing for cognitive radio networks","volume":"13","author":"Lu J.","year":"2018","journal-title":"Personal Ubiquitous Computing"},{"key":"e_1_2_11_9_2","doi-asserted-by":"crossref","unstructured":"BiswasS.andMorrisR. ExOR: opportunistic multi-hop routing for wireless networks Proceedings of the Conference on Applications Technologies Architectures and Protocols for Computer Communications (SIGCOMM \u203205) 2005 ACM 133\u2013144 https:\/\/doi.org\/10.1145\/1090191.1080108 2-s2.0-33745126405.","DOI":"10.1145\/1090191.1080108"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2423677"},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2730233"},{"key":"e_1_2_11_12_2","doi-asserted-by":"crossref","unstructured":"TangX. ChangY. andZhouK. Geographical opportunistic routing in dynamic multi-hop cognitive radio networks Proceedings of the 2012 Computing Communications and Applications Conference ComComAp 2012 January 2012 China 256\u2013261 2-s2.0-84860487331.","DOI":"10.1109\/ComComAp.2012.6154853"},{"key":"e_1_2_11_13_2","doi-asserted-by":"crossref","unstructured":"TangX.andLiuQ. Network coding based geographical opportunistic routing for ad hoc cognitive radio networks Proceedings of the 2012 IEEE Globecom Workshops GC Wkshps 2012 December 2012 USA 503\u2013507 2-s2.0-84875636072.","DOI":"10.1109\/GLOCOMW.2012.6477624"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2875566"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2582173"},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2545439"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-016-3447-x"},{"key":"e_1_2_11_18_2","doi-asserted-by":"crossref","unstructured":"ZhongX. LuR. LiL. andZhangS. ETOR: Energy and Trust Aware Opportunistic Routing in Cognitive Radio Social Internet of Things Proceedings of the 2017 IEEE Global Communications Conference (GLOBECOM 2017) December 2017 Singapore 1\u20136 https:\/\/doi.org\/10.1109\/GLOCOM.2017.8254213.","DOI":"10.1109\/GLOCOM.2017.8254213"},{"key":"e_1_2_11_19_2","doi-asserted-by":"crossref","unstructured":"TangX. ZhangH. ZhouK. andWangJ. Extending access point service coverage area through opportunistic forwarding in multi-hop collaborative relay WLANs Proceedings of the 20th IEEE International Conference on Parallel and Distributed Systems ICPADS 2014 December 2014 Taiwan 787\u2013792 2-s2.0-84946562136.","DOI":"10.1109\/PADSW.2014.7097883"},{"key":"e_1_2_11_20_2","doi-asserted-by":"crossref","unstructured":"Ben FradjH. AnaneR. BouallegueM. andBouallegueR. A range-based opportunistic routing protocol for Wireless Sensor networks Proceedings of the 13th IEEE International Wireless Communications and Mobile Computing Conference IWCMC 2017 June 2017 Spain 770\u2013774 2-s2.0-85027886424.","DOI":"10.1109\/IWCMC.2017.7986382"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/634759"},{"key":"e_1_2_11_22_2","doi-asserted-by":"crossref","unstructured":"AbdulwahidH. DaiB. HuangB. andChenZ. Optimal energy and Load Balance Routing for MANETs Proceedings of the 2015 4th International Conference on Computer Science and Network Technology (ICCSNT) December 2015 Harbin China 981\u2013986 https:\/\/doi.org\/10.1109\/ICCSNT.2015.7490901.","DOI":"10.1109\/ICCSNT.2015.7490901"},{"key":"e_1_2_11_23_2","doi-asserted-by":"crossref","unstructured":"MichelM. DuquennoyS. QuoitinB. andVoigtT. Load-balanced data collection through opportunistic routing Proceedings of the 11th IEEE International Conference on Distributed Computing in Sensor Systems DCOSS 2015 June 2015 Brazil 62\u201370 2-s2.0-84945932841.","DOI":"10.1109\/DCOSS.2015.10"},{"key":"e_1_2_11_24_2","doi-asserted-by":"crossref","unstructured":"ShiW. WangE. LiZ.et al. A load-balance and interference-aware routing algorithm for multicast in the wireless mesh network IEEE International Conference on Information and Communication Technology Convergence 2016 206\u2013210.","DOI":"10.1109\/ICTC.2016.7763469"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2606427"},{"key":"e_1_2_11_26_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/6421607"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.121111"},{"key":"e_1_2_11_28_2","doi-asserted-by":"crossref","unstructured":"LiJ. WangX. YuR. andJiaJ. The adaptive routing algorithm depending on the traffic prediction model in cognitive networks Proceedings of the 1st International Conference on Pervasive Computing Signal Processing and Applications PCSPA 2010 September 2010 China 319\u2013322 2-s2.0-78650445667.","DOI":"10.1109\/PCSPA.2010.84"},{"key":"e_1_2_11_29_2","unstructured":"GanesanD. KrishnamachariB. WooA.et al. Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks 2002 no. 02-0013 Univ. of California Los Angeles."},{"key":"e_1_2_11_30_2","unstructured":"The Network Simulator-ns-2 http:\/\/www.isi.edu\/nsnam\/ns\/."},{"key":"e_1_2_11_31_2","unstructured":"Cognitive Radio Network patch for ns2 https:\/\/docs.google.com\/file\/d\/0B7S255p3kFXNNXEtS3ozTHpmRHM\/edit 2009."}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/9412782.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/9412782.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/9412782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:30:13Z","timestamp":1723012213000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/9412782"}},"subtitle":[],"editor":[{"given":"Ioannis","family":"Chatzigiannakis","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/9412782"],"URL":"https:\/\/doi.org\/10.1155\/2018\/9412782","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-06-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9412782"}}