Search

A wireless body area network (WBAN) is a type of wireless sensor network that plays a crucial role in monitoring patient healthcare. In this network, sensor nodes are typically placed inside or outside the patient's body. These nodes are capable of transmitting data to the sink node when any functional changes in the patient are detected. The routing and energy efficiency of the network nodes are challenging tasks in WBAN, as each sensor node operates on a battery. Therefore, in multi-hop routing designing a robust routing protocol has a significant impact on reducing energy consumption during the selection of the next hop. In this paper, a simple novel routing protocol named simple energy-aware and reliable (SEAR) routing protocol is proposed to transmit reliable data packets in a WBAN. The proposed routing scheme considers the remaining energy of sensor nodes, priority data, and hop count to the sink node as significant metrics for dynamically selecting the best forwarder node. Furthermore, the proposed protocol utilizes the route reliability factor (RRF) to select the optimal route among all possible routes between the source sensor node and the sink node. RRF selects the route with the maximum route residual energy and minimum hop count. As a result, SEAR has the ability to provide effective single-hop and multi-hop routing data transmission to improve the reliability of data transmission, decrease the energy consumption of the sensor nodes, and prolong the lifetime of the network. The simulation results show that the performance of the SEAR routing protocol outperforms the existing routing protocols for the metrics: packet loss ratio, throughput, end-to-end delay, normalized routing load, energy consumption, and network lifetime. The results indicate that the proposed protocol improves total energy consumption by 18.76% and 10.89% when compared to EERR-RLFL and AMCRP respectively. Meanwhile, SEAR reduces the average end-to-end delay by 17% and 9%, packet loss ratio by 29.48% and 17.69%, and normalized routing load by 31.17% and 20.91%. Additionally, SEAR achieves up to 16% and 9.71% higher throughput compared to EERR-RLFL and AMCRP routing protocols respectively. Overall, the results obtained indicate that the proposed SEAR routing scheme significantly enhances the overall performance of the network. [ABSTRACT FROM AUTHOR]

The Smart Grid AMI is at the forefront of modernizing energy management for efficient energy distribution and maintaining grid reliability. However, the seamless flow of data within AMI introduces critical security challenges, necessitating innovative approaches to ensure secure data transmission. This paper addresses these challenges by proposing a Quantum Key Distribution (QKD) based on Multi-Objective Optimization (MOO) and Reinforcement Learning (RL) framework for secure data transmission within the Smart Grid AMI. Primarily, we formulate the routing problem as a MOO challenge with four primary objectives namely, energy efficiency, latency minimization, reliability, and security to capture the essence of efficient and secure data transmission. Further, we introduce an RL agent based on the Proximal Policy Optimization (PPO) algorithm for robust policy learning. The RL agent by exploring diverse routing actions and receiving rewards optimizes the routing decisions within the network environment based on the objectives specified in the multi-objective function (MOF). A novel MOF quantifies trade-offs between security and performance metrics, integrating QKD-based security metrics with traditional optimization objectives. This function guides the RL agent in making informed routing decisions. Through extensive simulations using the NS-2 simulator in a realistic Smart Grid AMI environment, the proposed approach obtained energy consumption of 750 J, latency of 55 ms, and security level of 96% and also revealed significant improvements compared to conventional techniques widely employed for secured communication in AMI networks. Overall, the simulation results exhibited that the proposed method showed outstanding performance by achieving energy efficiency of 0.95, latency reduction of 0.92, reliability improvement of 0.94, and security enhancement of 0.96. Overall, this integration offers a pioneering solution to address the evolving security challenges in the Smart Grid landscape and contributes to the advancement of secure data transmission in Smart Grid AMI networks, fostering a resilient and secure energy ecosystem. [ABSTRACT FROM AUTHOR]

Smart objects in the Internet of Things (IoT) communicate with one another, gather information, and respond to users requests. In these systems, wireless sensors are used to collect data and monitor the environment at the lowest level. In IoT applications, wireless sensor networks play a pivotal role. Since IoT devices often use batteries, efficiency is important to them such that IoT-related standards and research efforts focus more on energy saving or conservation. In this paper, we have used two meta-heuristics algorithm for clustering and routing in IoT. We cluster the network using a clustering method called WOA-clustering based on the meta-heuristic Whale Optimization Algorithm (WOA) and select the optimal cluster heads. We then use a routing method called HHO-Routing based on the Harris Hawks Optimization (HHO) algorithm, a novel meta-heuristic algorithm, to route the cluster heads to BS. The use of the above methods results in reduced power consumption for reaching the base station (BS). Also, to prove the optimal performance of the proposed methods, these methods were simulated and compared with five different methods in a similar context. It was observed that the consumed energy, the number of survival cycles for the death of the first node, and the data transmission rate were improved. The proposed method is simulated in cooja simulator, and for a more accurate evaluation, we compare it with UCCGRA, PSO-SD, PUDCRP, EECRA, EEMRP algorithms. We see that the proposed method performs better than other methods in terms of energy consumption and network lifespan. [ABSTRACT FROM AUTHOR]

Cooperative Non-Orthogonal Multiple Access (Cooperative NOMA) is a communication technique used in wireless networks to enhance spectral efficiency and overall system performance. Non-Orthogonal Multiple Access is a multiple access scheme that allows multiple users to share the same time-frequency resources by allocating different power levels to each user. This paper presents a comprehensive performance validation of NOMA empowered by optimal relay selection and deep learning-based power allocation techniques. To achieve effective data transmission to far users, the optimal relay selection process employs the Maximum Energy Harvested Relay (MEHR) selection approach, which intelligently selects relays based on their energy harvesting capabilities. Furthermore, an enhanced Deep Convolutional Optimized Neural Network (DCOnN) is utilized for optimal power allocation among users in a cooperative NOMA system. To efficiently optimize the power allocation process with the DCOnN model, the Grey Wolf (GW) optimization is utilized to fine-tune the network weights. The presented approach significantly increases the energy efficiency in cooperative NOMA networks. The combination of optimal relay selection and deep learning-based power allocation enhances outage probability performance, ensuring better coverage and communication reliability while reducing the bit error rate for users in challenging channel conditions. Finally, the integration of optimal relay selection using DCOnN with GW optimization and cooperative cognitive NOMA provides a powerful framework to achieve superior communication performance in wireless networks. The proposed scheme achieves higher performance in terms of energy efficiency (519.257 Bits/J/Hz) and CPU time (0.012 seconds). The experimental results proved that the proposed performance is enhanced than the different existing schemes. [ABSTRACT FROM AUTHOR]

In path-constrained multi-hop sensor networks (M-WSNs), maximizing data collection with minimal energy consumption is critical, especially for delay-sensitive applications. Because a mobile element (ME) moving at a constant speed along a constrained-path must receive data from sensor nodes (SNs) within a given time bound. This issue can be addressed by efficiently scheduling the SNs' data transmission. The shortest path data transmission (SPT) or its variations are a simple and energy-efficient technique for scheduling data transmission from SNs. Although this method considerably minimizes total energy spent, it does not enhance data collection efficiency due to uneven data forwarding load. To solve this issue, this paper proposes a novel efficient heuristic method. The proposed method first computes a set of discrete sub-paths on a given path based on the start and end distance points of nearby SNs, the speed of ME, and the given time delay. Then, for each sub-path and SN-communication model, a network flow graph is used to schedule and optimize SN data transmission to ME. Finally, a sub-path is chosen among those which return maximum data with minimum energy consumption. The network flow graphs are created by considering two distinct SN-communication models: (1) energy-unrestricted SN-model and (2) energy-restricted SN-model. Finally, the simulation reports demonstrate the proposed method's efficacy over baseline schemes in terms of data collected, energy usage efficiency, and success-delivery ratio. [ABSTRACT FROM AUTHOR]

A wireless sensor network (WSN) is made up of many sensor nodes with insufficient energy, storage, and processing capabilities. Data gathering and transmission to the base station are two of the main responsibilities of the sensor nodes (BS). As a result, the network lifespan becomes the key factor in the successful design of data collection strategies in WSN. In this study, we provide the Enriched energy optimized LEACH (EE-OLEACH) protocol for data transfer. Through a combination of efficient optimum clustering and an optimal route selection mechanism, it provides a means for energy-efficient routing in WSN. The Homogeneous Hunter-Wolf optimization (HHWO) is used for clustering, and a cluster head is chosen for each cluster to reduce energy loss among sensor nodes and maximize efficiency in their use of available resources. Nodes with the highest residual energy may receive the most energy-efficient routing. In order to send the data to BS, the nodes with the greatest residual energy are chosen. The pheromone-profound Ant optimization (PPAO) method was then used to reduce energy consumption throughout the path-selection process. It contributes to a higher packet delivery ratio while reducing power consumption. According to the experimental findings, the proposed EE-OLEACH performs better than the current Protocol in terms of packet delivery ratio, end-to-end latency, and energy usage. In this paper, we compare the performance of the existing hierarchical routing protocols under varying conditions (packet size, starting energy level, etc.) and demonstrate how the optimal CH selection based on a suggested algorithm improves both network lifetime and energy consumption. The Simulation results shows that the EE-OLEACH enhances energy efficiency by 30%, delay by 35%, node survived by 45%, network lifetime by 56%, packet delivery ratio by 47% and throughput by 38% when compared with other existing protocols. The results clearly show that the suggested EE-OLEACH extends the lifespan of the network and reduce the energy consumption. [ABSTRACT FROM AUTHOR]