Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access Networks
Fog radio access network (F-RAN) has the significant advantages of local radio signal processing, cooperative radio resource management, and distributed storage capability to tackle the massive users demand at the edge. However, due to constrained fronthaul capacity, achieving ultra-low latency for...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8290728/ |
id |
doaj-40bd92b4434b4478a1216431eaef8ba9 |
---|---|
record_format |
Article |
spelling |
doaj-40bd92b4434b4478a1216431eaef8ba92021-03-29T21:01:02ZengIEEEIEEE Access2169-35362018-01-016174421745410.1109/ACCESS.2018.28053038290728Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access NetworksG. M. Shafiqur Rahman0Mugen Peng1https://orcid.org/0000-0002-4755-7231Kecheng Zhang2Shanzhi Chen3Key Laboratory of Universal Wireless Communications for Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaKey Laboratory of Universal Wireless Communications for Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaKey Laboratory of Universal Wireless Communications for Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaState Key Laboratory of Wireless Mobile Communications, China Academy of Telecommunications Technology, and the Datang Telecom Technology and Industry Group, Beijing, ChinaFog radio access network (F-RAN) has the significant advantages of local radio signal processing, cooperative radio resource management, and distributed storage capability to tackle the massive users demand at the edge. However, due to constrained fronthaul capacity, achieving ultra-low latency for emerging cellular networks is still challenging. This paper focuses on alleviating the heavy burden on fronthaul and achieving ultra-low latency by proposing a loosely coupled architecture in the F-RAN where a large number of F-RAN nodes are able to participate in joint distributed computing and content sharing regardless of nearness communication by satisfying the minimum latency demand. A mixed-integer nonlinear programming problem is formulated to achieve the ultra-low latency under the constraint of fronthaul capacity and computing capability of each F-RAN node. To solve this problem, a joint distributed computing scheme and a distributed content sharing scheme are proposed with the greedy algorithm to find a sub-optimal solution, in which the weighted minimum mean square error approach is adopted to optimize the transmission rate. Numerical results reveal that the ultra-low latency can be achieved in F-RANs by properly utilizing the loosely coupled architecture.https://ieeexplore.ieee.org/document/8290728/Fog radio access networks (F-RANs)loosely coupled architectureultra-low latencyedge computing |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
G. M. Shafiqur Rahman Mugen Peng Kecheng Zhang Shanzhi Chen |
spellingShingle |
G. M. Shafiqur Rahman Mugen Peng Kecheng Zhang Shanzhi Chen Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access Networks IEEE Access Fog radio access networks (F-RANs) loosely coupled architecture ultra-low latency edge computing |
author_facet |
G. M. Shafiqur Rahman Mugen Peng Kecheng Zhang Shanzhi Chen |
author_sort |
G. M. Shafiqur Rahman |
title |
Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access Networks |
title_short |
Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access Networks |
title_full |
Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access Networks |
title_fullStr |
Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access Networks |
title_full_unstemmed |
Radio Resource Allocation for Achieving Ultra-Low Latency in Fog Radio Access Networks |
title_sort |
radio resource allocation for achieving ultra-low latency in fog radio access networks |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2018-01-01 |
description |
Fog radio access network (F-RAN) has the significant advantages of local radio signal processing, cooperative radio resource management, and distributed storage capability to tackle the massive users demand at the edge. However, due to constrained fronthaul capacity, achieving ultra-low latency for emerging cellular networks is still challenging. This paper focuses on alleviating the heavy burden on fronthaul and achieving ultra-low latency by proposing a loosely coupled architecture in the F-RAN where a large number of F-RAN nodes are able to participate in joint distributed computing and content sharing regardless of nearness communication by satisfying the minimum latency demand. A mixed-integer nonlinear programming problem is formulated to achieve the ultra-low latency under the constraint of fronthaul capacity and computing capability of each F-RAN node. To solve this problem, a joint distributed computing scheme and a distributed content sharing scheme are proposed with the greedy algorithm to find a sub-optimal solution, in which the weighted minimum mean square error approach is adopted to optimize the transmission rate. Numerical results reveal that the ultra-low latency can be achieved in F-RANs by properly utilizing the loosely coupled architecture. |
topic |
Fog radio access networks (F-RANs) loosely coupled architecture ultra-low latency edge computing |
url |
https://ieeexplore.ieee.org/document/8290728/ |
work_keys_str_mv |
AT gmshafiqurrahman radioresourceallocationforachievingultralowlatencyinfogradioaccessnetworks AT mugenpeng radioresourceallocationforachievingultralowlatencyinfogradioaccessnetworks AT kechengzhang radioresourceallocationforachievingultralowlatencyinfogradioaccessnetworks AT shanzhichen radioresourceallocationforachievingultralowlatencyinfogradioaccessnetworks |
_version_ |
1724193712680992768 |