I-SEE: Intelligent, Secure, and Energy-Efficient Techniques for Medical Data Transmission Using Deep Reinforcement Learning
MetadataShow full item record
The rapid evolution of remote health monitoring applications is foreseen to be a crucial solution for facing an unpredictable health crisis and improving the quality of life. However, such applications come with many challenges, including: the transmission of a large amount of private medical data and the limited power budget for battery-operated devices. Thus, this article proposes an intelligent, secure, and energy-efficient (I-SEE) framework for secure and energy-efficient medical data transmission, leveraging the potential of physical-layer security. In particular, we incorporate a practical secrecy metric, namely, the secrecy outage probability (SOP), along with the adaptive compression at the edge for providing a secure solution for health monitoring applications. In the proposed framework, we first formulate an optimization problem that maximizes the energy efficiency, while maintaining quality-of-service constraints of the health application. Second, we propose a deep reinforcement learning process that obtains the optimal strategy for secure data transmission. Specifically, a multiobjective reward function is defined to optimize energy efficiency and distortion, resulting from the compression scheme. Then, a deep deterministic policy gradients (DDPGs) algorithm, named Static-DDPG is proposed to solve our problem efficiently. Third, the problem is extended to consider the battery lifetime maximization with varying channel conditions. Indeed, a Dynamic-DDPG algorithm is proposed in order to allow the edge to adapt to the environment dynamics while maximizing its battery lifetime. The conducted simulations validate the efficiency of the proposed algorithms in terms of finding the optimal policy that addresses the tradeoff between the considered conflicting objectives, along with the battery lifetime maximization 2014 IEEE.
- Computer Science & Engineering [1932 items ]