2020
DOI: 10.1016/j.jnca.2019.102467
|View full text |Cite
|
Sign up to set email alerts
|

Optimal caching policy for wireless content delivery in D2D networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(17 citation statements)
references
References 20 publications
0
12
0
Order By: Relevance
“…In this study, three different simulation scenarios were set up and were compared with the betweenness-based algorithm (referred to as the VC model) [35]. e FIR-based model proposed in this study and the VC model were used for identifying the Input: node set G Output: structural hole constraint coefficient, L ni , of all nodes in G (1) for i ∈ G: //G is the node set of the opportunistic network (2) Calculate k (i) (3) for i ∈ G: (4) Calculate Q (i) (5) for i ∈ G: (6) for j ∈ r(i): //r(i) is the set of all neighboring nodes of node i (7) Calculate P ij (8) for q ∈ (r(i) ∩ r(j)): (9) Calculate P iq and P qj (10) Calculate RC i (11) for i ∈ G: (12) Calculate L i (13) for i ∈ G: (14) Calculate L ni (15) return Ln ALGORITHM 1: Algorithm for calculating the importance of structural holes.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this study, three different simulation scenarios were set up and were compared with the betweenness-based algorithm (referred to as the VC model) [35]. e FIR-based model proposed in this study and the VC model were used for identifying the Input: node set G Output: structural hole constraint coefficient, L ni , of all nodes in G (1) for i ∈ G: //G is the node set of the opportunistic network (2) Calculate k (i) (3) for i ∈ G: (4) Calculate Q (i) (5) for i ∈ G: (6) for j ∈ r(i): //r(i) is the set of all neighboring nodes of node i (7) Calculate P ij (8) for q ∈ (r(i) ∩ r(j)): (9) Calculate P iq and P qj (10) Calculate RC i (11) for i ∈ G: (12) Calculate L i (13) for i ∈ G: (14) Calculate L ni (15) return Ln ALGORITHM 1: Algorithm for calculating the importance of structural holes.…”
Section: Methodsmentioning
confidence: 99%
“…Ferry nodes moving between different regions connect to different areas. At present, research studies on ferry nodes mainly include routing algorithms based on ferry nodes [3][4][5][6][7][8][9][10][11][12], ferry node motion path planning [13][14][15][16][17][18][19], and ferry node network signal coverage [20][21][22][23].…”
Section: Introductionmentioning
confidence: 99%
“…Likewise, in [33], the authors VOLUME , presented a developing learning-based content caching strategy in edge networks which flexibly analyzes time-varying content popularity and when the cache is filled, it determines which contents should be refreshed. Besides, in [34], authors present an incentive caching policy in which networks incorporate preferences of the users and group mobility together with Device-to-Device (D2D) communication for solving the caching problem in mobile devices. Also, authors in [18] use the echo state network and the long short-term memory to predict the content popularity, along with the mobility of the users in the D2D communication technology.…”
Section: Related Workmentioning
confidence: 99%
“…From the wide variety of metrics available for computing significance of caching strategies [ 61 ], this work evaluates the performance of proposed strategy based on the following:…”
Section: Evaluation Scenariomentioning
confidence: 99%