Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis

The idea behind network caching is to reduce network traffic during peak hours via transmitting frequently-requested content items to end users during off-peak hours. However, due to limited cache sizes and unpredictable access patterns, this might not totally eliminate the need for data transmission during peak hours. Coded caching was introduced to further reduce the peak hour traffic. The idea of coded caching is based on sending coded content which can be decoded in different ways by different users. This allows the server to service multiple requests by transmitting a single content item. Research works regarding coded caching traditionally adopt a simple network topology consisting of a single server, a single hub, a shared link connecting the server to the hub, and private links which connect the users to the hub. Building on the results of Sengupta et al. (IEEE Trans. Inf. Forensics Secur., 2015), we propose and evaluate a yet more complex system model that takes into consideration both throughput and security via combining the mentioned ideas. It is demonstrated that the achievable rates in the proposed model are within a constant multiplicative and additive gap with the minimum secure rates.     

Caching popularity-unknown contents for massive communication channels via deep Q-learning

In order to reduce the backhaul link pressure of wireless networks, edge caching technology has been regarded as a promising solution. However, with massive and dynamical communication connections, it is challenging to provide analytical caching solution to achieve the best performance, particularly when the requested contents are changing and their popularities are unknown. In this paper, we propose a deep Q-learning (DQN) method to address the issue of caching placement. Considering a content caching network containing multiple cooperating SBSs with unknown content popularity, we need to determine which content to cache and where to cache. Therefore, the learning network has to be designed for dual aims, one of which is to estimate the content popularities while the other is to assign contents to the proper channels. An elaborate DQN is proposed to make decisions to cache contents with limited storage space of base-station by considering channel conditions. Specifically, the content requests of users are first collected as one of the training samples of the learning network. Second, the channel state information for the massive links are estimated as the other training samples. Then, we train the network based on the proposed method thereby improving spectral efficiency of the entire system and reducing bit-error rate. Our major contribution is to contrive a caching strategy for enhanced performance in massive connection communications without knowing the content popularity. Numerical studies are performed to show that the proposed method acquires apparent performance gain over random caching in terms of average spectral efficiency and bit-error rate of the network.     

An Umbrella Converse for Data Exchange: Applied to Caching,Computing, and Shuffling

The problem of data exchange between multiple nodes with storage and communication capabilities models several current multi-user communication problems like Coded Caching, Data Shuffling, Coded Computing, etc. The goal in such problems is to design communication schemes which accomplish the desired data exchange between the nodes with the optimal (minimum) amount of communication load. In this work, we present a converse to such a general data exchange problem. The expression of the converse depends only on the number of bits to be moved between different subsets of nodes, and does not assume anything further specific about the parameters in the problem. Specific problem formulations, such as those in Coded Caching, Coded Data Shuffling, and Coded Distributed Computing, can be seen as instances of this generic data exchange problem. Applying our generic converse, we can efficiently recover known important converses in these formulations. Further, for a generic coded caching problem with heterogeneous cache sizes at the clients with or without a central server, we obtain a new general converse, which subsumes some existing results. Finally we relate a “centralized” version of our bound to the known generalized independence number bound in index coding and discuss our bound’s tightness in this context.     

Leakage-based beamforming via game theory for reverse spectrum auction in cellular offloading systems

The explosion of mobile traffic and highly dynamic property often make it increasingly stressful for a cellular service provider to provide sufficient cellular spectrum resources to support the dynamic change of traffic demand in a day. In this paper, considering the dynamic characteristic of the cellular network traffic demand, we not only proposed an optimal, truthful reverse auction incentive framework, but also proposed a valuation function which is based on third-party access points’ capacity. We consider spectrum sharing in a third-party network where several secondary users (SUs) share spectrum with a primary user (PU). A leakage-based beamforming algorithm is proposed via game theory to maximize the sum utility of third-party access points subject to the signal-to-leakage-and-noise (SLNR) constraint of SUs and PU interference constraint. The sum throughput maximization problem is formulated as a non-cooperative game, where the SUs compete with each other over the resources. Nash equilibrium is considered as the solution of this game. Simulation results show that the proposed algorithm can achieve a high sum throughput and converge to a locally optimal beamforming vector.     

Proportional fair scheduling using water-filling technique for SC-FDMA based D2D communication

The resource allocation in SC-FDMA is constrained by the condition that multiple subchannels should be allocated to a single user only if they are adjacent. Therefore, the scheduling scheme of a D2D-cellular system that uses SC-FDMA must also conform to the so-called adjacency constraint. This paper proposes a heuristic algorithm with low computational complexity that applies proportional fair (PF) scheduling in the D2D-cellular system. The proposed algorithm consists of two main phases: (i) subchannel allocation and (ii) adjustment of data rates, which are executed for both CUEs and DUEs. In the subchannel allocation phase for CUEs (or D2D pairs), the users’ data rates are maximized via optimal power allocation to frequency-contiguous subchannels. In the second phase, a PF scheduling problem is solved to decide the modulation and coding scheme (MCS) of both CUEs and D2D pairs. Both phases of the proposed algorithm benefit from the Water-Filling (WF) technique. The simulation results suggest that the proposed scheme performs similar to optimal PF scheduling from the perspective of users’ data rate and their logarithmic sum. An additional benefit of the proposed scheme is its low computational overhead.     

UAV caching in 6G networks: A Survey on models,techniques, and applications

The rapid development road map of 6G networks has posed a new set of challenges to both industrial and academic sectors. On the one hand, it needs more disruptive technologies and solutions for addressing the threefold issues including enhanced mobile broadband, massive machine-type communications, and ultra-reliable and low-latency communications. On the other hand, the ever-massive number of mobile users and Internet of Things devices conveys the huge volume of traffic throughout the 6G networks. In this context, caching is one of the most feasible technologies and solutions that does not require any system architecture changes nor costly investments, while significantly improve the system performance, i.e., quality of service and resource efficiency. Ground caching models deployed at macro base stations, small-cell base stations, and mobile devices have been successfully studied and currently extended to the air done by unmanned aerial vehicles (UAVs) to deal with the challenges of 6G networks. This paper provides a comprehensive survey of UAV caching models, techniques, and applications in 6G networks. In particular, we first investigate the entire picture of caching models moving from the ground to the air as well as the related surveys on UAV communications. Then, we introduce a typical UAV caching system and describe how it works in connection with all types of the transceivers, end users, and applications and services (A&Ss). After that, we present the recent advancements and analyses of the UAV caching models and common system performance metrics. Furthermore, the UAV caching with assisted techniques, UAV caching-enabled mechanisms, and UAV caching A&Ss are discussed to demonstrate the role of UAV caching system in 6G networks. Finally, we highlight the ongoing challenges and potential research directions toward UAV caching in 6G networks.     

Secrecy performance analysis of IRS-assisted D2D communication underlaying cellular network

In this paper, we evaluate the secrecy performance of an intelligent reflecting surface (IRS)-assisted device-to-device (D2D) communication in spectrum-shared cellular networks. To this end, we derive novel closed-form expressions for the secrecy outage probability (SOP) and the asymptotic SOP in the presence of multiple eavesdroppers. In the continue, in order to dynamically access the spectrum band of the licensed users, we define the optimization problem of secrecy spectrum resource allocation to minimize the SOP as a mixed-integer linear programming (MILP) problem. Then, the globally optimal solutions to this problem are obtained by using the Hungarian algorithm. Numerical analyses show that increasing the reflective elements of IRS can improve the secrecy performance.     

Attaining Fairness in Communication for Omniscience

This paper studies how to attain fairness in communication for omniscience that models the multi-terminal compress sensing problem and the coded cooperative data exchange problem where a set of users exchange their observations of a discrete multiple random source to attain omniscience—the state that all users recover the entire source. The optimal rate region containing all source coding rate vectors that achieve omniscience with the minimum sum rate is shown to coincide with the core (the solution set) of a coalitional game. Two game-theoretic fairness solutions are studied: the Shapley value and the egalitarian solution. It is shown that the Shapley value assigns each user the source coding rate measured by their remaining information of the multiple source given the common randomness that is shared by all users, while the egalitarian solution simply distributes the rates as evenly as possible in the core. To avoid the exponentially growing complexity of obtaining the Shapley value, a polynomial-time approximation method is proposed which utilizes the fact that the Shapley value is the mean value over all extreme points in the core. In addition, a steepest descent algorithm is proposed that converges in polynomial time on the fractional egalitarian solution in the core, which can be implemented by network coding schemes. Finally, it is shown that the game can be decomposed into subgames so that both the Shapley value and the egalitarian solution can be obtained within each subgame in a distributed manner with reduced complexity.     

Social-aware relay selection and energy-efficient resource allocation for relay-aided D2D communication

How to improve the flexibility of limited communication resources to meet the increasing requirements of data services has become one of the research hotspots of the modern wireless communication network. In this paper, a novel social-aware motivated relay selection method is put forward to allocate the energy efficiency (EE) resources for the device-to-device (D2D) communication. To improve system flexibility, a D2D user is selected to act as a relay named D2D-relay instead of the traditional cellular relay. The optimal relay selection strategy is formulated by searching the maximum trust value that is obtained by assessing the link stability and social connections between two users. Then, the resource allocation problem, which turns out to be a mixed-integer nonlinear fractional programming (MINLFP) problem, is solved by maximizing the total EE under physical constraint and social constraint synthetically. To improve the solution efficiency, a novel iterative algorithm is proposed by integrating the Dinkelbach theory and Lagrange dual decomposition method. Simulation results demonstrate the effectiveness of the proposed scheme. Compared with the existing social-blind and social-aware schemes, it significantly improves the probability of successful relay selection and total EE of the D2D pairs.     

Quality of Service based resource allocation in D2D enabled 5G-CNs with network slicing

With the rapid new advancements in technology, there is an enormous increase in devices and their versatile need for services. Fifth-generation (5G) cellular networks (5G-CNs) with network slicing (NS) have emerged as a necessity for future mobile communication. The available network is partitioned logically into multiple virtual networks to provide an enormous range of users’ specific services. Efficient resource allocation methods are critical to delivering the customers with their required Quality of Service (QoS) priorities. In this work, we have investigated a QoS based resource allocation (RA) scheme considering two types of 5G slices with different service requirements; (1) enhanced Mobile Broadband (eMBB) slice that requires a very high data rate and (2) massive Machine Type Communication (mMTC) slice that requires extremely low latency. We investigated the device-to-device (D2D) enabled 5G-CN model with NS to assign resources to users based on their QoS needs while considering the cellular and D2D user’s data rate requirements. We have proposed a Distributed Algorithm (DA) with edge computation to solve the optimization problem, which is novel as edge routers will solve the problem locally using the augmented Lagrange method. They then send this information to the central server to find the global optimum solution utilizing a consensus algorithm. Simulation analysis proves that this scheme is efficient as it assigns resources based on their QoS requirements. This scheme is excellent in reducing the central load and computational time.     

On coding for reliable communication over packet networks

We consider the use of random linear network coding in lossy packet networks. In particular, we consider the following simple strategy: nodes store the packets that they receive and, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of stored packets. In such a strategy, intermediate nodes perform additional coding yet do not decode nor wait for a block of packets before sending out coded packets. Moreover, all coding and decoding operations have polynomial complexity.We show that, provided packet headers can be used to carry an amount of side-information that grows arbitrarily large (but independently of payload size), random linear network coding achieves packet-level capacity for both single unicast and single multicast connections and for both wireline and wireless networks. This result holds as long as packets received on links arrive according to processes that have average rates. Thus packet losses on links may exhibit correlations in time or with losses on other links. In the special case of Poisson traffic with i.i.d. losses, we give error exponents that quantify the rate of decay of the probability of error with coding delay. Our analysis of random linear network coding shows not only that it achieves packet-level capacity, but also that the propagation of packets carrying “innovative” information follows the propagation of jobs through a queueing network, thus implying that fluid flow models yield good approximations.     

D2D-assisted user-centric adaptive video transmission in next generation cellular networks

Next-generation cellular networks need to provide seamless connectivity with higher data rates, increased capacity, and enhanced network coverage. As multimedia service demands in various heterogeneous devices grow rapidly compared to the underlying network’s capacity and bandwidth, the adaptation in multimedia streaming services is essential for providing satisfactory Quality of Experience (QoE). This paper develops a Device-to-Device (D2D)-assisted Utility-based Adaptive Multimedia (video) Streaming scheme (UAMS) using D2D communication in a 5th Generation (5G) cellular network where low-battery users may extend their streaming duration by spending lower reception energy with the help of D2D-assisted communication. The adaptation algorithm considers four utility functions: quality, power consumption, packet error ratio, and remaining battery of the user devices to adapt the bitrate dynamically and augment viewers’ experience. We formulate an optimization problem to maximize the joint utility function to provide the best adaptive multimedia content selected for transmission to the end-users either directly or via D2D Relay Nodes (DRNs) in every scheduling interval. We use a graph theoretic approach for choosing the best DRNs. Extensive simulations show the efficacy of the proposed scheme in terms of saved battery energy, churn rate, and QoE metrics compared to a few well-known existing schemes in the literature that do not use D2D communication.     

A matching-theoretic approach to resource allocation in D2D-enabled downlink NOMA cellular networks

This paper investigates the resource allocation problem in non-orthogonal multiple-access (NOMA) cellular networks underlaid with OMA-based device-to-device (D2D) communication. This network architecture enjoys the intrinsic features of NOMA and D2D communications; namely, spectral efficiency, massive connectivity, and low-latency. Despite these indispensable features, the combination of NOMA and D2D communications exacerbates the resource allocation problem in cellular networks due to the tight coupling among their constraints and conflict over access to shared resources. The aim of our work is to maximize the downlink network sum-rate, while meeting the minimum rate requirements of the cellular tier and underlay D2D communication, and incorporating interference management as well as other practical constraints. To this end, many-to-many matching and difference-of-convex programming are employed to develop a holistic sub-channels and power allocation algorithmic solution. In addition to analyzing the properties of the proposed solution, its performance is benchmarked against an existing solution and the traditional OMA-based algorithm. The proposed solution demonstrates superiority in terms of network sum-rate, users’ connectivity, minimum rate satisfaction, fairness, and interference management, while maintaining acceptable computational complexity.     

基于压缩表示的离子刻蚀仿真三维表面演化方法

为了研究表面演化过程的机理, 提出了一种基于压缩表示的三维表面演化方法来模拟等离子体刻蚀工艺,并着重探讨了对离子刻蚀的仿真. 为了解决三维元胞自动机内存需求量大的问题, 该方法将二维数组和动态存储方式相结合, 既实现元胞信息的无损压缩存储, 又保持三维元胞间的空间相关性. 实验结果也表明该方法不仅节省了大量内存, 而且在高分辨率条件下查找离子初始碰撞的表面元胞效率较高, 满足高分辨率仿真的要求. 将该方法应用于实现刻蚀工艺三维表面仿真中, 模拟结果与实验结果对比验证了该方法的有效性. 关键词： 等离子体刻蚀 元胞自动机 表面演化方法 高分辨率仿真     

基于改进蚁群算法的交通最优路径方法研究

本文提出一种基于改进蚁群算法的交通路径最优方法,首先根据图论的思想构建了城市交通网络模型,结合层次分析法考虑了道路长度、交叉口停滞、交通拥挤、道路容量、天气状况等五个主要因素。然后在MATLAB平台下,采用改进的蚁群算法对静态交通网络和动态交通网络分别进行最短路径的求解,最后进行了对比分析。研究结果表明,在综合考虑以上五种因素的情况下,动态交通网络下的路径最优算法能为出行者找到更准确更便捷的路线。     

Coupled vehicle and information flows: Message transport on a dynamic vehicle network

A freeway with vehicles transmitting traffic-related messages via short-range broadcasting is a technological example of coupled material and information flows in complex networks: information on traffic flows is propagated via a dynamically changing ad hoc network based on local interactions. As vehicle and information propagation occur on similar time scales, the network dynamics strongly influences message propagation, which is done by the movement of nodes (cars) and by hops between nearby nodes: two cars within the limited broadcast range establish a dynamic link. Using the cars of the other driving direction as relay stations, the weak connectivity within one driving direction when the density of equipped cars is small can be overcome. By analytical calculation and by microscopic simulation of freeway traffic with a given percentage of vehicles equipped for inter-vehicle communication, we investigate how the equipment level influences the efficiency and velocity of information propagation. By simulating the formation of a typical traffic jam, we show how the non-local information about bottlenecks and jam fronts can travel upstream and reach potential users.     

Computation rate maximization for IRS-enhanced dynamic spectrum access assisted MEC system

Intelligent reflecting surface (IRS)-enhanced dynamic spectrum access (DSA) is a promising technology to enhance the performance of the mobile edge computing (MEC) system. In this paper, we consider the integration of the IRS enhanced DSA technology to a MEC system, and study the pertinent joint optimization of the phase shift coefficients of the IRS, the transmission powers, the central processing unit (CPU) frequencies, as well as the task offloading time allocations of the secondary users (SUs) to maximize the average computation bits of the SUs. Due to the non-convexity, the formulated problem is difficult to solve. In order to tackle this difficulty, we decompose the optimization problem into tractable subproblems and propose an alternating optimization algorithm to optimize the optimization variables in an iterative fashion. Numerical results are provided to show the effectiveness and the correctness of the proposed algorithm.     

Optimal downlink power allocation in cellular networks

In this paper, we introduce a novel approach for power allocation in cellular networks. In our model, we use sigmoidal-like utility functions to represent different users’ modulation schemes. Each utility function is a representation of the probability of successfully transmitted packets per unit of power consumed by a user, when using a certain modulation scheme. We consider power allocation with utility proportional fairness policy, where the fairness among users is in utility percentage i.e. percentage of successfully transmitted packets of the corresponding modulation scheme. We formulate our power allocation optimization problem as a product of utilities of all users and prove that it is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate base station powers optimally with priority given to users running lower modulation schemes while ensuring non-zero power allocation to users running higher modulation schemes. Our algorithm prevents fluctuation in the power allocation process and is capable of traffic and modulation dependent pricing policy. This can be used to flatten traffic and decrease the service price for users. We also compare our results with a benchmark algorithm and show that our algorithm performs better in allocating powers fairly to all users without dropping any user in order to maximize performance.     

PHY modulation/rate control for fountain codes in 802.11a/g WLANs

In this paper we consider the joint performance of fountain codes and 802.11a/g PHY modulation/coding. We consider optimality both in terms of maximizing goodput and minimizing energy, and results are presented for both theoretical and experimental channel models. In contrast to studies in cellular networks, we find that in 802.11a/g WLANs the cross-layer approach of a higher-layer fountain coding with a PHY layer modulation and FEC coding can yield very limited gains, and the PHY modulation/rate that optimizes the uncoded multicast performance is also close to that for fountain-coded multicast traffic over a wide-range of network conditions. This is potentially an important observation as it indicates that in 802.11a/g WLANs cross-layer design for multicast rate control would bring few benefits and PHY layer rate control can be carried out without regard to the use of fountain coding at higher layers.