Performance Analysis of the Content Dissemination Mechanism with Proactive Content Fetching and Full-Duplex D2D Communication: an Evolutionary Perspective

Qu, Hua; Ren, Gongye; Zhao, Jihong; Shi, Youwei; Tan, Zhenjie

doi:10.1007/s11036-018-1155-3

Cited by 4 publications

(3 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, Sun et al [40] used user preference and content popularity to determine the probability of a user requesting that content and accordingly used a collaborative caching policy to place that content. A similar approach is proposed in [36], where contents are proactively cached based on their popularity and current caching distributions. Yi et al [37] also used content popularity along with mobility and social relationship of the carrier node to manage caching decisions.…”

Section: Related Workmentioning

confidence: 99%

A dynamic content distribution scheme for decentralized sharing in tourist hotspots

Kaisar

Karmakar

2019

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Decentralized content sharing (DCS) is emerging as a suitable platform for smart mobile device users to generate and share contents seamlessly without the requirement of a centralized server. This feature is particularly important for places that lack Internet coverage such as tourist attractions where users can form an ad-hoc network and communicate opportunistically to share contents. Existing DCS approaches when applied for such type of places suffer from low delivery success rate and high latency. Although a handful of recent approaches have specifically targeted improvement of content delivery service in tourist spot like scenario, these and other DCS approaches do not focus on contents' demand and supply which vary considerably due to visitor in-and-out flow and occurrence of influencing events. This is further compounded by the lack of any content distribution (replication) scheme. The content delivery service will be improved if contents can be proactively distributed in strategic positions based on dynamic demand and supply and medium access contention. In this paper, we propose a dynamic content distribution scheme (DCDS) considering these practical issues for sharing contents in tourist attractions. Simulation results show that the proposed approach significantly improves (7∼32%) delivery performance.

show abstract

Section: Related Workmentioning

confidence: 99%

A dynamic content distribution scheme for decentralized sharing in tourist hotspots

Kaisar

Karmakar

2019

Journal of Network and Computer Applications

View full text Add to dashboard Cite

show abstract

“…[5][6][7] Compared with half-duplex (HD), 8 full-duplex (FD) radio technology allows each user to transmit and receive data at the same time on the same channel. 9 In a cache-enabled D2D networks, FD radios can obtain higher spectral efficiency and lower end-to-end delay than HD, 10,11 by providing more content delivery opportunities as promised. However, the disadvantage of FD is self-interference (SI), which is caused by power leakage from a transmitter to a receiver.…”

Section: Introductionmentioning

confidence: 99%

Joint caching policies for optimizing energy costs/offloading probability for D2D and millimeter‐wave small cell underlaying cache‐enabled networks

Zhao

Wang

et al. 2019

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

Cache‐enabled networks are a promising solution to high video traffic, which allows popular files to cache at the user equipment (UE) and base stations (BSs). To improve the efficiency of file transmission, we adopt full‐duplex (FD) radio technology and millimeter‐wave small BSs (mmSBSs) in our network scenario. In this paper, users can get their required files via one of self‐communication, FD device‐to‐device (D2D) communication, mmSBS communication and macro BS (MBS) communication. Different communication modes have different energy costs. To minimize energy costs/maximize offloading probability, we analyze the successful probability for users to obtain files by different communication modes and propose an optimal joint caching policy for UE and mmSBSs. Based on the impact between UE and mmSBSs' caching policy, a suboptimal joint caching policy is proposed. The numerical results shown our optimal joint caching policy can improve the performance of cache‐enabled networks effectively and the suboptimal joint caching policy is more closer to the optimal caching policy than other common caching policies.

show abstract

“…Reference [23] proposes the tier-level content placement policies in HCNs. Taking into consideration millimeter-wave and full-duplex communications, [24] proposes a content dissemination mechanism based on proactive content fetching in cache-enabled full-duplex D2D networks and analyzes its performance from an evolutionary perspective.…”

Section: Introductionmentioning

confidence: 99%

Joint Optimization of Content Placement and User Association in Cache‐Enabled Heterogeneous Cellular Networks Based on Flow‐Level Models

Ren

Zhao

et al. 2018

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

Cache-enabled heterogeneous cellular networks (HCNs) have been investigated extensively to alleviate backhaul congestion and reduce content delivery delay. In this paper, we jointly optimize content placement and user association to minimize the average content delivery delay in cache-enabled HCNs based on flow-level models. This formulation considers (1) different timescales of content placement and content delivery, (2) locality of content popularity, and (3) the heterogeneity of spatial traffic distribution, which are often neglected in existing researches. The joint optimization problem is formulated as a mixed integer nonlinear programming problem in load-non-coupled and load-coupled models, respectively. We decouple this problem into two interrelated subproblems and resolve them individually. For the user association problem under a given content placement situation, we propose a content-level selective association algorithm, which allows the requests for different contents at the same location to connect to different base stations (BSs). In addition, we propose a greedy content caching algorithm to add contents to the caches of BSs in an iterative manner. These two algorithms are alternately executed until the caches of all the BSs are filled to capacity. Simulation results show that the proposed algorithm achieves better performance in terms of average delay and backhaul usage compared with traditional content placement and user association approaches.

show abstract

Performance Analysis of the Content Dissemination Mechanism with Proactive Content Fetching and Full-Duplex D2D Communication: an Evolutionary Perspective

Cited by 4 publications

References 54 publications

A dynamic content distribution scheme for decentralized sharing in tourist hotspots

A dynamic content distribution scheme for decentralized sharing in tourist hotspots

Joint caching policies for optimizing energy costs/offloading probability for D2D and millimeter‐wave small cell underlaying cache‐enabled networks

Joint Optimization of Content Placement and User Association in Cache‐Enabled Heterogeneous Cellular Networks Based on Flow‐Level Models

Contact Info

Product

Resources

About