2017
DOI: 10.1109/tnet.2017.2718021
|View full text |Cite
|
Sign up to set email alerts
|

Throughput and Delay Scaling of Content-Centric Ad Hoc and Heterogeneous Wireless Networks

Abstract: We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to be uniformly distributed in the network area. Each node has a limited-capacity content store, which it uses to cache contents. We propose an achievable caching and transmission scheme whereby requesters retrieve content from the caching point which is closest in Euclidean d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(21 citation statements)
references
References 24 publications
0
21
0
Order By: Relevance
“…In the next section, we introduce the order-optimal cache allocation strategy to characterize the order-optimal throughput-delay trade-off. [26]. That is, we may conclude that performance on the throughput-delay trade-off of both cache-enabled networks is the same as far as the content delivery multihop routing protocols are employed.…”
Section: Lemmamentioning
confidence: 82%
See 2 more Smart Citations
“…In the next section, we introduce the order-optimal cache allocation strategy to characterize the order-optimal throughput-delay trade-off. [26]. That is, we may conclude that performance on the throughput-delay trade-off of both cache-enabled networks is the same as far as the content delivery multihop routing protocols are employed.…”
Section: Lemmamentioning
confidence: 82%
“…According to the same analysis in [26], it is not difficult to show that when α ≥ 3/2, the order-optimal throughputdelay trade-off in Theorem 1 is given by λ(n) = Θ (D(n)) by using device-to-device multihop communication without FAP support. Therefore, for the rest of this paper, we focus on the case where α < 3/2 in solving the optimal content replication problem.…”
Section: Remark 1 Based On the Above Result It Is Not Difficult To mentioning
confidence: 99%
See 1 more Smart Citation
“…Note that the total caching constraint in (4) is a relaxed version of the individual caching constraints [30] and the constraint in (5) is to make sure that the network contains at least 1 and at most n copies of the each content. 1 Our problem formulation can be extended to a more general case having heterogeneous cache sizes by replacing the total caching constraints in (4) and (6) by…”
Section: B System Modelmentioning
confidence: 99%
“…Now, using (29), (30), and (32), we can establish the following equivalent optimization problem to the original problem in (27):…”
Section: ) Simplifying Objective Functionmentioning
confidence: 99%