Tradeoff Between Ergodic Rate and Delivery Latency in Fog Radio Access Networks

Wireless content caching has recently been considered as an efficient way in fog radio access networks (F-RANs) to alleviate the heavy burden on capacity-limited fronthaul links and reduce delivery latency. In this paper, an advanced minimal delay association policy is proposed to minimize latency w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications 2020-04, Vol.19 (4), p.2240-2251
Hauptverfasser: Yin, Bonan, Peng, Mugen, Yan, Shi, Hu, Chunjing
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2251
container_issue 4
container_start_page 2240
container_title IEEE transactions on wireless communications
container_volume 19
creator Yin, Bonan
Peng, Mugen
Yan, Shi
Hu, Chunjing
description Wireless content caching has recently been considered as an efficient way in fog radio access networks (F-RANs) to alleviate the heavy burden on capacity-limited fronthaul links and reduce delivery latency. In this paper, an advanced minimal delay association policy is proposed to minimize latency while guaranteeing spectral efficiency in F-RANs. By utilizing stochastic geometry and queueing theory, closed-form expressions of successful delivery probability, average ergodic rate, and average delivery latency are derived, where both the traditional association policy based on accessing the base station with maximal received power and the proposed minimal delay association policy are concerned. Impacts of key operating parameters on the aforementioned performance metrics are exploited. It is shown that the proposed association policy has a better delivery latency than the traditional association policy. Increasing the cache size of fog-computing based access points (F-APs) can more significantly reduce average delivery latency, compared with increasing the density of F-APs. Meanwhile, the latter comes at the expense of decreasing average ergodic rate. This implies the deployment of large cache size at F-APs rather than high density of F-APs can promote performance effectively in F-RANs.
doi_str_mv 10.1109/TWC.2019.2963308
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_8952901</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8952901</ieee_id><sourcerecordid>2389362574</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-955308b5a2d595302e7a73f0923a992f0642bcc134bda1fc7324aa0e3b41ab343</originalsourceid><addsrcrecordid>eNo9kNFLwzAQh4MoOKfvgi8BnzuTXNM2j3NuKgwHMvExpOl1dM5mJt1k_70pGz7dcXy_u-Mj5JazEedMPSw_JyPBuBoJlQGw4owMuJRFIkRanPc9ZAkXeXZJrkJYM8bzTMoBWSy9qdDVNX3E7hexpVO_clVj6bvpkJq2ok-4afboD3QeJ6090KalM7eKQNU4OrYWQ6BvMe38V7gmF7XZBLw51SH5mE2Xk5dkvnh-nYzniQWALlFSxh9LaUQlVWwF5iaHmikBRilRsywVpbUc0rIyvLY5iNQYhlCm3JSQwpDcH_duvfvZYej02u18G09qAYWCTMi8p9iRst6F4LHWW998G3_QnOlem47adK9Nn7TFyN0x0iDiP14oKRTj8Ad4n2cQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2389362574</pqid></control><display><type>article</type><title>Tradeoff Between Ergodic Rate and Delivery Latency in Fog Radio Access Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Yin, Bonan ; Peng, Mugen ; Yan, Shi ; Hu, Chunjing</creator><creatorcontrib>Yin, Bonan ; Peng, Mugen ; Yan, Shi ; Hu, Chunjing</creatorcontrib><description>Wireless content caching has recently been considered as an efficient way in fog radio access networks (F-RANs) to alleviate the heavy burden on capacity-limited fronthaul links and reduce delivery latency. In this paper, an advanced minimal delay association policy is proposed to minimize latency while guaranteeing spectral efficiency in F-RANs. By utilizing stochastic geometry and queueing theory, closed-form expressions of successful delivery probability, average ergodic rate, and average delivery latency are derived, where both the traditional association policy based on accessing the base station with maximal received power and the proposed minimal delay association policy are concerned. Impacts of key operating parameters on the aforementioned performance metrics are exploited. It is shown that the proposed association policy has a better delivery latency than the traditional association policy. Increasing the cache size of fog-computing based access points (F-APs) can more significantly reduce average delivery latency, compared with increasing the density of F-APs. Meanwhile, the latter comes at the expense of decreasing average ergodic rate. This implies the deployment of large cache size at F-APs rather than high density of F-APs can promote performance effectively in F-RANs.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2019.2963308</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Caching ; Delays ; Density ; Ergodic processes ; Fog radio access networks ; Geometry ; Interference ; Performance measurement ; queueing theory ; Queues ; Queuing theory ; Radio access networks ; Reliability ; stochastic geometry ; Wireless communication ; wireless content caching</subject><ispartof>IEEE transactions on wireless communications, 2020-04, Vol.19 (4), p.2240-2251</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-955308b5a2d595302e7a73f0923a992f0642bcc134bda1fc7324aa0e3b41ab343</citedby><cites>FETCH-LOGICAL-c333t-955308b5a2d595302e7a73f0923a992f0642bcc134bda1fc7324aa0e3b41ab343</cites><orcidid>0000-0002-5953-1979 ; 0000-0002-7406-2533 ; 0000-0002-4755-7231</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8952901$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8952901$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yin, Bonan</creatorcontrib><creatorcontrib>Peng, Mugen</creatorcontrib><creatorcontrib>Yan, Shi</creatorcontrib><creatorcontrib>Hu, Chunjing</creatorcontrib><title>Tradeoff Between Ergodic Rate and Delivery Latency in Fog Radio Access Networks</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>Wireless content caching has recently been considered as an efficient way in fog radio access networks (F-RANs) to alleviate the heavy burden on capacity-limited fronthaul links and reduce delivery latency. In this paper, an advanced minimal delay association policy is proposed to minimize latency while guaranteeing spectral efficiency in F-RANs. By utilizing stochastic geometry and queueing theory, closed-form expressions of successful delivery probability, average ergodic rate, and average delivery latency are derived, where both the traditional association policy based on accessing the base station with maximal received power and the proposed minimal delay association policy are concerned. Impacts of key operating parameters on the aforementioned performance metrics are exploited. It is shown that the proposed association policy has a better delivery latency than the traditional association policy. Increasing the cache size of fog-computing based access points (F-APs) can more significantly reduce average delivery latency, compared with increasing the density of F-APs. Meanwhile, the latter comes at the expense of decreasing average ergodic rate. This implies the deployment of large cache size at F-APs rather than high density of F-APs can promote performance effectively in F-RANs.</description><subject>Caching</subject><subject>Delays</subject><subject>Density</subject><subject>Ergodic processes</subject><subject>Fog radio access networks</subject><subject>Geometry</subject><subject>Interference</subject><subject>Performance measurement</subject><subject>queueing theory</subject><subject>Queues</subject><subject>Queuing theory</subject><subject>Radio access networks</subject><subject>Reliability</subject><subject>stochastic geometry</subject><subject>Wireless communication</subject><subject>wireless content caching</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kNFLwzAQh4MoOKfvgi8BnzuTXNM2j3NuKgwHMvExpOl1dM5mJt1k_70pGz7dcXy_u-Mj5JazEedMPSw_JyPBuBoJlQGw4owMuJRFIkRanPc9ZAkXeXZJrkJYM8bzTMoBWSy9qdDVNX3E7hexpVO_clVj6bvpkJq2ok-4afboD3QeJ6090KalM7eKQNU4OrYWQ6BvMe38V7gmF7XZBLw51SH5mE2Xk5dkvnh-nYzniQWALlFSxh9LaUQlVWwF5iaHmikBRilRsywVpbUc0rIyvLY5iNQYhlCm3JSQwpDcH_duvfvZYej02u18G09qAYWCTMi8p9iRst6F4LHWW998G3_QnOlem47adK9Nn7TFyN0x0iDiP14oKRTj8Ad4n2cQ</recordid><startdate>202004</startdate><enddate>202004</enddate><creator>Yin, Bonan</creator><creator>Peng, Mugen</creator><creator>Yan, Shi</creator><creator>Hu, Chunjing</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-5953-1979</orcidid><orcidid>https://orcid.org/0000-0002-7406-2533</orcidid><orcidid>https://orcid.org/0000-0002-4755-7231</orcidid></search><sort><creationdate>202004</creationdate><title>Tradeoff Between Ergodic Rate and Delivery Latency in Fog Radio Access Networks</title><author>Yin, Bonan ; Peng, Mugen ; Yan, Shi ; Hu, Chunjing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-955308b5a2d595302e7a73f0923a992f0642bcc134bda1fc7324aa0e3b41ab343</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Caching</topic><topic>Delays</topic><topic>Density</topic><topic>Ergodic processes</topic><topic>Fog radio access networks</topic><topic>Geometry</topic><topic>Interference</topic><topic>Performance measurement</topic><topic>queueing theory</topic><topic>Queues</topic><topic>Queuing theory</topic><topic>Radio access networks</topic><topic>Reliability</topic><topic>stochastic geometry</topic><topic>Wireless communication</topic><topic>wireless content caching</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yin, Bonan</creatorcontrib><creatorcontrib>Peng, Mugen</creatorcontrib><creatorcontrib>Yan, Shi</creatorcontrib><creatorcontrib>Hu, Chunjing</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yin, Bonan</au><au>Peng, Mugen</au><au>Yan, Shi</au><au>Hu, Chunjing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Tradeoff Between Ergodic Rate and Delivery Latency in Fog Radio Access Networks</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2020-04</date><risdate>2020</risdate><volume>19</volume><issue>4</issue><spage>2240</spage><epage>2251</epage><pages>2240-2251</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>Wireless content caching has recently been considered as an efficient way in fog radio access networks (F-RANs) to alleviate the heavy burden on capacity-limited fronthaul links and reduce delivery latency. In this paper, an advanced minimal delay association policy is proposed to minimize latency while guaranteeing spectral efficiency in F-RANs. By utilizing stochastic geometry and queueing theory, closed-form expressions of successful delivery probability, average ergodic rate, and average delivery latency are derived, where both the traditional association policy based on accessing the base station with maximal received power and the proposed minimal delay association policy are concerned. Impacts of key operating parameters on the aforementioned performance metrics are exploited. It is shown that the proposed association policy has a better delivery latency than the traditional association policy. Increasing the cache size of fog-computing based access points (F-APs) can more significantly reduce average delivery latency, compared with increasing the density of F-APs. Meanwhile, the latter comes at the expense of decreasing average ergodic rate. This implies the deployment of large cache size at F-APs rather than high density of F-APs can promote performance effectively in F-RANs.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TWC.2019.2963308</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0002-5953-1979</orcidid><orcidid>https://orcid.org/0000-0002-7406-2533</orcidid><orcidid>https://orcid.org/0000-0002-4755-7231</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1536-1276
ispartof IEEE transactions on wireless communications, 2020-04, Vol.19 (4), p.2240-2251
issn 1536-1276
1558-2248
language eng
recordid cdi_ieee_primary_8952901
source IEEE Electronic Library (IEL)
subjects Caching
Delays
Density
Ergodic processes
Fog radio access networks
Geometry
Interference
Performance measurement
queueing theory
Queues
Queuing theory
Radio access networks
Reliability
stochastic geometry
Wireless communication
wireless content caching
title Tradeoff Between Ergodic Rate and Delivery Latency in Fog Radio Access Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T20%3A42%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Tradeoff%20Between%20Ergodic%20Rate%20and%20Delivery%20Latency%20in%20Fog%20Radio%20Access%20Networks&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Yin,%20Bonan&rft.date=2020-04&rft.volume=19&rft.issue=4&rft.spage=2240&rft.epage=2251&rft.pages=2240-2251&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2019.2963308&rft_dat=%3Cproquest_RIE%3E2389362574%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2389362574&rft_id=info:pmid/&rft_ieee_id=8952901&rfr_iscdi=true