BBNSF: Blockchain-Based Novel Secure Framework Using RP2-RSA and ASR-ANN Technique for IoT Enabled Healthcare Systems.

The wearable healthcare equipment is primarily designed to alert patients of any specific health conditions or to act as a useful tool for treatment or follow-up. With the growth of technologies and connectivity, the security of these devices has become a growing concern. The lack of security awareness amongst novice users and the risk of several intermediary attacks for accessing health information severely endangers the use of IoT-enabled healthcare systems. In this paper, a blockchain-based secure data storage system is proposed along with a user authentication and health status prediction system. Firstly, this work utilizes reversed public-private keys combined Rivest-Shamir-Adleman (RP2-RSA) algorithm for providing security. Secondly, feature selection is completed by employing the correlation factor-induced salp swarm optimization algorithm (CF-SSOA). Finally, health status classification is performed using advanced weight initialization adapted SignReLU activation function-based artificial neural network (ASR-ANN) which classifies the status as normal and abnormal. Meanwhile, the abnormal measures are stored in the corresponding patient blockchain. Here, blockchain technology is used to store medical data securely for further analysis. The proposed model has achieved an accuracy of 95.893% and is validated by comparing it with other baseline techniques. On the security front, the proposed RP2-RSA attains a 96.123% security level.

On the Time to Buffer Overflow in a Queueing Model with a General Independent Input Stream and Power-Saving Mechanism Based on Working Vacations.

A single server GI/M/1 queue with a limited buffer and an energy-saving mechanism based on a single working vacation policy is analyzed. The general independent input stream and exponential service times are considered. When the queue is empty after a service completion epoch, the server lowers the service speed for a random amount of time following an exponential distribution. Packets that arrive while the buffer is saturated are rejected. The analysis is focused on the duration of the time period with no packet losses. A system of equations for the transient time to the first buffer overflow cumulative distribution functions conditioned by the initial state and working mode of the service unit is stated using the idea of an embedded Markov chain and the continuous version of the law of total probability. The explicit representation for the Laplace transform of considered characteristics is found using a linear algebra-based approach. The results are illustrated using numerical examples, and the impact of the key parameters of the model is investigated.