Loading…

Self-organized Spectrum Access in Small-cell Networks with Dynamic Loads

This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner...

Full description

Saved in:
Bibliographic Details
Published in:KSII transactions on Internet and information systems 2016, 10(5), , pp.1976-1997
Main Authors: Ducheng Wu, Qihui Wu, Yuhua Xu
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 1997
container_issue 5
container_start_page 1976
container_title KSII transactions on Internet and information systems
container_volume 10
creator Ducheng Wu
Qihui Wu
Yuhua Xu
description This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs’ dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection. KCI Citation Count: 0
doi_str_mv 10.3837/tiis.2016.05.002
format article
fullrecord <record><control><sourceid>nrf_cross</sourceid><recordid>TN_cdi_nrf_kci_oai_kci_go_kr_ARTI_1280802</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_kci_go_kr_ARTI_1280802</sourcerecordid><originalsourceid>FETCH-LOGICAL-c272t-65d99512740f002973a5e7c4d96d5bd6043648e5aae6a466f59a22a41b82a0043</originalsourceid><addsrcrecordid>eNpNkD1PwzAQhi0EElXpzuiVIeHsxHYyVuWjlSKQSJmtq-MU03xUdlBVfj0pZeCW96R7dHr1EHLLIE6yRN0PzoWYA5MxiBiAX5AJy5WMFFfq8t9-TWYhfMI4YoQ5m5BlaZs66v0WO_dtK1rurRn8V0vnxtgQqOto2WLTRMY2DX2xw6H3u0APbvigD8cOW2do0WMVbshVjU2ws7-ckvenx_ViGRWvz6vFvIgMV3yIpKjyXDCuUqjHorlKUFhl0iqXldhUEtJEppkViFZiKmUtcuQcU7bJOMJ4nZK789_O13pnnO7R_ea21zuv52_rlWY8gwz4yMKZNb4Pwdta771r0R81A30Sp0_i9EmcBqHHPskPIONf7g</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Self-organized Spectrum Access in Small-cell Networks with Dynamic Loads</title><source>EZB Electronic Journals Library</source><creator>Ducheng Wu ; Qihui Wu ; Yuhua Xu</creator><creatorcontrib>Ducheng Wu ; Qihui Wu ; Yuhua Xu</creatorcontrib><description>This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs’ dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection. KCI Citation Count: 0</description><identifier>ISSN: 1976-7277</identifier><identifier>EISSN: 1976-7277</identifier><identifier>DOI: 10.3837/tiis.2016.05.002</identifier><language>eng</language><publisher>한국인터넷정보학회</publisher><subject>컴퓨터학</subject><ispartof>KSII Transactions on Internet and Information Systems, 2016, 10(5), , pp.1976-1997</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27922,27923</link.rule.ids><backlink>$$Uhttps://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART002165238$$DAccess content in National Research Foundation of Korea (NRF)$$Hfree_for_read</backlink></links><search><creatorcontrib>Ducheng Wu</creatorcontrib><creatorcontrib>Qihui Wu</creatorcontrib><creatorcontrib>Yuhua Xu</creatorcontrib><title>Self-organized Spectrum Access in Small-cell Networks with Dynamic Loads</title><title>KSII transactions on Internet and information systems</title><description>This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs’ dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection. KCI Citation Count: 0</description><subject>컴퓨터학</subject><issn>1976-7277</issn><issn>1976-7277</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNpNkD1PwzAQhi0EElXpzuiVIeHsxHYyVuWjlSKQSJmtq-MU03xUdlBVfj0pZeCW96R7dHr1EHLLIE6yRN0PzoWYA5MxiBiAX5AJy5WMFFfq8t9-TWYhfMI4YoQ5m5BlaZs66v0WO_dtK1rurRn8V0vnxtgQqOto2WLTRMY2DX2xw6H3u0APbvigD8cOW2do0WMVbshVjU2ws7-ckvenx_ViGRWvz6vFvIgMV3yIpKjyXDCuUqjHorlKUFhl0iqXldhUEtJEppkViFZiKmUtcuQcU7bJOMJ4nZK789_O13pnnO7R_ea21zuv52_rlWY8gwz4yMKZNb4Pwdta771r0R81A30Sp0_i9EmcBqHHPskPIONf7g</recordid><startdate>20160531</startdate><enddate>20160531</enddate><creator>Ducheng Wu</creator><creator>Qihui Wu</creator><creator>Yuhua Xu</creator><general>한국인터넷정보학회</general><scope>AAYXX</scope><scope>CITATION</scope><scope>ACYCR</scope></search><sort><creationdate>20160531</creationdate><title>Self-organized Spectrum Access in Small-cell Networks with Dynamic Loads</title><author>Ducheng Wu ; Qihui Wu ; Yuhua Xu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c272t-65d99512740f002973a5e7c4d96d5bd6043648e5aae6a466f59a22a41b82a0043</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>컴퓨터학</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ducheng Wu</creatorcontrib><creatorcontrib>Qihui Wu</creatorcontrib><creatorcontrib>Yuhua Xu</creatorcontrib><collection>CrossRef</collection><collection>Korean Citation Index</collection><jtitle>KSII transactions on Internet and information systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ducheng Wu</au><au>Qihui Wu</au><au>Yuhua Xu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Self-organized Spectrum Access in Small-cell Networks with Dynamic Loads</atitle><jtitle>KSII transactions on Internet and information systems</jtitle><date>2016-05-31</date><risdate>2016</risdate><volume>10</volume><issue>5</issue><spage>1976</spage><epage>1997</epage><pages>1976-1997</pages><issn>1976-7277</issn><eissn>1976-7277</eissn><abstract>This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs’ dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection. KCI Citation Count: 0</abstract><pub>한국인터넷정보학회</pub><doi>10.3837/tiis.2016.05.002</doi><tpages>22</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1976-7277
ispartof KSII Transactions on Internet and Information Systems, 2016, 10(5), , pp.1976-1997
issn 1976-7277
1976-7277
language eng
recordid cdi_nrf_kci_oai_kci_go_kr_ARTI_1280802
source EZB Electronic Journals Library
subjects 컴퓨터학
title Self-organized Spectrum Access in Small-cell Networks with Dynamic Loads
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T18%3A08%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-nrf_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Self-organized%20Spectrum%20Access%20in%20Small-cell%20Networks%20with%20Dynamic%20Loads&rft.jtitle=KSII%20transactions%20on%20Internet%20and%20information%20systems&rft.au=Ducheng%20Wu&rft.date=2016-05-31&rft.volume=10&rft.issue=5&rft.spage=1976&rft.epage=1997&rft.pages=1976-1997&rft.issn=1976-7277&rft.eissn=1976-7277&rft_id=info:doi/10.3837/tiis.2016.05.002&rft_dat=%3Cnrf_cross%3Eoai_kci_go_kr_ARTI_1280802%3C/nrf_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c272t-65d99512740f002973a5e7c4d96d5bd6043648e5aae6a466f59a22a41b82a0043%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true