2018
DOI: 10.1109/twc.2018.2803816
|View full text |Cite
|
Sign up to set email alerts
|

Edge-Caching Wireless Networks: Performance Analysis and Optimization

Abstract: Edge-caching has received much attention as an efficient technique to reduce delivery latency and network congestion during peak-traffic times by bringing data closer to end users. Existing works usually design caching algorithms separately from physical layer design. In this paper, we analyse edge-caching wireless networks by taking into account the caching capability when designing the signal transmission.Particularly, we investigate multi-layer caching where both base station (BS) and users are capable of s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
53
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
3
2

Relationship

4
5

Authors

Journals

citations
Cited by 87 publications
(53 citation statements)
references
References 34 publications
0
53
0
Order By: Relevance
“…Therefore, the total delivery time in the HD mode is the summation of the delivery time on the backhaul link and on the access link. The delivery time of the HD mode is computed by the standard max-min design [3]. Fig.…”
Section: Comparison With Half-duplex Systemsmentioning
confidence: 99%
“…Therefore, the total delivery time in the HD mode is the summation of the delivery time on the backhaul link and on the access link. The delivery time of the HD mode is computed by the standard max-min design [3]. Fig.…”
Section: Comparison With Half-duplex Systemsmentioning
confidence: 99%
“…A holistic view of communication, computation, and caching is presented in [18] using graphbased representations as learning methods for innovative resource allocation techniques. The performance of the edgecaching as well as the energy efficiency and delivery time is investigated in [19] with quality of service (QoS) constraints.…”
Section: Related Workmentioning
confidence: 99%
“…Proposition 2, where its proof can be found in [14] due to space limitation, derives the access links' throughput under the coded-caching strategy for arbitrary value of M u . In the special case δ = 0 and MuK N ∈ Z + , Q cod,AC is shorten as…”
Section: A Caching Modelmentioning
confidence: 99%
“…2) Signal transmission for coded caching strategy: One can use the beamforming design derived in the previous subsection to delivery the requested files in the coded-caching method. However, since the coded caching strategy transmits a common (coded) message X S (see [3], [14] for details) to all users during the delivery phase, using the orthogonal beams might result in resources redundancy. Instead, the BS applies physical-layer multicasting to precode the coded data [12].…”
Section: B Transmission Modelmentioning
confidence: 99%