Search

This letter proposes two novel proactive cooperative caching approaches using deep learning (DL) to predict users' content demand in a mobile edge caching network. In the first approach, a (central) content server takes responsibilities to collect information from all mobile edge nodes (MENs) in the network and then performs our proposed deep learning (DL) algorithm to predict the content demand for the whole network. However, such a centralized approach may disclose the private information because MENs have to share their local users' data with the content server. Thus, in the second approach, we propose a novel distributed deep learning (DDL) based framework. The DDL allows MENs in the network to collaborate and exchange information to reduce the error of content demand prediction without revealing the private information of mobile users. Through simulation results, we show that our proposed approaches can enhance the accuracy by reducing the root mean squared error (RMSE) up to 33.7% and reduce the service delay by 36.1% compared with other machine learning algorithms., Comment: 4 pages, 6 figures, submitted to IEEE WCL

We propose a two dimension (2D) proactive uplink resource allocation (2D-PURA) algorithm that aims to reduce the delay/latency in event-based machine-type communications (MTC) applications. Specifically, when an event of interest occurs at a device, it tends to spread to the neighboring devices. Consequently, when a device has data to send to the base station (BS), its neighbors later are highly likely to transmit. Thus, we propose to cluster devices in the neighborhood around the event, also referred to as the disturbance region, into rings based on the distance from the original event. To reduce the uplink latency, we then proactively allocate resources for these rings. To evaluate the proposed algorithm, we analytically derive the mean uplink delay, the proportion of resource conservation due to successful allocations, and the proportion of uplink resource wastage due to unsuccessful allocations for 2D-PURA algorithm. Numerical results demonstrate that the proposed method can save over 16.5 and 27 percent of mean uplink delay, compared with the 1D algorithm and the standard method, respectively., Comment: 6 pages, 6 figures, Published in 2018 IEEE Wireless Communications and Networking Conference (WCNC)

We propose a novel edge computing network architecture that enables edge nodes to cooperate in sharing computing and radio resources to minimize the total energy consumption of mobile users while meeting their delay requirements. To find the optimal task offloading decisions for mobile users, we first formulate the joint task offloading and resource allocation optimization problem as a mixed integer non-linear programming (MINLP). The optimization involves both binary (offloading decisions) and real variables (resource allocations), making it an NP-hard and computational intractable problem. To circumvent, we relax the binary decision variables to transform the MINLP to a relaxed optimization problem with real variables. After proving that the relaxed problem is a convex one, we propose two solutions namely ROP and IBBA. ROP is adopted from the interior point method and IBBA is developed from the branch and bound algorithm. Through the numerical results, we show that our proposed approaches allow minimizing the total energy consumption and meet all delay requirements for mobile users., Comment: 6 pages, 6 figures, accepted for presentation at the 2018 Global Communications Conference (IEEE GLOBECOM)

Mobile edge caching/computing has been emerging as a promising paradigm to provide new services (e.g., ultra-high rate, ultra-reliable, and/or low-latency communications) in future wireless networks. In this paper, we introduce a novel mobile edge caching network architecture that leverages the optimal joint caching-delivering with horizontal cooperation among mobile edge nodes (MENs), namely JOCAD. Under this architecture, MENs cooperate with each other in both caching and delivering contents, aiming to simultaneously minimize the total average delay for the mobile users and mitigate the network traffic on the backhaul link. Extensive simulations demonstrate that the proposed solutions can reduce the total average delay for the whole network up to 40% compared with the most frequency-of-access policy, and up to 25% compared with locally optimal caching policy (i.e., without collaboration). Furthermore, the proposed solutions also increase the cache hit rate for the network by four times, thereby dramatically reducing the traffic load on the backhaul network., Comment: 16 pages, 15 figures, submitted to IEEE Transactions on Mobile Computing

Ambient backscatter has been introduced with a wide range of applications for low power wireless communications. In this article, we propose an optimal and low-complexity dynamic spectrum access framework for RF-powered ambient backscatter system. In this system, the secondary transmitter not only harvests energy from ambient signals (from incumbent users), but also backscatters these signals to its receiver for data transmission. Under the dynamics of the ambient signals, we first adopt the Markov decision process (MDP) framework to obtain the optimal policy for the secondary transmitter, aiming to maximize the system throughput. However, the MDP-based optimization requires complete knowledge of environment parameters, e.g., the probability of a channel to be idle and the probability of a successful packet transmission, that may not be practical to obtain. To cope with such incomplete knowledge of the environment, we develop a low-complexity online reinforcement learning algorithm that allows the secondary transmitter to "learn" from its decisions and then attain the optimal policy. Simulation results show that the proposed learning algorithm not only efficiently deals with the dynamics of the environment, but also improves the average throughput up to 50% and reduces the blocking probability and delay up to 80% compared with conventional methods., Comment: 30 pages, 9 figures, journal paper

For an RF-powered cognitive radio network with ambient backscattering capability, while the primary channel is busy, the RF-powered secondary user (RSU) can either backscatter the primary signal to transmit its own data or harvest energy from the primary signal (and store in its battery). The harvested energy then can be used to transmit data when the primary channel becomes idle. To maximize the throughput for the secondary system, it is critical for the RSU to decide when to backscatter and when to harvest energy. This optimal decision has to account for the dynamics of the primary channel, energy storage capability, and data to be sent. To tackle that problem, we propose a Markov decision process (MDP)-based framework to optimize RSU's decisions based on its current states, e.g., energy, data as well as the primary channel state. As the state information may not be readily available at the RSU, we then design a low-complexity online reinforcement learning algorithm that guides the RSU to find the optimal solution without requiring prior- and complete-information from the environment. The extensive simulation results then clearly show that the proposed solution achieves higher throughputs, i.e., up to 50%, than that of conventional methods., Comment: 6 pages, 4 figures, accepted for presentation at the 2018 Global Communications Conference (IEEE GLOBECOM)

Spectrum sensing plays a critical role in dynamic spectrum sharing, a promising technology to address the radio spectrum shortage. In particular, sensing of Orthogonal frequency division multiplexing (OFDM) signals, a widely accepted multi-carrier transmission paradigm, has received paramount interest. Despite various efforts, most conventional OFDM sensing methods suffer from noise uncertainty, timing delay and carrier frequency offset (CFO) that significantly degrade the sensing accuracy. To address these challenges, this work develops two novel OFDM sensing frameworks drawing support from deep learning networks. Specifically, we first propose a stacked autoencoder based spectrum sensing method (SAE-SS), in which a stacked autoencoder network is designed to extract the inherent features of OFDM signals. Using these features to classify the OFDM user's activities, SAE-SS is much more robust to noise uncertainty, timing delay, and CFO than the conventional OFDM sensing methods. Moreover, SAE-SS doesn't require any prior information of signals (e.g., signal structure, pilot tones, cyclic prefix) which are essential for the conventional feature-based OFDM sensing methods. To further improve the sensing accuracy of SAE-SS, especially under low SNR conditions, we propose a stacked autoencoder based spectrum sensing method using time-frequency domain signals (SAE-TF). SAE-TF achieves higher sensing accuracy than SAW-SS at the cost of higher computational complexity. Extensive simulation results show that both SAE-SS and SAE-TF can achieve significantly higher sensing accuracy, compared with state of the art approaches that suffer from noise uncertainty, timing delay and CFO., Comment: 32 pages, 15 figures, 4 table, two algorithms

With the rapid growth of mobile applications and cloud computing, mobile cloud computing has attracted great interest from both academia and industry. However, mobile cloud applications are facing security issues such as data integrity, users' confidentiality, and service availability. A preventive approach to such problems is to detect and isolate cyber threats before they can cause serious impacts to the mobile cloud computing system. In this paper, we propose a novel framework that leverages a deep learning approach to detect cyberattacks in mobile cloud environment. Through experimental results, we show that our proposed framework not only recognizes diverse cyberattacks, but also achieves a high accuracy (up to 97.11%) in detecting the attacks. Furthermore, we present the comparisons with current machine learning-based approaches to demonstrate the effectiveness of our proposed solution., Comment: 6 pages, 3 figures, 1 table, WCNC 2018 conference

The development of mobile cloud computing has brought many benefits to mobile users as well as cloud service providers. However, mobile cloud computing is facing some challenges, especially security-related problems due to the growing number of cyberattacks which can cause serious losses. In this paper, we propose a dynamic framework together with advanced risk management strategies to minimize losses caused by cyberattacks to a cloud service provider. In particular, this framework allows the cloud service provider to select appropriate security solutions, e.g., security software/hardware implementation and insurance policies, to deal with different types of attacks. Furthermore, the stochastic programming approach is adopted to minimize the expected total loss for the cloud service provider under its financial capability and uncertainty of attacks and their potential losses. Through numerical evaluation, we show that our approach is an effective tool in not only dealing with cyberattacks under uncertainty, but also minimizing the total loss for the cloud service provider given its available budget., Comment: 6 pages, 4 figures, 4 tables, WCNC 2018 conference

This paper deals with two main issues regarding the short polar codes: the potential of FEC-assisted decoding and optimal code concatenation strategies under various design scenarios. Code concatenation and FEC-assisted decoding are presented systematically, assuming a packetized system. It is shown that FEC-assisted decoding can improve frame error rate of successive cancellation decoding arbitrarily, at the expense of some coding rate loss and decoding complexity linearly increasing with the number of codewords in the frame. This is compared with list decoding whose complexity grows linearly with the list size as well as the number of codewords. Thereafter, the frame construction procedure and decoding algorithm are developed in a realistic framework. Taking into consideration the effective throughput of the transmission protocol, the problem of optimal design of concatenated codes is formulated under polar code length, frame length and target frame-success-rate constraints. Simulations are performed assuming both additive white Gaussian noise and Rayleigh fading channels. It is shown that the divide-concatenate strategy for long frames does not lead to any considerable gain. It is also shown that the performance of FEC-assisted decoding of frames is improved as the frame length increases while the conventional successive cancellation decoding undergoes a dramatic performance loss., Comment: 11 pages, 8 figures, 2 tables