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

Secure and Energy-Efficient Transmissions in Cache-Enabled Heterogeneous Cellular Networks: Performance Analysis and Optimization

Abstract: This paper studies physical-layer security for a cache-enabled heterogeneous cellular network comprised of a macro base station and multiple small base stations (SBSs). We investigate a joint design on caching placement and file delivery for realizing secure and energy-efficient transmissions against randomly distributed eavesdroppers. We propose a novel hybrid "most popular content" and "largest content diversity" caching placement policy to distribute files of different popularities. Depending on the availab… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 36 publications
(25 citation statements)
references
References 43 publications
0
24
0
Order By: Relevance
“…Herein, the secrecy throughput denotes the amount of successfully delivered secret information subject to certain reliability and secrecy constraints. In fact, the secrecy throughput has extensively been taken as an optimization objective for the design of secure transmissions in slow fading channels in the context of infinite blocklength [21]- [25]. Nevertheless, to optimize the secrecy throughput under the constraint of finite blocklength is difficult, and the results derived for infinite blocklength, e.g., [21]- [25], cannot be directly applied.…”
Section: A Previous Work and Motivationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Herein, the secrecy throughput denotes the amount of successfully delivered secret information subject to certain reliability and secrecy constraints. In fact, the secrecy throughput has extensively been taken as an optimization objective for the design of secure transmissions in slow fading channels in the context of infinite blocklength [21]- [25]. Nevertheless, to optimize the secrecy throughput under the constraint of finite blocklength is difficult, and the results derived for infinite blocklength, e.g., [21]- [25], cannot be directly applied.…”
Section: A Previous Work and Motivationsmentioning
confidence: 99%
“…In fact, the secrecy throughput has extensively been taken as an optimization objective for the design of secure transmissions in slow fading channels in the context of infinite blocklength [21]- [25]. Nevertheless, to optimize the secrecy throughput under the constraint of finite blocklength is difficult, and the results derived for infinite blocklength, e.g., [21]- [25], cannot be directly applied. Indeed, the blocklength itself is an optimization variable, and it couples with other variables in a sophisticated manner which makes the optimization problem intractable.…”
Section: A Previous Work and Motivationsmentioning
confidence: 99%
“…Content caching and distribution in presence of eavesdroppers is investigated in [190], [191]. Zheng et al [190] maximized both secrecy energy efficiency and throughput considering content diversity and popularity. Xiang et al [191] explored multiple-input-multiple-output content transport and scalable encoding of videos.…”
Section: Trade-off Analysis In Green Caching Systemsmentioning
confidence: 99%
“…When M k = M and φ k = φ, for all k ∈ K, based on (25), we have (55), as shown at the top of the next page, where V m,M (ξ, θ  ) and W m (θ  ) are given by (22) and (23), respectively. First, it is easy to see that…”
Section: Appendix B Proof Of Propositionmentioning
confidence: 99%
“…The authors in [20]- [22] only considered deploying singleantenna at each BS, and therefore, their proposed caching schemes may not achieve desirable security performance in multi-antenna wireless networks. In addition, unlike [20], [22], to deliberately confuse the eavesdroppers, an artificial-noiseaided transmission strategy was further considered in [21].…”
Section: Introductionmentioning
confidence: 99%