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

Cooperative device-to-device (D2D) communication is proposed as a promising technology to improve the spectral efficiency in crowded communication networks. In this paper, we consider a transmitter-receiver pair, operating in the D2D transmission mode, overlaying the cellular network. The D2D transmitter (DT) acts as a relay for the undelivered packets of cellular user equipment (CUE). We consider

Internet of Things (IoT) is considered as a trend nowadays. Devices connected to the internet interact with surrounding; this poses strong challenges in handling big data with a certain level of security. In this paper IoT devices will be divided in to two categories high vulnerability devices and low vulnerability devices. The classification depends on the ease of attacks. In order to ensure the

The tests and calculation of the key performance metrics of supercapacitors including capacitance, power and energy stored are commonly reported by the academia and the industry based on formulæ valid only for ideal capacitors. This is inconsistent with the fact that supercapacitors exhibit electrical behaviors that are different from those of ideal capacitors whether they are looked at in the

In this paper, a Static Noise Margin (SNM) analysis for 2T2M RRAM cell is investigated. The proposed analysis is done using mathematical formulation and verified by SPICE simulations. The analysis is tested for both, write and read modes. Moreover, the analysis is applied to diverse types of RRAM cells, and a comparison between the performance of such cells is discussed. Additionally, the effect

In this paper, we characterize the degrees of freedom (DoF) region of a MIMO device-relaying cellular network (DRCN) with three users and one base station (BS), where each user exchanges unicast messages with the BS. We assume that one of the users has no direct link to the BS, and hence, device-relaying is utilized to exchange data between this user and the BS, i.e., data is relayed via another

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

[No abstract available]

[No abstract available]

[No abstract available]