Content Popularity Prediction Towards Location-Aware Mobile Edge Caching

Mobile edge caching enables content delivery within the radio access network, which effectively alleviates the backhaul burden and reduces response time. To fully exploit edge storage resources, the most popular contents should be identified and cached. Observing that user demands on certain contents vary greatly at different locations, this paper devises location-customized caching schemes to maximize the total content hit rate. Specifically, a linear model is used to estimate the future content hit rate. For the case where the model noise is zero-mean, a ridge regression based online algorithm with positive perturbation is proposed. Regret analysis indicates that the proposed algorithm asymptotically approaches the optimal caching strategy in the long run. When the noise structure is unknown, an $H_{\infty}$ filter based online algorithm is further proposed by taking a prescribed threshold as input, which guarantees prediction accuracy even under the worst-case noise process. Both online algorithms require no training phases, and hence are robust to the time-varying user demands. The underlying causes of estimation errors of both algorithms are numerically analyzed. Moreover, extensive experiments on real world dataset are conducted to validate the applicability of the proposed algorithms. It is demonstrated that those algorithms can be applied to scenarios with different noise features, and are able to make adaptive caching decisions, achieving content hit rate that is comparable to that via the hindsight optimal strategy.Comment: to appear in IEEE Trans. Multimedi

Low-Latency and Fresh Content Provision in Information-Centric Vehicular Networks

In this paper, the content service provision of information-centric vehicular networks (ICVNs) is investigated from the aspect of mobile edge caching, considering the dynamic driving-related context information. To provide up-to-date information with low latency, two schemes are designed for cache update and content delivery at the roadside units (RSUs). The roadside unit centric (RSUC) scheme decouples cache update and content delivery through bandwidth splitting, where the cached content items are updated regularly in a round-robin manner. The request adaptive (ReA) scheme updates the cached content items upon user requests with certain probabilities. The performance of both proposed schemes are analyzed, whereby the average age of information (AoI) and service latency are derived in closed forms. Surprisingly, the AoI-latency trade-off does not always exist, and frequent cache update can degrade both performances. Thus, the RSUC and ReA schemes are further optimized to balance the AoI and latency. Extensive simulations are conducted on SUMO and OMNeT++ simulators, and the results show that the proposed schemes can reduce service latency by up to 80% while guaranteeing content freshness in heavily loaded ICVNs

Clustering algorithm for D2D communication in next generation cellular networks : thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engineering, Massey University, Auckland, New Zealand

Next generation cellular networks will support many complex services for smartphones, vehicles, and other devices. To accommodate such services, cellular networks need to go beyond the capabilities of their previous generations. Device-to-Device communication (D2D) is a key technology that can help fulfil some of the requirements of future networks. The telecommunication industry expects a significant increase in the density of mobile devices which puts more pressure on centralized schemes and poses risk in terms of outages, poor spectral efficiencies, and low data rates. Recent studies have shown that a large part of the cellular traffic pertains to sharing popular contents. This highlights the need for decentralized and distributive approaches to managing multimedia traffic. Content-sharing via D2D clustered networks has emerged as a popular approach for alleviating the burden on the cellular network. Different studies have established that D2D communication in clusters can improve spectral and energy efficiency, achieve low latency while increasing the capacity of the network. To achieve effective content-sharing among users, appropriate clustering strategies are required. Therefore, the aim is to design and compare clustering approaches for D2D communication targeting content-sharing applications. Currently, most of researched and implemented clustering schemes are centralized or predominantly dependent on Evolved Node B (eNB). This thesis proposes a distributed architecture that supports clustering approaches to incorporate multimedia traffic. A content-sharing network is presented where some D2D User Equipment (DUE) function as content distributors for nearby devices. Two promising techniques are utilized, namely, Content-Centric Networking and Network Virtualization, to propose a distributed architecture, that supports efficient content delivery. We propose to use clustering at the user level for content-distribution. A weighted multi-factor clustering algorithm is proposed for grouping the DUEs sharing a common interest. Various performance parameters such as energy consumption, area spectral efficiency, and throughput have been considered for evaluating the proposed algorithm. The effect of number of clusters on the performance parameters is also discussed. The proposed algorithm has been further modified to allow for a trade-off between fairness and other performance parameters. A comprehensive simulation study is presented that demonstrates that the proposed clustering algorithm is more flexible and outperforms several well-known and state-of-the-art algorithms. The clustering process is subsequently evaluated from an individual user’s perspective for further performance improvement. We believe that some users, sharing common interests, are better off with the eNB rather than being in the clusters. We utilize machine learning algorithms namely, Deep Neural Network, Random Forest, and Support Vector Machine, to identify the users that are better served by the eNB and form clusters for the rest of the users. This proposed user segregation scheme can be used in conjunction with most clustering algorithms including the proposed multi-factor scheme. A comprehensive simulation study demonstrates that with such novel user segregation, the performance of individual users, as well as the whole network, can be significantly improved for throughput, energy consumption, and fairness

Design and Analysis of Beamforming in mmWave Networks

To support increasing data-intensive wireless applications, millimeter-wave (mmWave) communication emerges as the most promising wireless technology that offers high data rate connections by exploiting a large swath of spectrum. Beamforming (BF) that focuses the radio frequency power in a narrow direction, is adopted in mmWave communication to overcome the hostile path loss. However, the distinct high directionality feature caused by BF poses new challenges: 1) Beam alignment (BA) latency which is a processing delay that both the transmitter and the receiver align their beams to establish a reliable link. Existing BA methods incur significant BA latency on the order of seconds for a large number of beams; 2) Medium access control (MAC) degradation. To coordinate the BF training for multiple users, 802.11ad standard specifies a new MAC protocol in which all the users contend for BF training resources in a distributed manner. Due to the “deafness” problem caused by directional transmission, i.e., a user may not sense the transmission of other users, severe collisions occur in high user density scenarios, which significantly degrades the MAC performance; and 3) Backhaul congestion. All the base stations (BSs) in mmWave dense networks are connected to backbone network via backhaul links, in order to access remote content servers. Although BF technology can increase the data rate of the fronthaul links between users and the BS, the congested backhaul link becomes a new bottleneck, since deploying unconstrained wired backhaul links in mmWave dense networks is infeasible due to high costs. In this dissertation, we address each challenge respectively by 1) proposing an efficient BA algorithm; 2) evaluating and enhancing the 802.11ad MAC performance; and 3) designing an effective backhaul alleviation scheme. Firstly, we propose an efficient BA algorithm to reduce processing latency. The existing BA methods search the entire beam space to identify the optimal transmit-receive beam pair, which leads to significant latency. Thus, an efficient BA algorithm without search- ing the entire beam space is desired. Accordingly, a learning-based BA algorithm, namely hierarchical BA (HBA) algorithm is proposed which takes advantage of the correlation structure among beams such that the information from nearby beams is extracted to iden- tify the optimal beam, instead of searching the entire beam space. Furthermore, the prior knowledge on the channel fluctuation is incorporated in the proposed algorithm to further accelerate the BA process. Theoretical analysis indicates that the proposed algorithm can effectively identify the optimal beam pair with low latency. Secondly, we analyze and enhance the performance of BF training MAC (BFT-MAC) in 802.11ad. Existing analytical models for traditional omni-directional systems are un- suitable for BFT-MAC due to the distinct directional transmission feature in mmWave networks. Therefore, a thorough theoretical framework on BFT-MAC is necessary and significant. To this end, we develop a simple yet accurate analytical model to evaluate the performance of BFT-MAC. Based on our analytical model, we derive the closed-form expressions of average successful BF training probability, the normalized throughput, and the BF training latency. Asymptotic analysis indicates that the maximum normalized throughput of BFT-MAC is barely 1/e. Then, we propose an enhancement scheme which adaptively adjusts MAC parameters in tune with user density. The proposed scheme can effectively improve MAC performance in high user density scenarios. Thirdly, to alleviate backhaul burden in mmWave dense networks, edge caching that proactively caches popular contents at the edge of mmWave networks, is employed. Since the cache resource of an individual BS can only store limited contents, this significantly throttles the caching performance. We propose a cooperative edge caching policy, namely device-to-device assisted cooperative edge caching (DCEC), to enlarge cached contents by jointly utilizing cache resources of adjacent users and BSs in proximity. In addition, the proposed caching policy brings an extra advantage that the high directional transmission in mmWave communications can naturally tackle the interference issue in the cooperative caching policy. We theoretically analyze the performance of DCEC scheme taking the network density, the practical directional antenna model and the stochastic information of network topology into consideration. Theoretical results demonstrate that the proposed policy can achieve higher performance in offloading the backhaul traffic and reducing the content retrieval delay, compared with the benchmark policy. The research outcomes from the dissertation can provide insightful lights on under- standing the fundamental performance of the mmWave networks from the perspectives of BA, MAC, and backhaul. The schemes developed in the dissertation should offer practical and efficient solutions to build and optimize the mmWave networks