{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:53:49Z","timestamp":1761648829625,"version":"3.37.3"},"reference-count":35,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T00:00:00Z","timestamp":1604620800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005791","name":"Sirindhorn International Institute of Technology, Thammasat University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005791","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2020,11,6]]},"abstract":"<jats:p>Distributed wireless networks with smart users (independent and rational) are becoming popular, and researchers are studying distributed equilibrium solutions like Nash Equilibrium (NE) to analyze and predict the convergence of such networks. Our goal is to drive the distributed wireless network to NE with high total throughput. Study of the distribution of network metrics at NE with high total throughput shows that communication links still have significant amount of interference. Adding an interference-received term with an optimal weight (<jats:inline-formula><a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><a:msubsup><a:mrow><a:mi>\u03b1<\/a:mi><\/a:mrow><a:mrow><a:mtext>opt<\/a:mtext><\/a:mrow><a:mrow><a:mo>\u2217<\/a:mo><\/a:mrow><\/a:msubsup><\/a:math><\/jats:inline-formula>) to the link\u2019s payoff can push the distributed network to converge to NE with high total throughput. The channel allocation trend at NE with high total throughput is as follows: each of the<jats:inline-formula><c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><c:mi>C<\/c:mi><c:mo>\u2212<\/c:mo><c:mn>1<\/c:mn><\/c:math><\/jats:inline-formula>links occupies its own channel, and the remaining<jats:inline-formula><e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><e:mi>N<\/e:mi><e:mo>\u2212<\/e:mo><e:mi>C<\/e:mi><e:mo>+<\/e:mo><e:mn>1<\/e:mn><\/e:math><\/jats:inline-formula>links share the remaining one channel, where<jats:inline-formula><g:math xmlns:g=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\"><g:mi>N<\/g:mi><\/g:math><\/jats:inline-formula>is the number of links and<jats:inline-formula><i:math xmlns:i=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\"><i:mi>C<\/i:mi><\/i:math><\/jats:inline-formula>is the number of channels in the network. The links (transmitters and receivers) are randomly located and<jats:inline-formula><k:math xmlns:k=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M6\"><k:mi>C<\/k:mi><k:mo>&lt;<\/k:mo><k:mi>N<\/k:mi><\/k:math><\/jats:inline-formula>(limited resources). The transmitter of a link has a direct connection with the receiver of the link; hence, several links overlap. This leads to a dense network with considerable amount of interference especially for links sharing channels. A practical application of our work is when smart devices in a room, hall, or concert arena have a direct communication with other smart devices in the area using limited bandwidth. Using best response technique and definitions of NE, we derive and propose an approximate way to mathematically express<jats:inline-formula><m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M7\"><m:msubsup><m:mrow><m:mi>\u03b1<\/m:mi><\/m:mrow><m:mrow><m:mtext>opt<\/m:mtext><\/m:mrow><m:mrow><m:mo>\u2217<\/m:mo><\/m:mrow><\/m:msubsup><\/m:math><\/jats:inline-formula>(referred to as<jats:inline-formula><o:math xmlns:o=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M8\"><o:msub><o:mrow><o:mover accent=\"true\"><o:mi>\u03b1<\/o:mi><o:mo stretchy=\"true\">^<\/o:mo><\/o:mover><\/o:mrow><o:mrow><o:mtext>opt<\/o:mtext><\/o:mrow><\/o:msub><\/o:math><\/jats:inline-formula>) along with its probability density function (PDF) for a specific scenario. Then, a generic equation for<jats:inline-formula><s:math xmlns:s=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M9\"><s:msub><s:mrow><s:mover accent=\"true\"><s:mi>\u03b1<\/s:mi><s:mo stretchy=\"true\">^<\/s:mo><\/s:mover><\/s:mrow><s:mrow><s:mtext>opt<\/s:mtext><\/s:mrow><\/s:msub><\/s:math><\/jats:inline-formula>is inferred for varying network sizes (links) and available resources (channels). Implementing such a policy enhances the total throughput of the distributed wireless network by up to 15%. In a more general setting, our distributed policy can achieve up to 75% of the maximum total throughput (benchmark value reached by centralized solution via exhaustive search) at a fraction of the time and computation resources.<\/jats:p>","DOI":"10.1155\/2020\/8868443","type":"journal-article","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T01:35:08Z","timestamp":1604712908000},"page":"1-11","source":"Crossref","is-referenced-by-count":2,"title":["Channel Allocation Policy for Distributed Wireless Network: Derivation and Analysis of Optimal Interference"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9203-394X","authenticated-orcid":true,"given":"Amulya","family":"Bhattarai","sequence":"first","affiliation":[{"name":"School of Information, Computer and Communication Technology (ICT), SIIT, Thammasat University, Pathum Thani 12000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6944-0296","authenticated-orcid":true,"given":"Prapun","family":"Suksompong","sequence":"additional","affiliation":[{"name":"School of Information, Computer and Communication Technology (ICT), SIIT, Thammasat University, Pathum Thani 12000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chalie","family":"Charoenlarpnopparut","sequence":"additional","affiliation":[{"name":"School of Information, Computer and Communication Technology (ICT), SIIT, Thammasat University, Pathum Thani 12000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2532458"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2014.7000985"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.120401"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.842567"},{"volume-title":"Game Theory for Next Generation Wireless and Communication Networks Modeling, Analysis and Design","year":"2019","author":"H. Zhu","key":"5"},{"article-title":"FCC reports, spectrum policy task force","year":"2002","author":"FCC","key":"6"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2012.010312.110732"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/98.788210"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.839380"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/glocom.2010.5683562"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310391"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2010.2098427"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2306255"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2013017"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933966"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.122310.000119"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ccnc.2017.7983109"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.872889"},{"volume-title":"Cognitive Radio Networking and Security, a Game-Theoretic View","year":"2012","author":"K. J. Ray Liu","key":"20"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ecticon.2013.6559481"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/bicta.2010.5645094"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/ecticon.2014.6839829"},{"issue":"1","key":"24","doi-asserted-by":"crossref","first-page":"36","DOI":"10.37936\/ecti-eec.2016141.171090","article-title":"Policies for channel allocation in cognitive radio networks using game theory","volume":"14","author":"A. Bhattarai","year":"2016","journal-title":"ECTI Transactions on Electrical Engineering, Electronics, and Communications"},{"key":"25","first-page":"60","article-title":"Introduction to wireless and mobile systems, 3.4 free space propagation","volume-title":"Cengage Learning","author":"D. P. Agrawal","year":"2011","edition":"3rd"},{"key":"26","article-title":"Path Loss","volume-title":"MATLAB central file exchange","author":"D. B. R. Rawat","year":"2007"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/aps.2005.1552223"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1949.232969"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/18.641562"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2015.2430281"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/tr.2002.808062"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/itsc.2012.6338703"},{"volume-title":"Optimal taxation, economic growth and income inequality","year":"2002","author":"G. W. Scully","key":"34"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.E98.B.1804"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2020\/8868443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2020\/8868443.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2020\/8868443.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T04:51:23Z","timestamp":1669524683000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/wcmc\/2020\/8868443\/"}},"subtitle":[],"editor":[{"given":"Pietro","family":"Manzoni","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,11,6]]},"references-count":35,"alternative-id":["8868443","8868443"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8868443","relation":{},"ISSN":["1530-8677","1530-8669"],"issn-type":[{"type":"electronic","value":"1530-8677"},{"type":"print","value":"1530-8669"}],"subject":[],"published":{"date-parts":[[2020,11,6]]}}}