No abstract

In this paper, we investigate the optimal solution of power savings for femtocell cluster deployments in the sleep mode involved macro-femto two-tier scenarios. The proposed scheme aims at achieving high SINR with optimal transmit power of femto access point (FAP) by coordinating downlink cross-tier interference and intra-interference with utility and traffic based power control (UTPC) when macro base station (MBS) is under sleep activation. Since the optimal radius of femtocells can be obtained according to dynamic coverage extension, several sleep patterns can be defined for open access permitted hybrid femtocells. In this case, more FAPs can be switched into sleep mode and managed by the main active FAPs in the cluster. As a result, the number of active femtocells can be controlled in accordance with dynamic cell configurations, which can effectively reduce the energy impact of the femtocell cluster. The simulation results show that our proposed scheme enable positive influence on power efficiency and interference coordination for femtocell cluster in the two-tier heterogeneous networks, especially during the night zone.

This article proposes a novel chunk-based caching scheme known as the Progressive Popularity-Aware Caching Scheme (PPCS) to improve content availability and eliminate the cache redundancy issue of Information-Centric Networking (ICN). Particularly, the proposal considers both entire-object caching and partial-progressive caching for popular and non-popular content objects, respectively. In the case that the content is not popular enough, PPCS first caches initial chunks of the content at the edge node and then progressively continues caching subsequent chunks at upstream Content Nodes (CNs) along the delivery path over time, according to the content popularity and each CN position. Therefore, PPCS efficiently avoids wasting cache space for storing on-path content duplicates and improves cache diversity by allowing no more than one replica of a specified content to be cached. To enable a complete ICN caching solution for communication networks, we also propose an autonomous replacement policy to optimize the cache utilization by maximizing the utility of each CN from caching content items. By simulation, we show that PPCS, utilizing edge-computing for the joint optimization of caching decision and replacement policies, considerably outperforms relevant existing ICN caching strategies in terms of latency (number of hops), cache redundancy, and content availability (hit rate), especially when the CN’s cache size is small.

No abstract

No abstract

Cellular systems are facing the ever-increasing demand for vehicular communication aimed at applications such as advanced driving assistance and ultimately fully autonomous driving. Cellular Vehicle to Anything (C-V2X) has become more applicable with the release of the first sets of 5G (5 th Generation) system specifications. The highly capable 5G systems will therefore support even a larger number of moving objects. This study aims to present a sophisticated clustering mechanism that enables cellular systems to accommodate a massive number of moving Machine Type Communication (MTC) objects with a minimum set of connections while maintaining system scalability. Specifically, we proposed Normalized Multi Dimension-Affinity Propagation Clustering (NMDP-APC) scheme and applied it for Vehicular Ad hoc Network (VANET) clustering. For VANET clustering formation, our study employed Machine Learning (ML) to determine the granularity, i.e., the size and span of clusters desirable for use in dynamic motion environments. The study achieved a sufficient level of prediction accuracy with fewer training data through a learned prediction function based on the selected key criteria. This paper also proposes a system sequence designed with a series of procedures fully compliant with C-V2X systems. We demonstrated substantial simulations and numerical experiments with theoretical analysis, specifically applying soft-margin-based Support Vector Machine (SVM) algorithm. The simulation results confirmed that the granularity parameter we applied fairly controls the size of VANET clusters although vehicles are in motion and that the prediction performance has been adjusted through controlling of key SVM parameters. INDEX TERMS 5G mobile communication, vehicular ad hoc networks, machine-to-machine communications, machine learning, mobile computing, clustering methods, heterogeneous networks.

No abstract

Ultra-Reliable Low-Latency Communication (URLLC) is challenging due to its extremely higher reliability requirement with stringent short latency packet transmission. In order to overcome this reliability and latency bound, a communication access scheme needs to assure almost error-free and high speed packet transmission. In this paper, a new multiple-access scheme-Orthogonal Frequency-Subcarrier-based Multiple Access (OFSMA)-is proposed with URLLC's high requirement adaptation. In this scheme, the packet diversity concept is incorporated to achieve the expected packet transmission reliability and a diverse number of the duplicated packet are processed with a set of operations and transmitted over randomly selected orthogonal subcarrier frequency channels. Performances of the OFSMA system are measured in terms of applying several numbers of frequency bands, a massive number of subcarrier channels, a different number of packet duplications, and a diverse rate of traffic arrival conditions. We determined the minimum number of subcarrier channels requirement to satisfy the reliability of 99.999% for different packet duplication in presence of different frequency bands. The reliability response for a fixed number of subcarrier channels is evaluated for different frequency band conditions. Finally, the air interface latency of the OFSMA system is measured for single packet uplink transmission and compared with that of a traditional OFDMA system. The performance results in terms of reliability and latency express that the OFSMA scheme can assure the expected reliability and latency defined by URLLC.