Search results

Security is the major issue that motivates multiple scholars to discover security solutions apart from the advantages of wireless sensor networks (WSN) such as strong compatibility, flexible communication and low cost. However, there exist a few challenges, such as the complexity of choosing the expected cluster, communication overhead, routing selection and the energy level that affects the entire communication. The ultimate aim of the research is to secure data communication in WSN using prairie indica optimization.

Initially, the network simulator sets up clusters of sensor nodes. The simulator then selects the Cluster Head and optimizes routing using an advanced Prairie Indica Optimization algorithm to find the most efficient communication paths. Sensor nodes collect data, which is securely transmitted to the base station. By applying prairie indica optimization to WSNs, optimize key aspects of data communication, including secure routing and encryption, to protect sensitive information from potential threats.

The Prairie Indica Optimization, as proposed, achieves impressive results for networks comprising 50 nodes, with delay, energy and throughput values of 77.39 ms, 21.68 J and 22.59 bps. In the case of 100-node networks, the achieved values are 80.95 ms, 27.74 J and 22.03 bps, significantly surpassing the performance of current techniques. These outcomes underscore the substantial improvements brought about by the Prairie Indica Optimization in enhancing WSN data communication.

In this research, the Prairie Indica Optimization is designed to enhance the security of data communication within WSN.

Unlike many existing methods that are primarily focused on two-dimensional localization, this research paper extended the scope to three-dimensional localization. This enhancement is particularly significant for unmanned aerial vehicle (UAV) applications that demand precise altitude information, such as infrastructure inspection and aerial surveillance, thereby broadening the applicability of UAV-assisted wireless networks.

The paper introduced a novel method that employs recurrent neural networks (RNNs) for node localization in three-dimensional space within UAV-assisted wireless networks. It presented an optimization perspective to the node localization problem, aiming to balance localization accuracy with computational efficiency. By formulating the localization task as an optimization challenge, the study proposed strategies to minimize errors while ensuring manageable computational overhead, which are crucial for real-time deployment in dynamic UAV environments.

Simulation results demonstrated significant improvements, including a channel capacity of 99.95%, energy savings of 89.42%, reduced latency by 99.88% and notable data rates for UAV-based communication with an average localization error of 0.8462. Hence, the proposed model can be used to enhance the capacity of UAVs to work effectively in diverse environmental conditions, offering a reliable solution for maintaining connectivity during critical scenarios such as terrestrial environmental crises when traditional infrastructure is unavailable.

Conventional localization methods in wireless sensor networks (WSNs), such as received signal strength (RSS), often entail manual configuration and are beset by limitations in terms of capacity, scalability and efficiency. It is not considered for 3-D localization. In this paper, machine learning such as multi-layer perceptrons (MLP) and RNN are employed to facilitate the capture of intricate spatial relationships and patterns (3-D), resulting in enhanced localization precision and also improved in channel capacity, energy savings and reduced latency of UAVs for wireless communication.

With the advent of AI-federated technologies, it is feasible to perform complex tasks in industrial Internet of Things (IIoT) environment by enhancing throughput of the network and by reducing the latency of transmitted data. The communications in IIoT and Industry 4.0 requires handshaking of multiple technologies for supporting heterogeneous networks and diverse protocols. IIoT applications may gather and analyse sensor data, allowing operators to monitor and manage production systems, resulting in considerable performance gains in automated processes. All IIoT applications are responsible for generating a vast set of data based on diverse characteristics. To obtain an optimum throughput in an IIoT environment requires efficiently processing of IIoT applications over communication channels. Because computing resources in the IIoT are limited, equitable resource allocation with the least amount of delay is the need of the IIoT applications. Although some existing scheduling strategies address delay concerns, faster transmission of data and optimal throughput should also be addressed along with the handling of transmission delay. Hence, this study aims to focus on a fair mechanism to handle throughput, transmission delay and faster transmission of data. The proposed work provides a link-scheduling algorithm termed as delay-aware resource allocation that allocates computing resources to computational-sensitive tasks by reducing overall latency and by increasing the overall throughput of the network. First of all, a multi-hop delay model is developed with multistep delay prediction using AI-federated neural network long–short-term memory (LSTM), which serves as a foundation for future design. Then, link-scheduling algorithm is designed for data routing in an efficient manner. The extensive experimental results reveal that the average end-to-end delay by considering processing, propagation, queueing and transmission delays is minimized with the proposed strategy. Experiments show that advances in machine learning have led to developing a smart, collaborative link scheduling algorithm for fairness-driven resource allocation with minimal delay and optimal throughput. The prediction performance of AI-federated LSTM is compared with the existing approaches and it outperforms over other techniques by achieving 98.2% accuracy.

With an increase of IoT devices, the demand for more IoT gateways has increased, which increases the cost of network infrastructure. As a result, the proposed system uses low-cost intermediate gateways in this study. Each gateway may use a different communication technology for data transmission within an IoT network. As a result, gateways are heterogeneous, with hardware support limited to the technologies associated with the wireless sensor networks. Data communication fairness at each gateway is achieved in an IoT network by considering dynamic IoT traffic and link-scheduling problems to achieve effective resource allocation in an IoT network. The two-phased solution is provided to solve these problems for improved data communication in heterogeneous networks achieving fairness. In the first phase, traffic is predicted using the LSTM network model to predict the dynamic traffic. In the second phase, efficient link selection per technology and link scheduling are achieved based on predicted load, the distance between gateways, link capacity and time required as per different technologies supported such as Bluetooth, Wi-Fi and Zigbee. It enhances data transmission fairness for all gateways, resulting in more data transmission achieving maximum throughput. Our proposed approach outperforms by achieving maximum network throughput, and less packet delay is demonstrated using simulation.

Our proposed approach outperforms by achieving maximum network throughput, and less packet delay is demonstrated using simulation. It also shows that AI- and IoT-federated devices can communicate seamlessly over IoT networks in Industry 4.0.

The concept is a part of the original research work and can be adopted by Industry 4.0 for easy and seamless connectivity of AI and IoT-federated devices.

The purpose of this paper is to secure health data collection and transmission (SHDCT). In this system, a native network consists of portable smart devices that interact with multiple gateways. It entails IoMT devices and wearables connecting to exchange sensitive data with a sensor node which performs the aggeration process and then communicates the data using a Fog server. If the aggregator sensor loses the connection from the Fog server, it will be unable to submit data directly to the Fog server. The node transmits encrypted information with a neighboring sensor and sends it to the Fog server integrated with federated learning, which encrypts data to the existing data. The fog server performs the operations on the measured data, and the values are stored in the local storage area and later it is updated to the cloud server.

SHDCT uses an Internet-of-things (IoT)-based monitoring network, making it possible for smart devices to connect and interact with each other. The main purpose of the monitoring network has been in the collection of biological data and additional information from mobile devices to the patients. The monitoring network is composed of three different types of smart devices that is at the heart of the IoT.

It has been addressed in this work how to design an architecture for safe data aggregation in heterogeneous IoT-federated learning-enabled wireless sensor networks (WSNs), which makes use of basic encoding and data aggregation methods to achieve this. The authors suggest that the small gateway node (SGN) captures all of the sensed data from the SD and uses a simple, lightweight encoding scheme and cryptographic techniques to convey the data to the gateway node (GWN). The GWN gets all of the medical data from SGN and ensures that the data is accurate and up to date. If the data obtained is trustworthy, then the medical data should be aggregated and sent to the Fog server for further processing. The Java programming language simulates and analyzes the proposed SHDCT model for deployment and message initiation. When comparing the SHDCT scheme to the SPPDA and electrohydrodynamic atomisation (EHDA) schemes, the results show that the SHDCT method performs significantly better. When compared with the SPPDA and EHDA schemes, the suggested SHDCT plan necessitates a lower communication cost. In comparison to EHDA and SPPDA, SHDCT achieves 4.72% and 13.59% less, respectively. When compared to other transmission techniques, SHDCT has a higher transmission ratio. When compared with EHDA and SPPDA, SHDCT achieves 8.47% and 24.41% higher transmission ratios, respectively. When compared with other ways it uses less electricity. When compared with EHDA and SPPDA, SHDCT achieves 5.85% and 18.86% greater residual energy, respectively.

In the health care sector, a series of interconnected medical devices collect data using IoT networks in the health care domain. Preventive, predictive, personalized and participatory care is becoming increasingly popular in the health care sector. Safe data collection and transfer to a centralized server is a challenging scenario. This study presents a mechanism for SHDCT. The mechanism consists of Smart healthcare IoT devices working on federated learning that link up with one another to exchange health data. Health data is sensitive and needs to be exchanged securely and efficiently. In the mechanism, the sensing devices send data to a SGN. This SGN uses a lightweight encoding scheme and performs cryptography techniques to communicate the data with the GWN. The GWN gets all the health data from the SGN and makes it possible to confirm that the data is validated. If the received data is reliable, then aggregate the medical data and transmit it to the Fog server for further process. The performance parameters are compared with the other systems in terms of communication costs, transmission ratio and energy use.

The performance of Wireless Sensor Networks (WSNs) applications is bounded by the limited resources of battery-enabled Sensor Nodes (SNs), which include energy and computational power; the combination of which existing research seldom focuses on. Although bio-inspired algorithms provide a way to control energy usage by finding optimal routing paths, those which converge slower require even more computational power, which altogether degrades the overall lifetime of SNs.

Hence, two novel routing protocols are proposed using the Red-Deer Algorithm (RDA) in a WSN scenario, namely Horizontal PEG-RDA Equal Clustering and Horizontal PEG-RDA Unequal Clustering, to address the limited computational power of SNs. Clustering, data aggregation and multi-hop transmission are also integrated to improve energy usage. Unequal clustering is applied in the second protocol to mitigate the hotspot problem in Horizontal PEG-RDA Equal Clustering.

Comparisons with the well-founded Ant Colony Optimisation (ACO) algorithm reveal that RDA converges faster by 85 and 80% on average when the network size and node density are varied, respectively. Furthermore, 33% fewer packets are lost using the unequal clustering approach which also makes the network resilient to node failures. Improvements in terms of residual energy and overall network lifetime are also observed.

Proposal of a bio-inspired algorithm, namely the RDA to find optimal routing paths in WSN and to enhance convergence rate and execution time against the well-established ACO algorithm. Creation of a novel chain cluster-based routing protocol using RDA, named Horizontal PEG-RDA Equal Clustering. Design of an unequal clustering equivalent of the proposed Horizontal PEG-RDA Equal Clustering protocol to tackle the hotspot problem, which enhances residual energy and overall network lifetime, as well as minimises packet loss.

Designing an efficient routing protocol that opportunistically forwards data to the destination node through nearby sensor nodes or devices is significantly important for an effective incidence response and disaster recovery framework. Existing sensor routing protocols are mostly not effective in such disaster recovery applications as the networks are affected (destroyed or overused) in disasters such as earthquake, flood, Tsunami and wildfire. These protocols require a large number of message transmissions to reestablish the clusters and communications that is not energy efficient and result in packet loss. This paper introduces ODCR - an energy efficient and reliable opportunistic density clustered-based routing protocol for such emergency sensor applications. We perform simulation to measure the performance of ODCR protocol in terms of network energy consumptions, throughput and packet loss ratio. Simulation results demonstrate that the ODCR protocol is much better than the existing TEEN, LEACH and LORA protocols in term of these performance metrics.

A wireless body area network (WBAN) is a collection of sensing devices attached to a person’s body that is typically used during health care to track their physical state. This paper aims to study the security challenges and various attacks that occurred while transferring a person’s sensitive medical diagnosis information in WBAN.

This technology has significantly gained prominence in the medical field. These wearable sensors are transferring information to doctors, and there are numerous possibilities for an intruder to pose as a doctor and obtain information about the patient’s vital information. As a result, mutual authentication and session key negotiations are critical security challenges for wearable sensing devices in WBAN. This work proposes an improved mutual authentication and key agreement protocol for wearable sensing devices in WBAN. The existing related schemes require more computational and storage requirements, but the proposed method provides a flexible solution with less complexity.

As sensor devices are resource-constrained, proposed approach only makes use of cryptographic hash-functions and bit-wise XOR operations, hence it is lightweight and flexible. The protocol’s security is validated using the AVISPA tool, and it will withstand various security attacks. The proposed protocol’s simulation and performance analysis are compared to current relevant schemes and show that it produces efficient outcomes.

This technology has significantly gained prominence in the medical sector. These sensing devises transmit information to doctors, and there are possibilities for an intruder to pose as a doctor and obtain information about the patient’s vital information. Hence, this paper proposes a lightweight and flexible protocol for mutual authentication and key agreement for wearable sensing devices in WBAN only makes use of cryptographic hash-functions and bit-wise XOR operations. The proposed protocol is simulated using AVISPA tool and its performance is better compared to the existing methods. This paper proposes a novel improved mutual authentication and key-agreement protocol for wearable sensing devices in WBAN.

Intelligent prediction of node localization in wireless sensor networks (WSNs) is a major concern for researchers. The huge amount of data generated by modern sensor array systems required computationally efficient calibration techniques. This paper aims to improve localization accuracy by identifying obstacles in the optimization process and network scenarios.

The proposed method is used to incorporate distance estimation between nodes and packet transmission hop counts. This estimation is used in the proposed support vector machine (SVM) to find the network path using a time difference of arrival (TDoA)-based SVM. However, if the data set is noisy, SVM is prone to poor optimization, which leads to overlapping of target classes and the pathways through TDoA. The enhanced gray wolf optimization (EGWO) technique is introduced to eliminate overlapping target classes in the SVM.

The performance and efficacy of the model using existing TDoA methodologies are analyzed. The simulation results show that the proposed TDoA-EGWO achieves a higher rate of detection efficiency of 98% and control overhead of 97.8% and a better packet delivery ratio than other traditional methods.

The proposed method is successful in detecting the unknown position of the sensor node with a detection rate greater than that of other methods.

Localization of the nodes is crucial for gaining access of different nodes which would provision in extreme areas where networks are unreachable. The feature of localization of nodes has become a significant study where multiple features on distance model are implicated on predictive and heuristic model for each set of localization parameters that govern the design on energy minimization with proposed adaptive threshold gradient feature (ATGF) model. A received signal strength indicator (RSSI) model with node estimated features is implicated with localization problem and enhanced with hybrid cumulative approach (HCA) algorithm for node optimizations with distance predicting.

Using a theoretical or empirical signal propagation model, the RSSI (known transmitting power) is converted to distance, the received power (measured at the receiving node) is converted to distance and the distance is converted to RSSI (known receiving power). As a result, the approximate distance between the transceiver node and the receiver may be determined by measuring the intensity of the received signal. After acquiring information on the distance between the anchor node and the unknown node, the location of the unknown node may be determined using either the trilateral technique or the maximum probability estimate approach, depending on the circumstances using federated learning.

Improvisation of localization for wireless sensor network has become one of the prime design features for estimating the different conditional changes externally and internally. One such feature of improvement is observed in this paper, via HCA where each feature of localization is depicted with machine learning algorithms imparting the energy reduction problem for each newer localized nodes in Section 5. All affected parametric features on energy levels and localization problem for newer and extinct nodes are implicated with hybrid cumulative approach as in Section 4. The proposed algorithm (HCA with AGTF) has implicated with significant change in energy levels of nodes which are generated newly and which are non-active for a stipulated time which are mentioned and tabulated in figures and tables in Section 6.

Localization of the nodes is crucial for gaining access of different nodes which would provision in extreme areas where networks are unreachable. The feature of localization of nodes has become a significant study where multiple features on distance model are implicated on predictive and heuristic model for each set of localization parameters that govern the design on energy minimization with proposed ATGF model. An RSSI model with node estimated features is implicated with localization problem and enhanced with HCA algorithm for node optimizations with distance predicting.