A Review of Wireless Distributed Storage in Socially Enabled D2D Communications - Karkhele Sujata, Kadam Arundhati, Pawar Sonali, Prof. B.J. Patil (original) (raw)

Wireless device-to-device communications with distributed caching

2012

We introduce a novel wireless device-to-device (D2D) collaboration architecture that exploits distributed storage of popular content to enable frequency reuse. We identify a funda-mental conflict between collaboration distance and interference and show how to optimize the transmission power to maximize frequency reuse. Our analysis depends on the user content request statistics which are modeled by a Zipf distribution. Our main result is a closed form expression of the optimal collaboration distance as a function of the content reuse dis-tribution parameters. We show that if the Zipf exponent of the content reuse distribution is greater than 1, it is possible to have a number of D2D interference-free collaboration pairs that scales linearly in the number of nodes. If the Zipf exponent is smaller than 1, we identify the best possible scaling in the number of D2D collaborating links. Surprisingly, a very simple distributed caching policy achieves the optimal scaling behavior and there...

Successful file transmission in mobile D2D networks with caches

Computer Networks, 2018

A device-to-device (D2D) wireless network is considered, where user devices also have the ability to cache content. In such networks, users are mobile and communication links can be spontaneously activated and dropped depending on the users' relative position. Receivers request files from transmitters, these files having a certain popularity and file-size distribution. In this work a new performance metric is introduced, namely the Service Success Proba

Fundamental Limits of Caching in Wireless D2D Networks

IEEE Transactions on Information Theory

We consider a wireless Device-to-Device (D2D) network where communication is restricted to be single-hop. Users make arbitrary requests from a finite library of files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already been considered in an "infrastructure" setting, where all users receive a common multicast (coded) message from a single omniscient server (e.g., a base station having all the files in the library) through a shared bottleneck link. In this work, we consider a D2D "infrastructure-less" version of the problem. We propose a caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands. We also consider a random caching strategy, which is more suitable to a fully decentralized implementation. Under certain conditions, both approaches can achieve the information theoretic outer bound within a constant multiplicative factor. In our previous work, we showed that a caching D2D wireless network with one-hop communication, random caching, and uncoded delivery (direct file transmissions), achieves the same throughput scaling law of the infrastructure-based coded multicasting scheme, in the regime of large number of users and files in the library. This shows that the spatial reuse gain of the D2D network is order-equivalent to the coded multicasting gain of single base station transmission. It is therefore natural to ask whether these two gains are cumulative, i.e., if a D2D network with both local communication (spatial reuse) and coded multicasting can provide an improved scaling law. Somewhat counterintuitively, we show that these gains do not cumulate (in terms of throughput scaling law). This fact can be explained by noticing that the coded delivery scheme creates messages that are useful to multiple nodes, such that it benefits from broadcasting to as many nodes as possible, while spatial reuse capitalizes on the fact that the communication is local, such that the same time slot can be re-used in space across the network. Unfortunately, these two issues are in contrast with each other.

Caching in large-scale cellular networks with D2D assistance

2017 24th International Conference on Telecommunications (ICT), 2017

This paper deals with edge caching and investigates a cellular network where both base-stations (BSs) and distributed devices have caching capabilities. The proposed caching policy allows each device to cache files according to the user's preferences while the most requested files are cached in the BSs. In this way, a three-level hierarchical connectivity scheme is employed, where a file request is satisfied with priority order by i) the closest paired device, ii) the closest BS, iii) the backhaul network. By using stochastic geometry, we derive the success probability of a requested file. Moreover, we model the capacity of the backhaul link and evaluate the delivery delay of a file. We show that our proposed protocol increases the success probability and reduces the delivery delay.

Coded caching in partially cooperative D2D communication networks

2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2017

The backhaul traffic is becoming a major concern in wireless and cellular networks (e.g., 4G-LTE and 5G) with the increasing demands for online video streaming. Caching the popular content in the cache memory of the network users (e.g., mobile devices) is an effective technique to reduce the traffic during the networks' peak time. However, due to the dynamic nature of these networks, users privacy settings, or energy limitations, some users may not be available or intend to participate during the caching procedures. In this paper, we propose caching schemes for device-to-device communication networks where a group of users show selfish characteristics. The selfish users along with the non-selfish users will cache the popular content, but will not share their useful cache content with the other users to satisfy a user request. We show that our proposed schemes are able to satisfy any arbitrary user requests under partial cooperation of the network users.

Mobility-Aware Data Caching to Improve D2D Communications in Heterogeneous Networks

Electronics

User Equipment (UE) is equipped with limited cache resources that can be utilized to offload data traffic through device-to-device (D2D) communications. Data caching at a UE level has the potential to significantly alleviate data traffic burden from the backhaul link. Moreover, in wireless networks, users exhibit mobility that poses serious challenges to successful data transmission via D2D communications due to intermittent connectivity among users. Users’ mobility can be exploited to efficiently cache contents by observing connectivity patterns among users. Therefore, it is crucial to develop an efficient data caching mechanism for UE while taking into account users’ mobility patterns. In this work, we propose a mobility-aware data caching approach to enhance data offloading via D2D communication. First, we model users’ connectivity patterns. Then, contents are cached in UE’ cache resources based on users’ data preferences. In addition, we also take into account signal-to-interfer...

The Effects of Mobility on the Hit Performance of Cached D2D Networks

2016

—A device-to-device (D2D) wireless network is considered , where user devices also have the ability to cache content. In such networks, users are mobile and communication links can be spontaneously activated and dropped depending on the users' relative position. Receivers request files from transmitters, these files having a certain popularity and file-size distribution. In this work a new performance metric is introduced, namely the Service Success Probability, which captures the specificities of D2D networks. For the Poisson Point Process case for node distribution and the SNR coverage model, explicit expressions are derived. Simulations support the analytical results and explain the influence of mobility and file-size distribution on the system performance, while providing intuition on how to appropriately cache content on mobile storage space. Of particular interest is the investigation on how different file-size distributions (Exponential , Uniform, or Heavy-Tailed) influence the performance.

Social Network Device-to-Device Communication in Wireless Networks

Device-to-device (D2D) communication is seen as a major technology to overcome the looming wireless capacity trouble and to enable new application services. In this paper, a novel social network approach for optimizing D2D communication by exploiting two layers, namely the physical wireless network layer and the social network layer, is proposed. In particular, the physical layer D2D network is captured via the users encounter histories. Subsequently, an approach, based on the model the distribution of con tents in the users' online social networks, a algorithm for optimizing the traffic offloading process in D2D communications is developed based on the given the social relations collected by the base station. In addition, the Chernoff bound and approximated cumulative distribution function (cdf) of the offloaded traffic is derived and the validity of the bound and cdf is proven. Simulation results based on real traces demonstrate the effectiveness of our model and show that the proposed approach can offload the network's traffic successfully.

Proactive Caching in D2D Assisted Multitier Cellular Network

Sensors

Cache-enabled networks suffer hugely from the challenge of content caching and content delivery. In this regard, cache-enabled device-to-device (D2D) assisted multitier cellular networks are expected to relieve the network data pressure and effectively solve the problem of content placement and content delivery. Consequently, the user can have a better opportunity to get their favored contents from nearby cache-enabled transmitters (CETs) through reliable and good-quality links; however, as expected, designing an effective caching policy is a challenging task due to the limited cache memory of CETs and uncertainty in user preferences. In this article, we introduce a joint content placement and content delivery technique for D2D assisted multitier cellular networks (D2DMCN). A support vector machine (SVM) is employed to predict the content popularity to determine which content is to be cached and where it is to be cached, thereby increasing the overall cache hit ratio (CHR). The cont...