Channel Allocation Policy for Distributed Wireless Network: Derivation and Analysis of Optimal Interference
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...
Gespeichert in:
| Veröffentlicht in: | Wireless communications and mobile computing 2020, Vol.2020 (2020), p.1-11 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 11 |
|---|---|
| container_issue | 2020 |
| container_start_page | 1 |
| container_title | Wireless communications and mobile computing |
| container_volume | 2020 |
| creator | Bhattarai, Amulya Charoenlarpnopparut, Chalie Suksompong, Prapun |
| description | 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 (αopt∗) to the link’s 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 C−1 links occupies its own channel, and the remaining N−C+1 links share the remaining one channel, where N is the number of links and C is the number of channels in the network. The links (transmitters and receivers) are randomly located and C |
| doi_str_mv | 10.1155/2020/8868443 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2460647131</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2460647131</sourcerecordid><originalsourceid>FETCH-LOGICAL-c360t-99a52a8c8a6733ee586ec57ecefac3b087cc3377825e8347f0fbe0113ed337753</originalsourceid><addsrcrecordid>eNqF0E1PAjEQBuDGaCKiN8-miUddabfbbfFGwA8SIh40HjelTEOhbrEtEv69S5bo0VMnzTOTNy9Cl5TcUcp5Lyc56UlZyqJgR6hDOSOZLIU4_p3L_ik6i3FJCGEkpx20Gi5UXYPDA-e8Vsn6Gr96Z_UOGx_wyMYU7GyTYI4_bAAHMeIXSFsfVvd4BMF-tzuqnuNBrdwu2oi9wdN1sp_K4XGdIBgIUGs4RydGuQgXh7eL3h8f3obP2WT6NB4OJplmJUlZv694rqSWqhSMAXBZguYCNBil2YxIoTVjQsicg2SFMMTMgFDKYL7_5qyLrtu76-C_NhBTtfSb0ISLVV6UpCwEZbRRt63SwccYwFTr0EQOu4qSal9nta-zOtTZ8JuWL2w9V1v7n75qNTSmyf2nc1pIwtgP2UB_JA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2460647131</pqid></control><display><type>article</type><title>Channel Allocation Policy for Distributed Wireless Network: Derivation and Analysis of Optimal Interference</title><source>Wiley Online Library Open Access</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Bhattarai, Amulya ; Charoenlarpnopparut, Chalie ; Suksompong, Prapun</creator><contributor>Manzoni, Pietro ; Pietro Manzoni</contributor><creatorcontrib>Bhattarai, Amulya ; Charoenlarpnopparut, Chalie ; Suksompong, Prapun ; Manzoni, Pietro ; Pietro Manzoni</creatorcontrib><description>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 (αopt∗) to the link’s 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 C−1 links occupies its own channel, and the remaining N−C+1 links share the remaining one channel, where N is the number of links and C is the number of channels in the network. The links (transmitters and receivers) are randomly located and C<N (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 αopt∗ (referred to as α^opt) along with its probability density function (PDF) for a specific scenario. Then, a generic equation for α^opt 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.</description><identifier>ISSN: 1530-8669</identifier><identifier>EISSN: 1530-8677</identifier><identifier>DOI: 10.1155/2020/8868443</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Publishing Corporation</publisher><subject>Bandwidths ; Channels ; Communication ; Computer networks ; Convergence ; Electronic devices ; Game theory ; Interference ; Links ; Probability density functions ; Spectrum allocation ; Transmitters ; Wireless networks</subject><ispartof>Wireless communications and mobile computing, 2020, Vol.2020 (2020), p.1-11</ispartof><rights>Copyright © 2020 Amulya Bhattarai et al.</rights><rights>Copyright © 2020 Amulya Bhattarai et al. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c360t-99a52a8c8a6733ee586ec57ecefac3b087cc3377825e8347f0fbe0113ed337753</citedby><cites>FETCH-LOGICAL-c360t-99a52a8c8a6733ee586ec57ecefac3b087cc3377825e8347f0fbe0113ed337753</cites><orcidid>0000-0001-9203-394X ; 0000-0002-6944-0296</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids></links><search><contributor>Manzoni, Pietro</contributor><contributor>Pietro Manzoni</contributor><creatorcontrib>Bhattarai, Amulya</creatorcontrib><creatorcontrib>Charoenlarpnopparut, Chalie</creatorcontrib><creatorcontrib>Suksompong, Prapun</creatorcontrib><title>Channel Allocation Policy for Distributed Wireless Network: Derivation and Analysis of Optimal Interference</title><title>Wireless communications and mobile computing</title><description>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 (αopt∗) to the link’s 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 C−1 links occupies its own channel, and the remaining N−C+1 links share the remaining one channel, where N is the number of links and C is the number of channels in the network. The links (transmitters and receivers) are randomly located and C<N (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 αopt∗ (referred to as α^opt) along with its probability density function (PDF) for a specific scenario. Then, a generic equation for α^opt 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.</description><subject>Bandwidths</subject><subject>Channels</subject><subject>Communication</subject><subject>Computer networks</subject><subject>Convergence</subject><subject>Electronic devices</subject><subject>Game theory</subject><subject>Interference</subject><subject>Links</subject><subject>Probability density functions</subject><subject>Spectrum allocation</subject><subject>Transmitters</subject><subject>Wireless networks</subject><issn>1530-8669</issn><issn>1530-8677</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqF0E1PAjEQBuDGaCKiN8-miUddabfbbfFGwA8SIh40HjelTEOhbrEtEv69S5bo0VMnzTOTNy9Cl5TcUcp5Lyc56UlZyqJgR6hDOSOZLIU4_p3L_ik6i3FJCGEkpx20Gi5UXYPDA-e8Vsn6Gr96Z_UOGx_wyMYU7GyTYI4_bAAHMeIXSFsfVvd4BMF-tzuqnuNBrdwu2oi9wdN1sp_K4XGdIBgIUGs4RydGuQgXh7eL3h8f3obP2WT6NB4OJplmJUlZv694rqSWqhSMAXBZguYCNBil2YxIoTVjQsicg2SFMMTMgFDKYL7_5qyLrtu76-C_NhBTtfSb0ISLVV6UpCwEZbRRt63SwccYwFTr0EQOu4qSal9nta-zOtTZ8JuWL2w9V1v7n75qNTSmyf2nc1pIwtgP2UB_JA</recordid><startdate>2020</startdate><enddate>2020</enddate><creator>Bhattarai, Amulya</creator><creator>Charoenlarpnopparut, Chalie</creator><creator>Suksompong, Prapun</creator><general>Hindawi Publishing Corporation</general><general>Hindawi</general><general>Hindawi Limited</general><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0001-9203-394X</orcidid><orcidid>https://orcid.org/0000-0002-6944-0296</orcidid></search><sort><creationdate>2020</creationdate><title>Channel Allocation Policy for Distributed Wireless Network: Derivation and Analysis of Optimal Interference</title><author>Bhattarai, Amulya ; Charoenlarpnopparut, Chalie ; Suksompong, Prapun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c360t-99a52a8c8a6733ee586ec57ecefac3b087cc3377825e8347f0fbe0113ed337753</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Bandwidths</topic><topic>Channels</topic><topic>Communication</topic><topic>Computer networks</topic><topic>Convergence</topic><topic>Electronic devices</topic><topic>Game theory</topic><topic>Interference</topic><topic>Links</topic><topic>Probability density functions</topic><topic>Spectrum allocation</topic><topic>Transmitters</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bhattarai, Amulya</creatorcontrib><creatorcontrib>Charoenlarpnopparut, Chalie</creatorcontrib><creatorcontrib>Suksompong, Prapun</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Wireless communications and mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bhattarai, Amulya</au><au>Charoenlarpnopparut, Chalie</au><au>Suksompong, Prapun</au><au>Manzoni, Pietro</au><au>Pietro Manzoni</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Channel Allocation Policy for Distributed Wireless Network: Derivation and Analysis of Optimal Interference</atitle><jtitle>Wireless communications and mobile computing</jtitle><date>2020</date><risdate>2020</risdate><volume>2020</volume><issue>2020</issue><spage>1</spage><epage>11</epage><pages>1-11</pages><issn>1530-8669</issn><eissn>1530-8677</eissn><abstract>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 (αopt∗) to the link’s 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 C−1 links occupies its own channel, and the remaining N−C+1 links share the remaining one channel, where N is the number of links and C is the number of channels in the network. The links (transmitters and receivers) are randomly located and C<N (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 αopt∗ (referred to as α^opt) along with its probability density function (PDF) for a specific scenario. Then, a generic equation for α^opt 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.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2020/8868443</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0001-9203-394X</orcidid><orcidid>https://orcid.org/0000-0002-6944-0296</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1530-8669 |
| ispartof | Wireless communications and mobile computing, 2020, Vol.2020 (2020), p.1-11 |
| issn | 1530-8669 1530-8677 |
| language | eng |
| recordid | cdi_proquest_journals_2460647131 |
| source | Wiley Online Library Open Access; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection |
| subjects | Bandwidths Channels Communication Computer networks Convergence Electronic devices Game theory Interference Links Probability density functions Spectrum allocation Transmitters Wireless networks |
| title | Channel Allocation Policy for Distributed Wireless Network: Derivation and Analysis of Optimal Interference |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T03%3A44%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Channel%20Allocation%20Policy%20for%20Distributed%20Wireless%20Network:%20Derivation%20and%20Analysis%20of%20Optimal%20Interference&rft.jtitle=Wireless%20communications%20and%20mobile%20computing&rft.au=Bhattarai,%20Amulya&rft.date=2020&rft.volume=2020&rft.issue=2020&rft.spage=1&rft.epage=11&rft.pages=1-11&rft.issn=1530-8669&rft.eissn=1530-8677&rft_id=info:doi/10.1155/2020/8868443&rft_dat=%3Cproquest_cross%3E2460647131%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2460647131&rft_id=info:pmid/&rfr_iscdi=true |