7 June 2018 in IEEE Journal on Selected Areas in Communications
Fog radio access network (F-RAN) architectures can leverage both cloud processing and edge caching for content delivery to the users. To this end, F-RAN utilizes caches at the edge nodes (ENs) and fronthaul links connecting a cloud processor to ENs. Assuming time-invariant content popularity, existing information-theoretic analyses of content delivery in F-RANs rely on offline caching with separate content placement and delivery phases. In contrast, this paper focuses on the scenario in which the set of popular content is time-varying, hence necessitating the online replenishment of the ENs' caches along with the delivery of the requested files. The analysis is centered on the characterization of the long-term normalized delivery time (NDT), which captures the temporal dependence of the coding latencies accrued across multiple time slots in the high signal-to-noise ratio regime. Online edge caching and delivery schemes are investigated for both serial and pipelined transmission modes across fronthaul and edge segments. Analytical results demonstrate that, in the presence of a time-varying content popularity, the rate of fronthaul links sets a fundamental limit on the long-term NDT of F-RAN system. Analytical results are further verified by numerical simulation, yielding important design insights.
6 February 2017 in IEEE Transactions on Communications
Caching at the network edge has emerged as a viable solution for alleviating the severe capacity crunch in modern content centric wireless networks by leveraging network load-balancing in the form of localized content storage and delivery. In this paper, we consider a cache-aided network, where the cache storage phase is assisted by a central server and users can demand multiple files at each transmission interval. To service these demands, we consider two delivery models: (1) centralized content delivery, where user demands at each transmission interval are serviced by the central server via multicast transmissions; and (2) device-to-device assisted distributed delivery, where users multicast to each other in order to service file demands. For such cache-aided networks, we present new results on the fundamental cache storage versus transmission rate tradeoff. Specifically, we develop a new technique for characterizing information theoretic lower bounds on the storage-rate tradeoff and show that the new lower bounds are strictly tighter than cut-set bounds from literature. Furthermore, using the new lower bounds, we improve the constant factor approximation of the optimal storage-rate tradeoff for cache-aided systems under both delivery models.
18 December 2014 in IEEE Transactions on Vehicular Technology
Conventional spectrum sharing approaches assume that an unlicensed user accessing a licensed spectrum band autonomously operates by sensing (or detecting) the presence of the primary user, which is licensed to use the given band, with minimal coordination from the primary user. However, in this case, incorrect sensing decisions and resource allocation on the unlicensed secondary users' (SU) part can lead to undesired degradation of the primary users' performance. Therefore, there has been a recent paradigm shift to enable cooperative spectrum sharing, in which interaction is allowed between the primary and the secondary network for efficient spectrum utilization while limiting the interference experienced by a primary user. In this paper, we consider a cooperative spectrum sharing architecture in which the SU is assumed to be a cellular network. We then propose a novel fractional-frequency-reuse-based dynamic resource allocation (DRA) algorithm at the secondary (cellular) network. The joint DRA optimization involves simultaneous spectrum allocation across different base stations and then across users within a base station. It is an NP-hard problem and is prohibitively complex to solve for a large cellular network. Therefore, to reduce the complexity of the joint problem and offer a tractable solution, we formulate layered scheduling algorithms for cross-layer resource allocation. Furthermore, the feedback overhead between the layers is kept minimal. Finally, using simulations, we compare our proposed DRA scheme with other resource allocation schemes for sum system throughput, as well as for fairness in allocation. We also present the result for the case when the available primary spectrum varies over time and locations of SUs.
28 March 2013 in IEEE Transactions on Wireless Communications
In this paper, we propose a novel design of concatenated Space-Time Block Codes (STBCs) using Systematic Redundant Residue Number System (RRNS) codes. The link between residues and complex signal constellations is optimized by incorporating the "Direct Mapping", "Prior probability based Distance Aware Mapping" and "Indirect Mapping" schemes. We analytically quantify the upper bounds on the codeword and bit error probabilities of Systematic RRNS-STBC and characterize the achievable coding and diversity gains assuming maximum likelihood decoding (MLD). We propose an Adaptive M-ary Demapping scheme for ML decoding, which exploits the RRNS code structure to decrease complexity and provide further performance improvement over the Distance Aware Mapping scheme. It is shown that Indirect Mapping, when used for RRNS coding schemes can offer more efficient transmission and performance than naive M-ary mapping. It is also seen that Systematic RRNS-STBC codes provide superior performance compared to Non-systematic RRNS-STBC, for the same code parameters, owing to more efficient binary to residue mapping.