Centralized coded caching and delivery is studied for a partially-connected fog radio access network (F-RAN), whereby a set of H edge nodes (ENs) (without caches), connected to a cloud server via orthogonal fronthaul links, serve K users over the wireless edge. The cloud server is assumed to hold a library of N files, each of size F bits; and each user, equipped with a cache of size MF bits, is

We investigate dynamic content caching in relay networks where an intermediate relay station (RS) can adaptively cache data content based on their varying popularity. With the objective of minimizing the time average cost of content delivery, we formulate and study the problem of optimal RS cache allocation when the popularities of data content are unknown apriori to the network. While optimal

We investigate the performance of caching in relay networks where an intermediate relay station (RS) caches content for future demand by end users. With uncertain user demand over multiple data items and dynamically changing wireless links, we characterize the optimal transmission time for serving data items, cached data portion allocation of relay station and optimal service portion, which

In this paper, we study a two-tier cellular network with cache-enabled small base stations (SBSs). In our model, a SBS has the ability to coordinate with neighboring SBSs and fetch data from their caches. We focus on the effect of SBSs' density on the network's energy efficiency. To this end, stochastic geometry theory is used to model the SBSs and users distributions, which enables us to find

In this letter, we show that Huffman's source coding method is not optimal for cache-aided networks. To that end, we propose an optimal algorithm for the cache-aided source coding problem. We define cache-aided entropy, which represents a lower bound on the average number of transmitted bits for cached-aided networks. A sub-optimal low-complexity cache-aided coding algorithm is presented. In

Wireless video sensor networks (WVSNs) are opening the door for many applications, such as industrial surveillance, environmental tracking, border security, and infrastructure health monitoring. In WVSN, energy conservation is very essential because: 1) sensors are usually battery-operated and 2) each sensor node needs to compress the video prior to transmission, which consumes more power than

In this paper, we consider a class of wireless powered communication devices using hybrid automatic repeat request (HARQ) protocol to ensure reliable communications. In particular, we analyze the trade-off between accumulating mutual information and harvesting RF energy at the receiver of a point-to-point link over a time-varying independent and identically distributed (i.i.d.) channel. The

The surge in demand for Internet of Things (IoT) systems and applications has motivated a paradigm shift in the development of viable radio frequency identification technology (RFID)-based solutions for ubiquitous real-Time monitoring and tracking. Bit tracking-based anti-collision algorithms have attracted considerable attention, recently, due to its positive impact on decreasing the

This paper studies the potential of proactive resource allocation to prolong the communication sessions in networks with limited energy budgets and stringent quality-of-service (QoS) requirement, particularly a regular service guarantee. A threshold-based proactive communication policy is proposed to minimize the consumed transmission energy and maximize the network lifetime based on the different

We investigate a cognitive radio network in which a primary user (PU) may cooperate with a cognitive radio user (i.e., a secondary user (SU)) for transmissions of its data packets. The PU is assumed to be a buffered node operating in a time-slotted fashion where the time is partitioned into equal-length slots. We develop two schemes which involve cooperation between primary and secondary users. To