Fig 1 - uploaded by Negin Golrezaei
Content may be subject to copyright.
Random geometric graph example with collaboration distance r(n).
Source publication
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 fundamental conflict between collaboration distance and interference and show how to optimize the transmission power to maximize frequency reuse. Our analysis depends on the us...
Context in source publication
Similar publications
Evident lack of verified and comprehensive theoretical models for shadow fading, which enable analytical estimation of its statistical distribution and statistical parameters, has promoted the empirical alternatives for this task in many aspects of a wireless system lifecycle, such as e.g. coverage planning, where the imperative is to determine the...
Due to limited cooperation among users and erratic nature of wireless channel, it is difficult for secondary users (SUs) to obtain exact values of system parameters, which may lead to severe interference to primary users (PUs) and cause communication interruption for SUs. In this paper, we study robust power control problem for spectrum underlay co...
Cognitive underlay amplify-and-forward (AF) two-way relay links require signal-to-interference-and-noise-ratio (SINR) balancing and maximizing strategies. And both secondary-to-primary and primary-to-secondary interference must be taken into consideration. To achieve these goals, we develop several joint distributed beamforming and power allocation...
Cognitive radios can significantly improve the spectral efficiency of wireless communications. Spectrum sensing is a key function of cognitive radios to prevent the harmful interference with licensed users. This paper considers the cooperative spectrum sensing in 230 MHz electric wireless private networks. First, the statistical distribution of the...
This paper proves an impossibility result for stochastic network utility maximization for multi-user wireless systems, including multiple access and broadcast systems. Every time slot an access point observes the current channel states for each user and opportunistically selects a vector of transmission rates. Channel state vectors are assumed to b...
Citations
... Table 9 reports on the classification of the relevant research efforts according to the sub-domain. [24], [66], [137] Nodes reconfiguration [7], [19], [30], [57], [62], [64], [68], [69], [74], [77], [85], [104], [131], [133], [152] Resources Scaling [4], [33], [35], [36], [53], [58], [89], [90], [116], [122], [129], [134], [135], [140], [148], [153] Load balancing [10], [25], [51], [76], [96], [97], [98], [99], [141] Caching [1], [45], [46], [47], [86], [124] Monitoring [11], [13], [29], [32], [103] The subject of [24] is the intelligent computational offloading of mobile devices towards edge nodes, specifically at the edge of radio access networks. Task offloading to the available nodes is a significant research issue that demands for efficient solutions to increase the performance of the EC/EM. ...
... Popular video files that might be requested by other users, are cached in individual users' devices. Caching content based on its popularity is also the subject of [45]. Authors optimize the D2D collaboration distance assuming that requests are modelled using the Zipf distribution. ...
Nowadays, we are witnessing the advent of the Internet of Things (IoT) with numerous devices performing interactions between them or with their environment. The huge number of devices leads to huge volumes of data that demand the appropriate processing. The 'legacy' approach is to rely on Cloud where increased computational resources can realize any desired processing. However, the need for supporting real time applications requires a reduced latency in the provision of outcomes. Edge Computing (EC) comes as the 'solver' of the latency problem. Various processing activities can be performed at EC nodes having direct connection with IoT devices. A number of challenges should be met before we conclude a fully automated ecosystem where nodes can cooperate or understand their status to efficiently serve applications. In this paper, we perform a survey of the relevant research activities towards the vision of Edge Mesh (EM), i.e., a 'cover' of intelligence upon the EC. We present the necessary hardware and discuss research outcomes in every aspect of EC/EM nodes functioning. We present technologies and theories adopted for data, tasks and resource management while discussing how machine learning and optimization can be adopted in the domain
... Table 9 reports on the classification of the relevant research efforts according to the sub-domain. [24], [66], [137] Nodes reconfiguration [7], [19], [30], [57], [62], [64], [68], [69], [74], [77], [85], [104], [131], [133], [152] Resources Scaling [4], [33], [35], [36], [53], [58], [89], [90], [116], [122], [129], [134], [135], [140], [148], [153] Load balancing [10], [25], [51], [76], [96], [97], [98], [99], [141] Caching [1], [45], [46], [47], [86], [124] Monitoring [11], [13], [29], [32], [103] The subject of [24] is the intelligent computational offloading of mobile devices towards edge nodes, specifically at the edge of radio access networks. Task offloading to the available nodes is a significant research issue that demands for efficient solutions to increase the performance of the EC/EM. ...
... Popular video files that might be requested by other users, are cached in individual users' devices. Caching content based on its popularity is also the subject of [45]. Authors optimize the D2D collaboration distance assuming that requests are modelled using the Zipf distribution. ...
... Most researchers adopt collaborative caching amongst edge devices, especially in the network with dense users. They usually formulate the caching problem into an optimisation problem on the content replacement [95]- [104], association policy [73], [105]- [107], [107]- [110], and incentive mechanisms [111], [112]. ...
... Apart from content placement, association policy is also important to the establishment of D2D links. In [105], Golrezaei et al. optimise the collaboration distance for D2D communications with distributed caching, where the collaboration distance is the maximum allowable distance for D2D communication. They assume each user employs a simple randomised caching policy. ...
Edge intelligence refers to a set of connected systems and devices for data collection, caching, processing, and analysis in locations close to where data is captured based on artificial intelligence. The aim of edge intelligence is to enhance the quality and speed of data processing and protect the privacy and security of the data. Although recently emerged, spanning the period from 2011 to now, this field of research has shown explosive growth over the past five years. In this paper, we present a thorough and comprehensive survey on the literature surrounding edge intelligence. We first identify four fundamental components of edge intelligence, namely edge caching, edge training, edge inference, and edge offloading, based on theoretical and practical results pertaining to proposed and deployed systems. We then aim for a systematic classification of the state of the solutions by examining research results and observations for each of the four components and present a taxonomy that includes practical problems, adopted techniques, and application goals. For each category, we elaborate, compare and analyse the literature from the perspectives of adopted techniques, objectives, performance, advantages and drawbacks, etc. This survey article provides a comprehensive introduction to edge intelligence and its application areas. In addition, we summarise the development of the emerging research field and the current state-of-the-art and discuss the important open issues and possible theoretical and technical solutions.
... Recently, many works have focused on developing strategies for caching at end users and allowing D2D communications. In [22], for instance, an optimal distance for the D2D communication was defined in a simple network with one BS, while [23] extended it to consider virtually grouping users into clusters that allow intra-cluster sharing. Furthermore, the work in [24] took the proposed work a step further and assumed the co-existence of both cache-assisted BSs and users. ...
Information-centric networks operate under the assumption that all network components have built-in caching capabilities. Integrating the caching strategies of information centric networking (ICN) with wireless virtualization improves the gain of virtual infrastructure content caching. In this paper, we propose a framework for software-defined information centric virtualized wireless device-to-device (D2D) networks. Enabling D2D communications in virtualized ICN increases the spectral efficiency due to reuse and proximity gains while the software-defined network (SDN) as a platform also simplifies the computational overhead. In this framework, we propose a joint virtual resource and cache allocation solution for latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we design low-complexity heuristic algorithms which are intuitive and efficient. In our proposed framework, different services can share a pool of infrastructure items. We evaluate our proposed framework and algorithm through extensive simulations. The results demonstrate significant improvements in terms of visiting latency, end user QoE, InP resource utilization and MVNO utility gain.
... The popular video content is frequently shared among the users. The optimal of devices' collaboration distance, interference and transmission power to the maximize frequency reuse are analyzed based on a Zipf distribution of a demands/requests model in [22] and [23]. In [24], the theoretical asymptotic scaling limit of the amount of data necessary to transmit to satisfy the file demands is investigated using index-coded D2D broadcasts under the cases of the file sizes, the number of files, and the number of users. ...
The internet of things (IoT) is a promising technology for the collection data among the seamless connectivity with massive physical devices for future 5G networks. While device-to-device (D2D) communication is an emerging technique, which potentially tends to promote the machine-type communications (MTC) developments of IoT. In this paper, we consider a wireless distributed storage network where the IoT devices cache decentralized data in each memory and use D2D links to share the whole content, and to save the bandwidth and energy consumptions compared to traditional base station (BS) cellular network. We analyze and compare the energy costs of regenerating codes (RGC) and maximum distance separable (MDS) codes for data downloading and repairing processes with the different parameter configuration. We also define a target named D2D link availability to measure the download and repair efficiency, and obtain the optimal repair intervals of various schemes for the lowest energy cost. Furthermore, we propose a novel caching scheme, termed double replication MDS (DR-MDS), which can modify the repair bandwidth by utilizing more storage occupation, and improve the D2D link availability in the system. Simulation results have shown that DR-MDS caching significantly outperformed MDS caching in the energy saving, that also verifies the practicability and the feasibility of our D2D distributed caching system for the low-power IoT scenarios.
... To design caching policies for the wireless D2D network, the authors of [15] proposed a caching policy that maximizes the probability that requests can be served via D2D communications. For a similar system setting, a caching policy that maximizes the average number of active D2D links was obtained in [16]. More recently, probabilistic caching policies have been applied in D2D caching problems. ...
Recently, wireless caching techniques have been studied to satisfy lower delay requirements and offload traffic from peak periods. By storing parts of the popular files at the mobile users, users can locate some of their requested files in their own caches or the caches at their neighbors. In the latter case, when a user receives files from its neighbors, device-to-device (D2D) communication is performed. D2D communication underlaid with cellular networks is also a new paradigm for the upcoming wireless systems. By allowing a pair of adjacent D2D users to communicate directly, D2D communication can achieve higher throughput, better energy efficiency and lower traffic delay. In this work, we propose an efficient learning-based caching algorithm operating together with a non-parametric estimator to minimize the average transmission delay in D2D-enabled cellular networks. It is assumed that the system does not have any prior information regarding the popularity of the files, and the non-parametric estimator is aimed at learning the intensity function of the file requests. An algorithm is devised to determine the best <file,user> pairs that provide the best delay improvement in each loop to form a caching policy with very low transmission delay and high throughput. This algorithm is also extended to address a more general scenario, in which the distributions of fading coefficients and values of system parameters potentially change over time. Via numerical results, the superiority of the proposed algorithm is verified by comparing it with a naive algorithm, in which all users simply cache their favorite files, and by comparing with a probabilistic algorithm, in which the users cache a file with a probability that is proportional to its popularity.
... The works in [4] [5] and [6] with increasing number of users. However, actual performance can be very dif- 38 2 ferent in a given topology. ...
... Moreover, the proposed algo- 44 rithm is not distributed. Hence [4] and [5] only consider the throughput scaling 45 laws and approximation ratios instead of the actual performances. Dissimilarly ...
In this work we consider the problem of optimal cache placement in a D2D enabled cellular network. There are a number of helper devices in the area, which use their cached contents to help other users and offload traffic from the base station. The goal of cache placement is maximizing the offloaded traffic. We first formulate and optimally solve the cache placement problem as a mixed integer linear program. Then we propose a distributively implementable algorithm that clusters helpers. Helpers in each cluster collectively decide the contents to be cached, based on the content popularity. Numerical evaluations show that the proposed cache placement scheme always performs within 5% of the optimal result and it is robust to popularity profile and cache capacity.
... Replication, erasure codes and regenerating codes are three common redundancy strategies in DSS [5]. Replication is the National Natural Sciences Foundation of China under Grant 61701136 and China Postdoctoral Science Foundation Grant 2018M630357. ...
... Various forms of local caching techniques, including femtocaching, i.e., caching content at small base stations and caching at helper nodes close to the end-users have been explored in [7]. In [5], this idea was extended to using end-users as caches. Since most modern cellphones, tablets and laptops have large inbuilt hard-disks, caching content on these devices and using device-to-device (D2D) communication to assist with content delivery is a promising way to improve user experience and reduce the load on the network backbone [6]. ...
... The concept of femto-caching and D2D assisted content delivery systems have been studied from various perspectives in the recent years. In [5][6][7][8], the D2D network is modeled as a random geometric graph such that all nodes within a radius r of a node can communicate with the node. In [5], the focus is on finding the optimal value of r and determining the optimal transmit power for the best overall system performance. ...
... In [5][6][7][8], the D2D network is modeled as a random geometric graph such that all nodes within a radius r of a node can communicate with the node. In [5], the focus is on finding the optimal value of r and determining the optimal transmit power for the best overall system performance. [7] uses simple distributed caching policy and evaluates the benefits of using end-user caching. ...
We consider a content delivery system consisting of a central server and multiple end-users. The central server stores the entire catalog of contents on offer and can deliver the requested content to the end-users. In addition, the end-users are equipped with limited caching capabilities and have the ability to deliver content to each other via D2D communication. The system also allows a third mode of content delivery where the central server delivers content to some of the end-users who then relay it to the other users. Our goal is to determine which contents to cache at the end-users in order to minimize the cost of service. We characterize the optimal caching policy and evaluate the benefits of allowing the central server to use other end-users as relays to deliver content. The key takeaway from this work is that if end-users have caching capabilities, the benefits of the central server using end-users as relays is negligible. This is in contrast to the case where the end-users cannot cache content where using end-users as relays leads to significant improvement in system performance.
... To design caching policies for the wireless D2D network, the authors of [15] proposed a caching policy that maximizes the probability that requests can be served via D2D communications. For a similar system setting, a caching policy that maximizes the average number of active D2D links was obtained in [16]. More recently, probabilistic caching policies have been applied in D2D caching problems. ...
Recently, wireless caching techniques have been studied to satisfy lower delay requirements and offload traffic from peak periods. By storing parts of the popular files at the mobile users, users can locate some of their requested files in their own caches or the caches at their neighbors. In the latter case, when a user receives files from its neighbors, device-to-device(D2D) communication is performed. D2D communication underlaid with cellular networks is also a new paradigm for the upcoming wireless systems. By allowing a pair of adjacent D2D users to communicate directly, D2D communication can achieve higher throughput, better energy efficiency and lower traffic delay. In this work, we propose an efficient learning-based caching algorithm operating together with a non-parametric estimator to minimize the average transmission delay in D2D-enabled cellular networks. It is assumed that the system does not have any prior information regarding the popularity of the files, and the non-parametric estimator is aimed at learning the intensity function of the file requests. An algorithm is devised to determine the best <file,user> pairs that provide the best delay improvement in each loop to form a caching policy with very low transmission delay and high throughput. This algorithm is also extended to address a more general scenario, in which the distributions of fading coefficients and values of system parameters potentially change over time. Via numerical results, the superiority of the proposed algorithm is verified by comparing it with a naive algorithm, in which all users simply cache their favorite files, and by comparing with a probabilistic algorithm, in which the users cache a file with a probability that is proportional to its popularity.
