Packet Delivery Research Articles

A novel swarm intelligence‐based fuzzy logic in efficient connectivity of vehicles

SummaryA vehicular ad hoc network (VANET) is a wireless network composed of a collection of mobility devices that link via a wireless channel without the need for permanent infrastructure or centralized administration. Multicasting is a method of sending data from a single node to multiple recipients at the same time. Because of its energizing network topology and constricted resources, a mobile ad hoc network (MANET) presents a number of issues. Because network execution measurements such as latency, bandwidth, throughput, and energy fluctuate so rapidly owing to node movement, these network properties in a wireless mobile ad hoc network are ambiguous. Because of the influence of these uncertainty issues, determining the top‐grade path from the originating node to a set of recipient nodes is challenging. In order to preserve network resources, we used a Swarm Intelligence‐based fuzzy logic strategy in this study that includes channel caliber factor and connection termination time to try to alleviate these uncertainty issues. This strategy integrates all of the network indicators available for the routes into an individual quantity named as fuzzy cost or cost of communication. The routes with the lowest fuzzy cost will be regarded optimum, and data will be delivered along this route from the originating point to a set of receivers. The simulation was carried out using NS‐3.38 and MATLAB, and the results reveal that the suggested protocol, HACOFLM, outperforms ODMRP, OFAODV, MAODV, and DFMCRP by means of packet delivery ratio, latency, control packet overhead, and throughput. DFMCRP outperforms MAODV by 3% to 6%, OFAODV by 13% to 19%, and ODMRP by 16% to 23%. According to HACOSMO, based on the number of vehicles and velocities, routing overhead is 7% to 10% less than DFMCRP, 9% to 13% less than MAODV, 17% to 29% less than OFAODV, and 22% to 36% less than ODMRP. It improvise throughput by 4% to 6% when contrasted to DFMCRP, 5% to 9% when contrasted to MAODV, 10% to 14% when contrasted to OFAODV, and 14% to 23% when contrasted to ODMRP.

Improved restricted Boltzmann machine-based optimization model for the network security system in cloud environment

This paper introduces a novel approach to enhancing computer network security through deep learning and cloud technologies, focusing on combating insider DDoS attacks in cloud computing. By employing the IRBM architecture and a trust-oriented secure cloud framework, the work utilizes parameter tuning in RBM through the Gradient-Based Optimization (GBO) algorithm resulting in the proposed IRBM-GBO model. This model significantly outperforms SVM, SC-CNSP-ML, and RBM in terms of latency and Packet Delivery Ratio (PDR), showing 21.67%, 14.55%, and 9.62% improvements in latency, and 10.23%, 5.43%, and 12.79% in PDR, respectively. The research highlights the potential of combining soft computing with deep learning and cloud technologies to identify cyberattacks by emphasising improvements in latency, Quality of Service (QoS), throughput, and PDR across various cybersecurity datasets.

An intelligent fuzzy enabled parent node selection approach in low power networks

The Internet of Things lies in establishing low-power and lossy networks created by interconnecting many wireless devices with limited resources. Fascinatingly, an IPv6 routing protocol for low-power and lossy networks has become a common practice for these applications. Even though this protocol addresses the challenges of low-power networks, many issues concerning the quality of service and energy consumption are open to the research community. The protocol relies on a destination-oriented directed acyclic graph, and the root selection depends on some constraints and metrics associated with an objective function (OF). The conventional OFs select parents based on a single metric, such as the expected transmission count or the number of nodes to travel. The current paper proposes an enhancement to the OF metric, aiming to decrease node energy and enhance the quality of service. This improvement is achieved by the factors, including the received signal strength indicator, node distance, power, link quality indicator, and expected transmission count, to select reliable communication links. The minimum power needed for reliable communication is predicted from the received signal strength indicator, node distance, receiver power, and link quality indicator using a nonlinear support vector machine. The OF value of the candidate node is computed from the power level and expected transmission count combined using the Takagi-Sugeno fuzzy model. The proposed OF is implemented in the Cooja simulator and compared against minimum rank with hysteresis OF and OF zero. A considerable improvement in the packet delivery ratio and a 37.5% reduction in energy consumption is obtained.

A secure routing protocol using trust‐based clustering and bionic intelligence algorithm for UAV‐assisted vehicular ad hoc networks

AbstractVehicular ad hoc networks (VANET) are one of the advanced technologies for distributing dynamic vehicular information across the globe. The VANET is extensively used in many applications, especially road safety applications and intelligent transport systems (ITS). However, direct communication causes high bandwidth (BW) requirement and power consumption. Hence, this article introduces a clustering‐based mechanism to communicate vehicles with infrastructures. The cluster head (CH) is formed based on certain rules, and nodes or vehicles are combined. But, maintaining stability remains challenging for the traditional clustering mechanism. Moreover, the developed technique must examine the malicious and reduce the risk of fake information sharing. This research emphasizes a trust‐based clustering mechanism to select the CH based on a vehicle's knowledge, reputation, and experience. In addition to this, the backup head is also analyzed to promote trust in each vehicle. After clustering, secure routing is undertaken. For this, a bionic remora optimization algorithm (BROA) is proposed, and it considers the hop Count Field as well as the transmission range of vehicles to select the best routes. The performance measures such as end‐to‐end delay ratio, packet delivery ratio (PDR), throughput, trust values, energy consumption are analyzed and compared with existing techniques. In an experimental scenario, the proposed technique has an end‐to‐end delay of 3.8 ms, PDR of 98%, trust value of .4 and .06 for wormhole and Sybil attack, energy of and throughput of 78.7 kbps are attained. The outcome results prove the efficacy of a proposed method.

One-key based cryptographically generated address for location update in next generation IP mobility

Mobile devices have risen due to internet growth in recent years. The next generation of internet protocol is evolving for mobile devices to generate their addresses and get continuous services across networks to support the enormous number of addresses in network-based mobility. The mobile device updates its current location to its home network and the correspondent users through a binding update scheme in the visited network. Numerous studies have investigated binding update schemes to verify the reachability of the mobile device at its home network. However, most schemes endure security threats due to the incompetence of authenticating user identity and concealing the temporary location of mobile devices. To address these issues, this paper proposes a secure and efficient binding update scheme (One-CLU) by incorporating a one-key-based cryptographically generated address (CGA) to validate and conceal the address ownership of mobile devices with minimal computations. The security correctness of the proposed One-CLU scheme is verified using AVISPA – a model checker. Finally, the simulation and the numerical results showthat the proposed scheme significantly reduces communication payloads and costs for the binding update, binding refresh, and packet delivery.

PolarScheduler : Dynamic Transmission Control for Floating LoRa Networks

LoRa is widely deploying in aquatic environments to support various Internet of Things applications. However, floating LoRa networks suffer from serious performance degradation due to the polarization loss caused by the swaying antenna. Existing methods that only control the transmission starting from the aligned attitude have limited improvement due to the ignorance of aligned period length. In this article, we propose PolarScheduler , a dynamic transmission control method for floating LoRa networks. PolarScheduler actively controls transmission configurations to match polarization aligned periods. We propose a V-zone model to capture diverse aligned periods under different configurations. We also design a low-cost model establishment method and an efficient optimal configuration searching algorithm to make full use of aligned periods. To deal with packet collisions in a multiple-node environment, we further propose an Attitude-aware Slot-allocation MAC protocol, which avoids both packet collisions and polarization loss. We implement PolarScheduler on commercial LoRa platforms and evaluate its performance in a deployed network. Extensive experiments show that PolarScheduler can improve the packet delivery rate and throughput by up to 20.0% and 15.7%, compared to the state-of-the-art method.

Hybrid Secure Cluster-Based Routing Algorithm for Enhanced Security and Efficiency in Mobile Ad Hoc Networks

ABSTRACT This research addresses critical gaps in Mobile Ad hoc Networks (MANETs) by proposing a hybrid secure cluster-based routing algorithm, focusing on enhancing network security, robustness, and reliability through multipath routing. Methodologically, the approach integrates Convolutional Neural Networks (CNN) for optimal path routing and Emperor Penguin Optimization (EPO) for clustering, introducing a novel combination for efficient cluster head selection. A novel contribution lies in the development of a prediction technique utilizing a trust assessment algorithm to calculate direct trust ratings at each node, incorporating fuzzy values between zero and one. Trust values are further influenced by node performance, adding a dynamic dimension to the trust evaluation process. Key novelties include the emphasis on energy efficiency, network longevity, remaining energy, security level, bandwidth, and packet delivery ratio as evaluation criteria. The proposed CNN-EPO model demonstrates superior results compared to traditional routing protocols, achieving a remarkable 95% energy efficiency, a heightened security level of 99%, and a throughput reaching up to 8 Mbps. Additionally, the Packet Delivery Ratio (PDR) attains close to 99% and routing overhead remains below 0.5, ensuring efficiency in challenging network scenarios with 50 adversaries. In summary, this research contributes a comprehensive solution to MANET challenges, introducing a novel hybrid routing algorithm, incorporating advanced methodologies for path optimization and clustering. These outcomes highlight how important the suggested strategy is to improve the existing state of the art in MANETs.

Resource Allocation for LoRaWAN Network Slicing: Multi-Armed Bandit-based Approaches

Wireless sensor networks have become increasingly popular in recent years due to the growing demand for Internet of Things (IoT) applications, including LoRaWAN networks. However, the effective allocation of resources remains a crucial challenge in LoRaWAN networks due to the limited bandwidth and the diverse demands for multiple services. This paper presents three novel resource allocation solutions for LoRaWAN network slicing to address this challenge. These solutions are based on the Multi-Armed Bandit (MAB) algorithm, which is known for balancing the exploration of available actions with the exploitation of optimal decisions. Our objective is to dynamically and efficiently allocate resources to network slices by treating the resource allocation as a MAB problem. This approach aims to maximize Packet Delivery Rate (PDR) performance while ensuring each service’s Service Level Agreement (SLA). The first solution, UCB-MAB, uses the Upper Confidence Bound (UCB) strategy to balance exploration and exploitation to improve network performance. The second solution, Q-UCB-MAB, continuously updates Q-values using the Q-learning update equation and incorporates the UCB strategy for further optimization. Finally, the third solution, ARIMA-UCB-MAB, leverages the predicted reward value from the Autoregressive Integrated Moving Average (ARIMA) model within the UCB framework to enhance network performance. Our results demonstrate that all three solutions offer efficient resource allocation in terms of PDR and SLA satisfaction. Specifically, the ARIMA-UCB-MAB solution outperforms the two other solutions.

DCFH: A dynamic clustering approach based on fire hawk optimizer in flying ad hoc networks

In flying ad hoc networks (FANETs), unmanned aerial vehicles (UAVs) communicate with each other without any fixed infrastructure. Because of frequent topological changes, instability of wireless communication, three-dimensional movement of UAVs, and limited resources, especially energy, FANETs deal with many challenges, especially the instability of UAV swarms. One solution to address these problems is clustering because it maintains network performance and increases scalability. In this paper, a dynamic clustering scheme based on fire hawk optimizer (DCFH) is proposed for FANETs. In DCFH, each cluster head calculates the period of hello messages in its cluster based on its velocity. Then, a fire hawk optimizer (FHO)-based dynamic clustering operation is carried out to determine the role of each UAV (cluster head (CH) or cluster member (CM)) in the network. To calculate the fitness value of each fire hawk, a fitness function is suggested based on four elements, namely the balance of energy consumption, the number of isolated clusters, the distribution of CHs, and the neighbor degree. To improve cluster stability, each CH manages the movement of its CMs and adjusts it based on its movement in the network. In the last phase, DCFH defines a greedy routing process to determine the next-hop node based on a score, which consists of distance between CHs, energy, and buffer capacity. Finally, DCFH is simulated using the network simulator version 2 (NS2), and its performance is compared with three methods, including the mobility-based weighted cluster routing scheme (MWCRSF), the dynamic clustering mechanism (DCM), and the Grey wolf optimization (GWO)-based clustering protocol. The simulation results show that DCFH well manages the number of clusters in the network. It improves the cluster construction time (about 55.51%), cluster lifetime (approximately 11.13%), energy consumption (about 15.16%), network lifetime (about 2.6%), throughput (approximately 3.9%), packet delivery rate (about 0.61%), and delay (approximately 14.29%). However, its overhead is approximately 8.72% more than MWCRSF.

Generalized modulation for distance-aware optical camera communication beyond oversampled and undersampled schemes

Oversampled modulation (OM) and undersampled modulation (UM) are two commonly used optical camera communication (OCC) modulation schemes for high-speed communication in short-range and reliable communication at long distances, respectively. However, the relationship between these two schemes and the tradeoff in performance for arbitrary communication distances have not been thoroughly investigated. In this study, we analyze the impact of distance and modulation parameters on pixel efficiency and packet delivery rate performance, demonstrating the underlying unity of traditional OM and UM schemes. Furthermore, we propose a generalized modulation scheme that allows for achieving predefined link performance at a given distance by adjusting the modulation parameters, such as packet length and repetition counts. Simulation and experimental results show that the proposed generalized modulation scheme provides OCC with a unique distance-aware capability other than the traditional OM and UM schemes, which are two special cases focusing on effectiveness and reliability, respectively. This research enhances our understanding of OCC data modulation and establishes a theoretical foundation for achieving efficient and reliable OCC transmission in complex environments.

Performance Analysis of Non-Realistic Routing Protocol using Random Waypoint Model in MANET

A mobile ad hoc network (MANET) is a collection of wireless nodes connected via wireless networks and has no set structure. MANETs feature a self-organized routing topology in which mobile nodes are free to move, making it difficult and crucial to construct a stable and reliable network. Thus, failure of the route is also regarded as a prime factor affecting the efficiency of any MANET routing protocol. The breaking of the connection between two routes or more nodes will cause the failure of the route specifically in the non-realistic routing protocol. In a network of mobile nodes, the link break is mainly based on the mobility of individual nodes. Therefore, the objective of this research is to investigate the performance of proactive DSDV and reactive AODV routing protocol using the Random Waypoint(RWP) mobility model in MANET. NS-2 network simulator is used to simulate the MANET environment and BonnMotion is to create a movement of mobile nodes that integrate with the routing protocol. The network performance metrics used are throughput, packet delivery ratio, and average end-to-end delay. In addition, three simulation scenarios have been conducted to compare AODV and DSDV routing protocols with varying numbers of nodes, a comparison of AODV and DSDV routing protocols with varying pause time, and a comparison of AODV and DSDV routing protocols with varying mobility speed. The result from the three scenarios analysed and concluded that the RWP mobility model with AODV gives a better performance of throughput with 869.69 kbps and Packet Delivery Ratio (PDR) with 83.00% meanwhile, RWP with DSDV is better for the average end-to-end delay(EED) with 212.970 bps.

Energy-Recognition Clustering Technique Based on Reinforcement Learning In WSN

WSN (Wireless Sensor Network) technology has recently gained a lot of attention. This began with the deployment of small WSNs and moved to the deployment of big and IoT WSNs, all with an emphasis on energy conservation. Wireless sensor networks can benefit from network clustering to increase their energy efficiency. The practise of dividing nodes into clusters before picking multiple cluster heads is known as network clustering (CHs). Clustering in wireless sensor networks is known to save energy and extend the network's lifetime (WSNs). Energy efficiency is a hot topic in existing wireless sensor networks, although it's not generally discussed. In this research, we offer a reinforcement learning (RL) based energy-aware clustering approach, whereby peripheral cluster nodes monitor environmental factors like energy use and choose an optimal cluster leader (CH). Connect the CH (BS) to the base station. In the simulation (PDR), performance factors such as network lifetime, energy tax, network stability period, and packet delivery rate are all taken into account. The simulation results show that the proposed QL-ReLeC performs around 11% better than the reference protocol in terms of PDR and 11% better in terms of energy tax.

Determination of the time location points and investigation of the body sensor network using RATDMA and PATDMA

Wireless body sensor networks have gained significant importance across diverse fields, including environmental monitoring, healthcare, and sports. This research is concentrated on sports applications, specifically exploring the viability of a wireless body area network tailored for high-performing athletes. The paper is divided into three sections. First, the design of the node location that is used for real-time monitoring of a sportsperson in which the node position, such as the human thigh, foot, arm, wrist, and chest, was estimated and the best position was selected. Second, the accuracy of an application when related to the other schemes such as TDMA with ZigBee and RA-TDMA & PA-TDMA was done. The reliability using RA-TDMA performed well and showed approximately 98% reliability. Finally, the features of wireless communiqués that affect the presentation of the network for RA-TDMA were estimated, such as delay and jitter. These findings collectively contribute to advancing the understanding of optimizing wireless body sensor networks for sports applications, with notable achievements including the identification of the arm as the optimal sensor placement, achieving a 98% success rate, and surpassing alternative techniques in network performance parameters like packet delivery rate.

An optimized meta‐heuristic clustering‐based routing scheme for secured wireless sensor networks

SummaryPrivacy and security present significant challenges in wireless sensor networks (WSNs). In order to enhance security, the sensor network is equipped with high throughput. While the importance of both source node (SN) and base station (BS) location privacy and security is acknowledged, recent research has predominantly focused on location privacy. Addressing this gap, the geometric zigzag bidirectional tree effectively tackles privacy and security threats at both the SN and BS locations. Future iterations of WSN are anticipated to integrate additional functionalities to meet diverse requirements in real‐world applications. The absence of robust security constraints leads to an unpredictable sensor network setup. This article aims to reduce energy consumption (EC) while simultaneously enhancing network security and connectivity. To address security challenges in WSN, we propose an optimized meta‐heuristic clustering‐based privacy key‐agreement routing technique. In the suggested system, a gateway‐based network is constructed to devise a key arrangement protocol that promotes privacy during communication. The proposed routing strategy involves forming clusters of sensor nodes ( ), facilitating the efficient selection of cluster heads (CHs) that prioritize nodes with the least modification. This effectively addresses the EC problem. A comprehensive performance evaluation is conducted, considering improvements in energy efficiency, packet delivery ratio (PDR), throughput, end‐to‐end delay ( delay), and EC.

Efficient Optimization approach in WSN using Multicast Forwarding Scheme in 6LowPAN Environment

The rapidly growing network of devices that are connected known as the Internet of Things, also referred to as IoT, is designed to collect and exchange data. These devices are integrated with sensors, software, and other technologies. An IPv6-based routing system called 6LowPAN was created especially for Internet of Things devices with little resources. However, because multicast packets must be replicated to every multicast group member, the conventional multicast forwarding technique in 6LowPAN may be wasteful. This can result in excessive energy usage and network traffic, particularly in large-scale Internet of Things implementations. An optimization process is presented here using a multicast forwarding scheme. In the proposed forwarding scheme, nodes can send multicast packets up and down at Low Power and Lossy networks over the 6LowPAN environment. Should the sink node be on the root node, it should immediately request that other nodes join the multicast messaging network of things. If otherwise, an ICMPv6 packet will be sent towards the root node in the Destination-oriented Directed-Acyclic Graphs (DODAG) tree, which expands the multicast messages in the first source's interest. In multi-bounce forward straight-line topology, when the DODAG network root is the source of multicast congestion, it exhibits a similar ratio of packet delivery and delay from end to end with a minimal memory overhead. When traffic via multicast originates from the most important rank node in a backward straight-line topology, this paper focuses on the efficiency of the multicast network at 6LowPAN.

EWFAIGF: Design of an Efficient Model for Enhancing Energy Efficiency in IoT-Based Wireless Sensor Networks through Fuzzy AHP and Iterative Grey Wolf Jelly Fish Optimization

In the realm of Wireless Sensor Networks (WSNs), the quest for enhanced energy efficiency remains paramount, given their pivotal role in facilitating the Internet of Things (IoT) applications. Existing methodologies often grapple with the dual challenge of optimizing energy consumption while ensuring robust data transmission, thereby limiting their efficacy in dynamic, resource-constrained environments. This work introduces a novel paradigm that meticulously addresses these constraints, thereby heralding a significant leap towards optimizing WSNs' operational efficiency. At the core of our proposed model lies the integration of Fuzzy Analytic Hierarchy Process (Fuzzy AHP)-based clustering, which ingeniously segregates nodes by leveraging multi-criteria such as location, energy efficiency, and temporal performance. This clustering serves as a precursor to the application of an innovative Iterative Grey Wolf Jelly Fish Optimizer (GWJFO). The GWJFO stands out by its strategic prowess in delineating optimal routing paths, thus minimizing energy expenditure and enhancing data relay efficiency. Furthermore, our model is fortified with a Q Learning Method, ingeniously designed to identify and execute optimal alternate routing paths through a Make Before Break strategy. This addition not only mitigates potential faults but also significantly boosts computational efficiency and packet delivery performance. Empirical validation through real-time network simulations underscored the model's superiority, demonstrating a 9.5% improvement in communication speed, an 8.5% increase in energy efficiency, a 4.5% improvement in packet delivery performance under fault conditions, a 10.4% rise in throughput, and a 5.9% enhancement in network consistency over existing benchmarks. This groundbreaking work not only paves the way for more energy-efficient WSNs but also sets a new standard in achieving high-performance metrics essential for the next generation of IoT applications. The implications of these advancements extend beyond mere technical enhancements, offering a beacon for future research in the domain, potentially revolutionizing the way we deploy and manage sensor networks in an array of applications.

Novel Hybrid Deep Optimized Machine Learning Model for Energy Efficient Cluster Selection in Unmanned Aerial Vehicle Networks

Unmanned Aerial Vehicles (UAVs) have grown into a more powerful type of data transmission due to this rapid progress of evolution of wireless communication technology. In addition, UAVs have been proven to be effective in a variety of applications, including intelligent transport, disaster risk management, surveillance, and environmental monitoring. When UAVs are deployed randomly, however, they can effectively accomplish challenging tasks because of the UAVs’ has low battery capacity, quick mobility, and dynamic in nature orientation. Due to this reason, a new technique must be designed for an optimal energy efficient UAV clustering as well as data routing protocols. In this work proposes a new hybrid model of Emperor penguin-based Generalized Approximate Reasoning Based Intelligent Control (EP-GARIC) cluster-based network topology. Furthermore, the optimal routing function is achieved by the proposed Artificial Jellyfish Optimization (AJO). The implementation of this research is carried out using Network Simulator (NS2). The simulation results displays the effective performance of the suggested approach in terms of reduced energy consumption, improved packet delivery ratio, reduced loss, and so on over compared to the conventional approaches.

Improving Mobile Ad hoc Networks through an investigation of AODV, DSR, and MP-OLSR Routing Protocols


 Mobile Ad Hoc Networks (MANETs) pose a dynamically organized wireless network, posing a challenge to establishing quality of service (QoS) due to limitations in bandwidth and the ever-changing network topology. These networks are created by assembling nodes systematically, lacking a central infrastructure, and dynamically linking devices such as mobile phones and tablets. Nodes employ diverse methods for service delivery, all while giving priority to network performance. The effectiveness of protocols is crucial in determining the most efficient paths between source and destination nodes, ensuring the timely delivery of messages. Collaborative agreements with MANETs improve accessibility, allow for partial packet delivery and manage network load, ultimately minimizing delays and contributing to exceptional carrier performance. This article conducts a comparative analysis of simulation parameters for AODV, DSR, and MP-OLSR protocols to explore QoS limitations associated with different routing protocols. The study primarily focuses on evaluating various quality metrics for service improvement, assessing protocol performance. Simulation results underscore the DSR protocol's 80% superior throughput compared to AODV and MP-OLSR. However, in terms of delay and packet delivery ratio, the hybrid protocol outperforms both AODV and DSR protocols. These findings provide a distinct perspective for testing the compliance services of MANETs.

Intelligent multi-agent model for energy-efficient communication in wireless sensor networks

The research addresses energy consumption, latency, and network reliability challenges in wireless sensor network communication, especially in military security applications. A multi-agent context-aware model employing the belief-desire-intention (BDI) reasoning mechanism is proposed. This model utilizes a semantic knowledge-based intelligent reasoning network to monitor suspicious activities within a prohibited zone, generating alerts. Additionally, a BDI intelligent multi-level data transmission routing algorithm is proposed to optimize energy consumption constraints and enhance energy-awareness among nodes. The energy optimization analysis involves the Energy Percent Dataset, showcasing the efficiency of four wireless sensor network techniques (E-FEERP, GTEB, HHO-UCRA, EEIMWSN) in maintaining high energy levels. E-FEERP consistently exhibits superior energy efficiency (93 to 98%), emphasizing its effectiveness. The Energy Consumption Dataset provides insights into the joule measurements of energy consumption for each technique, highlighting their diverse energy efficiency characteristics. Latency measurements are presented for four techniques within a fixed transmission range of 5000 m. E-FEERP demonstrates latency ranging from 3.0 to 4.0 s, while multi-hop latency values range from 2.7 to 2.9 s. These values provide valuable insights into the performance characteristics of each technique under specified conditions. The Packet Delivery Ratio (PDR) dataset reveals the consistent performance of the techniques in maintaining successful packet delivery within the specified transmission range. E-FEERP achieves PDR values between 89.5 and 92.3%, demonstrating its reliability. The Packet Received Data further illustrates the efficiency of each technique in receiving transmitted packets. Moreover the network lifetime results show E-FEERP consistently improving from 2550 s to round 925. GTEB and HHO-UCRA exhibit fluctuations around 3100 and 3600 s, indicating variable performance. In contrast, EEIMWSN consistently improves from round 1250 to 4500 s.

Multi-Objective ED2MT Strategy-based Clustering Algorithm for Large Scale WSN

Wireless Sensor Networks play a crucial role in everyday life, providing a wide range of networking structures to develop real-time applications. Energy consumption is limited by WSN devices, so reducing the energy consumption of malicious nodes is crucial to improving network performance. A main concern of WSNs from an application perspective is the prolonged lifetime of the network and reduced energy usage. To overcome these challenges a novel multi-objective ED2MT (Energy, Distance, Degree, Mobility, Time) driven strategy has been proposed which consists of three phases namely dual Cluster Head Selection, data compression, and routing. In the first phase, the proposed ED2MT uses a Fuzzy C-Means (FCM) clustering algorithm to select dual Cluster Head (CH) which has been performed in two stages, namely Inter-Cluster and Intra-Cluster. In the second phase, a Neighborhood Indexing Sequence (NIS) technique is utilized to compress the number of bits in the data before it is transmitted. In the third phase, a multi-objective shortest-path routing algorithm is utilized for route selection. The performance of the ED2MT method has been evaluated using network lifetime, delay, throughput, alive nodes, energy efficiency, and packet delivery ratio to provide a better result. The proposed ED2MT framework achieves 20.55%, 18.4%, and 15.2% more residual energy than C3HA, CAFL, and DHSCA algorithms.