Search

Summary: Recently, wireless sensor networks (WSNs) have been used for monitoring, sensing, processing, and communication purposes in real‐time applications. It is employed with a routing protocol that performs an effective data transmission process. However, while transmitting large data, there occurs an over fitting issue, which leads to determining a huge data leakage. Also, the delay is increased with heavy congestion in the network. Hence, a novel method is proposed to diminish the network congestion regarding distributed networks as well as cloud edge computing. Moreover, it diminished the data loss from an overloaded condition. However, the proposed technique controls congestion that resists the traffic in the network through lightweight, ultra‐dense label‐less federation and incorporates adaptive multi‐agent Markov reinforcement learning. Furthermore, a distributed energy‐efficient delay‐aware routing protocol is employed to analyze and regulate congestion control in the network. Also, it varies the network dynamically by adjusting the routing protocol that optimizes the congestion and implements the traffic mechanism. Moreover, the congestion in WSNs overwhelms the nodes and channels distributed in the packets. The evaluation of the proposed method is determined by various metrics such as queuing delay, network lifetime, energy efficiency, throughput, and packet delivery ratio. The experimental results revealed that the proposed method attained an enhanced performance by maximizing energy efficiency and packet delivery ratio by 94% as well as 89% and reducing the delay by 55%, respectively. [ABSTRACT FROM AUTHOR]

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 extensive utilization of IoT applications leads to the aggregation of a substantial volume of data, presenting a crucial challenge in terms of data routing within these networks. RPL intentionally surpasses the limitations sometimes observed in low-power and lossy networks, which are particularly prevalent in IoT networks. The RPL protocol is designed specifically for static networks that do not involve mobility or topological changes. The RPL protocol guarantees continuous connectivity between nodes and mitigates the risk of data loss in stationary IoT applications that do not involve mobility or alterations in network configuration. The article utilizes a mobility aid technology known as network performance stability using the intelligent routing protocol (nPSIR), which expands upon RPL. The Mobility Support Entity (nPSIR) facilitates the displacement of all nodes, with the exception of the root node, and ensures uninterrupted connection during mobility. Moreover, it deals with the situation where there is a physical barrier between two interconnected nodes in a changing environment. In order to achieve this objective, it employs a dynamic trickle timer that operates within two distinct ranges. Furthermore, it utilizes a neighbor link quality table, a mechanism for selecting the most beneficial parent node in the event of migration, a measure of confidence, the identification of crucial regions, and a blacklist. Multiple simulations validate that nPSIR effectively decreases hand-off delay and improves packet delivery, despite the minor drawbacks of increased signaling costs and power consumption. The delivery ratio decreases the quantity of lost data packets and surpasses both RPL as a responsive protocol and mRPL as a proactive protocol in relation to mobility. [ABSTRACT FROM AUTHOR]

Energy efficiency and data reliability are important indicators to measure network performance in wireless sensor networks. In existing research schemes of routing protocols, the impact of node coverage on the network is often ignored, and the possibility that multiple sensor nodes may sense the same spatial point is not taken into account, which results in a waste of network resources, especially in large-scale networks. Apart from that, the blindness of geographic routing in data transmission has been troubling researchers, which means that the nodes are unable to determine the validity of data transmission. In order to solve the above problems, this paper innovatively combines the routing protocol with the coverage control technique and proposes the node collaborative scheduling algorithm, which fully considers the correlation characteristics between sensor nodes to reduce the number of active working nodes and the number of packets generated, to further reduce energy consumption and network delay and improve packet delivery rate. In order to solve the problem of unreliability of geographic routing, a highly reliable link detection and repair scheme is proposed to check the communication link status and repair the invalid link, which can greatly improve the packet delivery rate and throughput of the network, and has good robustness. A large number of experiments demonstrate the effectiveness and superiority of our proposed scheme and algorithm. [ABSTRACT FROM AUTHOR]

In unmanned aerial vehicle ad‐hoc network (UANET), the node speed of unmanned aerial vehicles (UAVs) may reach up to 400 km/h. The fast or slow movement of UAV nodes leads to different speeds of topology change of the nodes. Traditional optimized link state routing (OLSR) protocol cannot adaptively adjust the routing update period when the network topology changes, which may lead to the nodes calculating incorrect routing tables. This increases the average end‐to‐end delay and packet loss rate for packet transmission. To enhance the adaptability of OLSR routing protocol to network topology changes, this paper proposes a multi‐agent independent deep deterministic policy gradient‐OLSR (MA‐IDDPG‐OLSR) routing protocol based on distributed multi‐agent reinforcement learning. The protocol deploys DDPG algorithm on each UAV node, and each UAV node adaptively adjusts the Hello and TC message sending intervals, according to the one‐hop neighbouring nodes as well as its own state. Simulation results show that the proposed protocol is able to improve the throughput and reduce the packet loss rate as compared to traditional AODV, GRP, OLSR, and distributed multiple‐agent independent proximal policy optimization‐OLSR (MA‐IPPO‐OLSR), distributed multiple‐agent independent twin delayed deep deterministic policy gradient‐OLSR (MA‐ITD3‐OLSR) routing protocols. Since MA‐IDDPG‐OLSR relies only on local information, there is a minor performance degradation in MA‐IDDPG‐OLSR compared to centralized single‐agent DQN‐OLSR routing protocol. But it is more suitable to a completely distributed UAV network without a centralized node. [ABSTRACT FROM AUTHOR]

Opportunistic Networks (OppNets) are characterized by intermittently connected nodes with fluctuating performance. Their dynamic topology, caused by node movement, activation, and deactivation, often relies on controlled flooding for routing, leading to significant resource consumption and network congestion. To address this challenge, we propose the Adaptive Clustering-based Routing Protocol (ACRP). This ACRP protocol uses the common member-based adaptive dynamic clustering approach to produce optimal clusters, and the OppNet is converted into a TCP/IP network. This protocol adaptively creates dynamic clusters in order to facilitate the routing by converting the network from a disjointed to a connected network. This strategy creates a persistent connection between nodes, resulting in more effective routing and enhanced network performance. It should be noted that ACRP is scalable and applicable to a variety of applications and scenarios, including smart cities, disaster management, military networks, and distant places with inadequate infrastructure. Simulation findings demonstrate that the ACRP protocol outperforms alternative clustering approaches such as kRop, QoS-OLSR, LBC, and CBVRP. The analysis of the ACRP approach reveals that it can boost packet delivery by 28% and improve average end-to-end, throughput, hop count, and reachability metrics by 42%, 45%, 44%, and 80%, respectively. [ABSTRACT FROM AUTHOR]

The burgeoning interest in intelligent transportation systems (ITS) and the widespread adoption of in-vehicle amenities like infotainment have spurred a heightened fascination with vehicular ad-hoc networks (VANETs). Multi-hop routing protocols are pivotal in actualizing these in-vehicle services, such as infotainment, wirelessly. This study presents a novel protocol called multiple junction-based traffic-aware routing (MJTAR) for VANET vehicles operating in urban environments. MJTAR represents an advancement over the improved greedy traffic-aware routing (GyTAR) protocol. MJTAR introduces a distributed mechanism capable of recognizing vehicle traffic and computing curve metric distances based on two-hop junctions. Additionally, it employs a technique to dynamically select the most optimal multiple junctions between source and destination using the ant colony optimization (ACO) algorithm. We implemented the proposed protocol using the network simulator 3 (NS-3) and simulation of urban mobility (SUMO) simulators and conducted performance evaluations by comparing it with GSR and GyTAR. Our evaluation demonstrates that the proposed protocol surpasses GSR and GyTAR by over 20% in terms of packet delivery ratio, with the end-to-end delay reduced to less than 1.3 s on average. [ABSTRACT FROM AUTHOR]

The rapid development of mobile communication devices has brought challenges to wireless networks, where data packets are able to organize and maintain local area networks more freely without the constraints of wired devices. Scholars have developed diverse network protocols on how to ensure data transmission while maintaining its self-organizational nature. However, it is difficult for traditional network protocols to meet the needs of increasingly complex networks. In order to solve the problem that the better node set may not be selected when selecting the node set responsible for forwarding in the traditional OLSR protocol, a multi-objective optimized OLSR algorithm is proposed in this paper, which incorporating a new MPR mechanism and an improved NSGA-II algorithm. In the process of route discovery, the intermediate nodes responsible for forwarding packets are determined by the new MPR mechanism, and then the main parameters in the OLSR protocol are provided by the multi-objective optimization algorithm. Matlab was used to build a self-organizing network in this study. In addition, the conventional OLSR protocol, NSGA-II algorithm and multi-objective simulated annealing algorithm are selected to compare with the proposed algorithm. Simulation results show that the proposed algorithm can effectively reduce packet loss and end-to-end delay while obtaining better results in HV and Spacing, two multi-objective optimization result evaluation metrics. [ABSTRACT FROM AUTHOR]

With the emergence of wireless rechargeable sensor networks (WRSNs), the possibility of wirelessly recharging nodes using mobile charging vehicles (MCVs) has become a reality. However, existing approaches overlook the effective integration of node energy replenishment and mobile data collection processes. In this paper, we propose a joint energy replenishment and data collection scheme (D-JERDG) for WRSNs based on deep reinforcement learning. By capitalizing on the high mobility of unmanned aerial vehicles (UAVs), D-JERDG enables continuous visits to the cluster head nodes in each cluster, facilitating data collection and range-based charging. First, D-JERDG utilizes the K-means algorithm to partition the network into multiple clusters, and a cluster head selection algorithm is proposed based on an improved dynamic routing protocol, which elects cluster head nodes based on the remaining energy and geographical location of the cluster member nodes. Afterward, the simulated annealing (SA) algorithm determines the shortest flight path. Subsequently, the DRL model multiobjective deep deterministic policy gradient (MODDPG) is employed to control and optimize the UAV instantaneous heading and speed, effectively planning UAV hover points. By redesigning the reward function, joint optimization of multiple objectives such as node death rate, UAV throughput, and average flight energy consumption is achieved. Extensive simulation results show that the proposed D-JERDG achieves joint optimization of multiple objectives and exhibits significant advantages over the baseline in terms of throughput, time utilization, and charging cost, among other indicators. [ABSTRACT FROM AUTHOR]

Wireless body area networks (WBANs) have emerged as a promising solution for addressing challenges faced by elderly individuals, limited medical facilities, and various chronic medical conditions. WBANs consist of wearable sensing and computing devices interconnected through wireless communication channels, enabling the collection and transmission of vital physiological data. However, the energy constraints of the battery-powered sensor nodes in WBANs pose a significant challenge to ensuring long-term operational efficiency. Two-hop routing protocols have been suggested to extend the stability period and maximize the network's lifetime. These protocols select appropriate parent nodes or forwarders with a maximum of two hops to relay data from sensor nodes to the sink. While numerous energy-efficient routing solutions have been proposed for WBANs, reliability has often been overlooked. Our paper introduces an energy-efficient routing protocol called a Hybrid Clustering Approach for Extending WBAN Lifetime (HCEL) to address these limitations. HCEL leverages a utility function to select parent nodes based on residual energy (RE), proximity to the sink node, and the received signal strength indicator (RSSI). The parent node selection process also incorporates an energy threshold value and a constrained number of serving nodes. The main goal is to extend the overall lifetime of all nodes within the network. Through extensive simulations, the study shows that HCEL outperforms both Stable Increased Throughput Multihop Protocol for Link Efficiency (SIMPLE) and Energy-Efficient Reliable Routing Scheme (ERRS) protocols in several key performance metrics. The specific findings of our article highlight the superior performance of HCEL in terms of increased network stability, extended network lifetime, reduced energy consumption, improved data throughput, minimized delays, and improved link reliability. [ABSTRACT FROM AUTHOR]

In the world of connected devices with enormous application market, wireless sensor network comes with inherent challenges. Energy consumption balancing among the sensors affects its lifetime and connectivity. A hybrid approach for the randomly deployed sensor network is proposed in this paper with better consumption energy balance through the lifetime of the sensor network. An optimized threshold probability is analyzed for the improvement of network lifetime in comparison with stable election protocol. Simulation results provide improved consumption energy distribution and prolonged network lifetime of heterogeneous wireless sensor network. The proposed protocol is reactive to the change in the network, making it suitable for the Internet of Things applications. [ABSTRACT FROM AUTHOR]

Vehicle ad-hoc networks (VANETs) have become a prominent research topic in recent years due to rapid dynamic topology, high vehicle mobility, frequent link failures and significant delay constraints. The mobility of the vehicle nodes increases, and the overhead of control traffic due to the high dynamics of the VANET. Efficient routing algorithms are necessary for VANETs to ensure reliable transmission (VANETs). This work proposes a Traffic Density Stable Routing Protocol based on Connection- and Distance (TDSRP-DC) to avoid data packet collisions at intersections and an adaptive routing schedule based on the selection at every instant. Our approach is based on vehicle-to-vehicle communication. Ground vehicles identify the most appropriate next junction and transfer the data packet to the receiver to find the optimal multi-hop route. It relies on transferring the data between all vehicles to estimate real-time traffic fluctuations sporadically. Network formation, neighbor realization, fitness value prediction, and routing methodology are the conceptual process needed in this research. Valid parameters for finding the optimum path in the conceptual model include node distance, node speed, node azimuth, link stability, and link reliability. The suggested solution's simulation was performed in comparison to traditional algorithms. Compared to existing TFOR algorithms on complex traffic, the proposed TDSRP-DC provides tremendous improvements based on packet delivery rate (10%) and performance (35%). The demonstrated results and comparisons illustrate the proposed routing protocol's significance with enhanced quality of service performance. [ABSTRACT FROM AUTHOR]

Smart cities today can utilize vehicular delay tolerant networks (VDTN) to collect data from connected-objects in the environment for various delay-tolerant applications. They can take advantage of the available intelligent transportation systems (ITS) infrastructures to deliver data to the central server. The system can also exploit multiple and diverse mobility patterns found in cities, such as privately owned cars, taxis, public buses, and trams, along with their vehicle-toeverything (V2X) communications capabilities. In the envisioned convergence between the ITS and V2X, we believe that a simple and efficient routing protocol can be deployed for the delay-tolerant data delivery, contrary to the implementation of optimized solutions that might be resource-demanding and difficult to standardize. In this paper, we analyzed the performances of four baseline VDTN routing protocols, namely: direct delivery, first contact, epidemic, and spray and wait, to understand their strengths and weaknesses. Our simulation results highlighted the trade-off between distinct approaches used by those protocols and pointed out some gaps that can be refined. This study provides new interesting ideas and arguments towards developing a simple, efficient, and high-performing routing protocol for data collection in smart cities. [ABSTRACT FROM AUTHOR]

Due to the characteristics of self‐organization, flexibility, and low cost, Mobile ad hoc networks (MANETs) have been applied in many fields, such as disaster rescues and military actions. However, in reality, the successful route establishment based on routing protocols is the prerequisite of data transmission. Besides, the transmission reliability of MANETs is affected by resource constraints, such as channel capacity and energy, and environmental factors. Hence, how accurately modeling and evaluating the transmission reliability of MANETs is very important to ensure their application. Whereas, existing studies ignore the impact of routing protocols and do not fully consider the influence of some factors on transmission reliability, such as environmental randomness, channel capacity, and energy consumption. To solve the above problems, we first propose a signal‐to‐noise‐ratio‐Capacity connection model to better describe the characteristics of wireless links, and the probability of one hop connection is deduced considering the capacity demand randomness. Then, considering the influence of routing protocol on the MANET link establishment, we take the ad hoc on‐demand distance vector routing protocol as an example, and propose an evaluation algorithm of the MANET transmission reliability based on algebraic graph theory and Monte Carlo simulation. Finally, the effectiveness of the proposed method is demonstrated by a numerical example of an unmanned aerial vehicle search and rescue scene. [ABSTRACT FROM AUTHOR]

Summary: Wireless sensor networks are an indispensable part of the present industrial and environmental scenario, with the everlasting challenges to increase network lifetime and reduce energy consumption. This paper presents an energy‐efficient adaptive clustering (EEAC) model, which is built upon the existing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol with mobile sink and rendezvous nodes. The nodes are energy aware and participate in cluster head selection only if their current energy is higher than the average energy for the round. The idle nodes in the rendezvous region, which do not act as rendezvous nodes undergo clustering within themselves for the efficient routing of data. The EEAC inspires local clustering successfully conserves the energy of continuous long‐range transmission and enhances network lifetime. The proposed scheme proves to be remarkably better than the previous schemes, especially in large network cross‐sections. It improves alive nodes' performance for around 50% more rounds than the optimizing‐LEACH and the remaining energy curves improve around 500 rounds for 250 mx250 m network. For 350 mx350 m and 450 mx450 m networks, the results improved much in EEAC. In addition, the improvement in stability period is 450%, 578%, and 198% for the network cross‐section 150 mx150 m, 200 mx200m, and 250 mx250 m, respectively. [ABSTRACT FROM AUTHOR]

This document is a summary of a special issue of the journal "Energies" that focuses on energy-efficient wireless communication and networking. The issue includes 18 articles covering various domains within this field. The articles discuss topics such as power domain integration in 5G networks, secure and energy-efficient routing protocols for wireless sensor networks, energy-efficient scheduling algorithms, energy-efficient cross-layer design, energy issues in device-to-device communication, energy harvesting techniques, and more. The authors highlight the significance of energy optimization in wireless systems and present innovative approaches, algorithms, and technologies for sustainable and efficient wireless communication. The document expresses appreciation to the authors and reviewers for their contributions and hopes that the insights provided will inspire further advancements in this field. [Extracted from the article]

Summary: In the present scenario, wireless body area network (WBAN) use case has gone beyond medical monitoring (e.g., E‐Healthcare) and has become a vital part of our daily lives. WBANs, applied in E‐Healthcare systems, extract the physiological parameters through the implanted (in‐body) and/or wearable (on‐body) sensors applied to the human body and route them to the remote server in a systematized and well‐grounded manner. Thus, routing is the most primitive and non‐trivial task in WBANs for prompt and proper delivery of sensed data. The design of routing protocol is crucial for efficacious communication and high network performance. Therefore, the target of this paper is to present an all‐encompassing taxonomy of the state‐of‐the‐art routing protocols in WBANs. Firstly, this paper provides an insight into WBANs and their related projects. Next, WBAN routing challenges are explored, and after clustering these challenges based on their operating mechanism, the routing protocols are categorized into eight categories, which correspond to cluster‐ and tree‐based, cross‐layer‐based, fuzzy‐based, interference‐based, posture‐based, QoS‐based, SDN‐based, and temperature‐based routing protocols. Furthermore, comparison tables highlighting the goals, strengths, limitations, and novelty of each protocol, along with a qualitative comparison table of the routing protocols for each category based on their features are furnished. This exhaustive survey can serve as a starting point for WBAN researchers, as open research issues have been highlighted in the discussion section. [ABSTRACT FROM AUTHOR]

With the widespread use of wireless sensor networks, one of the most pressing concerns is extending the lifetime of the sensors. By deploying directional antenna arrays, millimeter wave (mmWave) is a possible candidate for wireless energy transfer (WPT). This paper investigates a beneficial combination of WPT and data transmission in a typical mmWave sensor network with Rayleigh channels, where a transmission interval can be divided into two sub-intervals. During the first sub-interval, one hybrid access point (HAP) employs beamforming techniques to transfer energy for serving multiple sensors within the service sector. The sensors then transmit their individual signal in turn to the HAP based on time division multiple address (TDMA) strategy by using the whole harvested energy. According to stochastic geometry, the exact and approximate expressions of beam outage probability for the considered system are determined, respectively. The optimal time allocation of energy harvesting and data transmission for sensors is examined in order to maximize the energy efficiency of the system. The optimization problem can be translated into corresponding parametric form, and the resulting optimization problem can be solved using the Lagrange dual method with Karush–Kuhn–Tucker (KKT) conditions. The numerical results show the variation trend of the beam outage probability under various parameters and verify the accuracy of the theoretical analyses. Furthermore, the simulation results illustrate that the proposed optimal time allocation strategy can significantly enhance the overall energy efficiency of the system compared with a similar scheme. [ABSTRACT FROM AUTHOR]

The design of underwater wireless sensor networks (UWSNs) faces many challenges, including power consumption, storage, battery life, and transmission bandwidth. UWSNs usually either use node clustering or multi-hop routing as their energy-efficient optimization algorithms. The cluster optimization technique will organize the sensor nodes into a cluster network, with each cluster led by a cluster head (CH). In contrast, the multi-hop optimization algorithm will create a multi-hop network by sending data to the base station (BS) while switching between different sensor nodes. However, the overburdens of CH nodes impact the performance of the cluster optimization method, whereas the overburdens of nodes close to the BS impact the performance of the multi-hop optimization algorithm. Therefore, clustering and routing procedures can be considered as a simultaneous NP-hard problem that metaheuristic algorithms can address. With this motivation, this paper proposes an energy-efficient clustering and multi-hop routing protocol using the metaheuristic-based algorithm to increase energy efficiency in UWSNs and lengthen the network life. However, the existing metaheuristic-based methods use two separate algorithms for clustering and multi-hop routing, increasing computational complexity, different initialization, and difficulty in hyperparameters' tuning. In order to address the mentioned shortcomings, this paper proposes a novel hierarchical structure called hierarchical chimp optimization (HChOA) for both clustering and multi-hop routing processes. The proposed HChOA is validated using various metrics after being simulated using an extended set of experiments. Results are compared to those from LEACH, TEEN, MPSO, PSO, and IPSO-GWO to validate the impact of the HChOA. According to the findings, the HChOA performed better than other lifespan and energy usage benchmarks. [ABSTRACT FROM AUTHOR]

In optical networks, increasing longevity is of critical importance. This article describes a cutting-edge routing protocol based on Q-learning techniques that have been meticulously constructed to extend the lifetime of optical networks by enhancing energy effectiveness and throughput. The protocol dynamically manages energy usage using Q-learning, a reinforcement learning approach. The primary objective is to choose routing algorithms that optimize long-term revenues for individual nodes while increasing energy efficiency. In a detailed study, the protocol's performance is compared to that of well-known rivals such as Low-Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Low-Energy Adaptive Clustering Hierarchy (M-LEACH), and Balanced Low-Energy Adaptive Clustering Hierarchy (B-LEACH) (B-LEACH). The evaluation considers several factors, including network durability as measured by active/inactive node ratios, energy efficiency as measured by per-round energy consumption, quality of service as measured by throughput per round, and scalability as measured over networks with 40, 70, and 100 nodes. The complete examination for each network configuration spans over 5,000 cycles. M-LEACH outperforms LEACH and B-LEACH in all performance measures in the simulation results test, establishing a new benchmark. It is fascinating to compare the performance of the unique Q-learning-based protocol to that of LEACH, M-LEACH, and B-LEACH. Regarding network durability, energy efficiency, quality of service, and scalability, the proposed protocol outperforms. [ABSTRACT FROM AUTHOR]

One of the network performance challenges of Vehicular Ad Hoc Networks (VANET) is the Black Hole attack. This destructive attack severely damages the network performance if succeeded. By replying to a route request with the minimum routing cost and the maximum sequence number (SN) value, the malicious vehicle can fool the source vehicle that it has the "freshest" and best cost-effective route to the destination vehicle. As a result, all data packets intended to a legitimate destination are caught and destroyed by the malicious vehicle. This may also cause a serious risk for autonomous vehicle control system or traffic warning applications. Previous published malicious detection algorithms suffer high error rates when the malicious node uses a "close-to-legitimate" SN value to attack or actively change the information in the route reply packet. This paper proposes a Black Hole Attack Detection Algorithm (BADA) based on a machine learning approach. In VANETs, it is a challenge to differentiate the behavior of malicious vehicles as they try to avoid detection by imitating that of the normal vehicles. The BADA classification algorithm outperforms existing solutions because it relies on the history of each vehicle's route request and response behavior, and it deploys the k-Nearest Neighbors machine learning algorithm to identify malicious vehicles. The paper also proposes a Black hole Attack Detection Routing Protocol which utilizes the proposed BADA solution to realize a more secured and improved AODV-based protocol. Using the NS2 simulation system, the paper evaluates the performance of the proposed protocol and compares it with related solutions on the traffic network model in Ho Chi Minh city, Vietnam under black hole attacks using minimum SN values. Simulation results have shown that the proposed algorithm can correctly detect the malicious node higher than 99.0%, outperforming previously published algorithms. [ABSTRACT FROM AUTHOR]

Wireless Multimedia Sensor Networks (WMSNs) are being extensively utilized in critical applications such as environmental monitoring, surveillance, and healthcare, where the reliable transmission of packets is indispensable for seamless network operation. To address this requirement, this work presents a pioneering Distributed Dynamic Cooperation Protocol (DDCP) routing algorithm. The DDCP algorithm aims to enhance packet reliability in WMSNs by prioritizing reliable packet delivery, improving packet delivery rates, minimizing end-to-end delay, and optimizing energy consumption. To evaluate its performance, the proposed algorithm is compared against traditional routing protocols like Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), as well as proactive routing protocols such as Optimized Link State Routing (OLSR). By dynamically adjusting the transmission range and selecting optimal paths through cooperative interactions with neighboring nodes, the DDCP algorithm offers effective solutions. Extensive simulations and experiments conducted on a wireless multimedia sensor node testbed demonstrate the superior performance of the DDCP routing algorithm compared to AODV, DSR, and OLSR, in terms of packet delivery rate, end-to-end delay, and energy efficiency. The comprehensive evaluation of the DDCP algorithm against multiple routing protocols provides valuable insights into its effectiveness and efficiency in improving packet reliability within WMSNs. Furthermore, the scalability and applicability of the proposed DDCP algorithm for large-scale wireless multimedia sensor networks are confirmed. In summary, the DDCP algorithm exhibits significant potential to enhance the performance of WMSNs, making it a suitable choice for a wide range of applications that demand robust and reliable data transmission. [ABSTRACT FROM AUTHOR]

Energy constraint has become the major challenge for designing wireless sensor networks. Network lifetime is considered as the most substantial metric in these networks. Routing technique is one of the best choices for maintaining network lifetime. This paper demonstrates implementation of new methodology of routing in WSN using firefly swarm intelligence. Energy consumption is the dominant issue in wireless sensor networks routing. For network cutoff avoidance while maximize net lifetime energy exhaustion must be balanced. Balancing energy consumption is the key feature for rising nets lifetime of WSNs. This routing technique involves determination of optimal route from node toward sink to make energy exhaustion balance in network and in the same time maximize network throughput and lifetime. The proposed technique show that it is better than other some routing techniques like Dijkstra routing, Fuzzy routing, and ant colony (ACO) routing technique. Results demonstrate that the proposed routing technique has beat the three routing techniques in throughput and extend net lifetime. [ABSTRACT FROM AUTHOR]

Underwater wireless sensor nodes comprise hundreds to thousands of battery-operated sensor nodes with limited bandwidth. These networks are employed to transmit the data with enhanced quality of service (QoS). However, efficient data routing is the most challenging obstacle in many underwater applications. To solve the issues in underwater sensor nodes, the hybridized cluster-based geographical opportunistic routing protocol with distance vector establishment has been proposed to transmit the data efficiently. Primarily, the proposed methodology finds out the shortest path with minimal hop count whereas the void node can be updated with infinite hop count. Thereafter, the sleep/wake scheduling and waiting mechanism and periodic beaconing algorithm are incorporated into the proposed model to attain a higher packet delivery ratio with minimal energy consumption. This proper scheduling and optimal cluster routing enhance the continuous data transmission in underwater applications. The simulation result reveals that the proposed method achieves better energy efficiency and higher network lifetime when compared with the existing clustering methods. [ABSTRACT FROM AUTHOR]

Network congestion is one of the major issues in wireless sensor networks (WSNs) that result in packet loss, reduced network lifetime, low throughput and energy waste. Determining a better path to mitigate the congestion is a better approach to improve the performance of WSNs. In this paper, an adaptive neuro-fuzzy inference system (ANFIS) based path determination approach is proposed to mitigate the congestion with black widow optimization (BWO) algorithm. The proposed approach first develops a framework to mitigate the congestion in WSNs. Then it forecast the buffer occupancy with the exponential smoothing technique. Finally, ANFIS is applied in the proposed approach for determining the path with appropriate weights by considering the remaining energy, hop count and buffer occupancy. Here, the hop count, buffer occupancy and remaining energy are considered as the input factors for the ANFIS. The simulation results of the proposed method show better quality of service, high energy, low delay, high packet delivery ratio with number of increasing alive nodes when compared to existing methods. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) and the Internet of Things (IoT) have emerged as transforming technologies, bringing the potential to revolutionize a wide range of industries such as environmental monitoring, agriculture, manufacturing, smart health, home automation, wildlife monitoring, and surveillance. Population expansion, changes in the climate, and resource constraints all offer problems to modern IoT applications. To solve these issues, the integration of Wireless Sensor Networks (WSNs) and the Internet of Things (IoT) has come forth as a game-changing solution. For example, in agricultural environment, IoT-based WSN has been utilized to monitor yield conditions and automate agriculture precision through different sensors. These sensors are used in agriculture environments to boost productivity through intelligent agricultural decisions and to collect data on crop health, soil moisture, temperature monitoring, and irrigation. However, sensors have finite and non-rechargeable batteries, and memory capabilities, which might have a negative impact on network performance. When a network is distributed over a vast area, the performance of WSN-assisted IoT suffers. As a result, building a stable and energy-efficient routing infrastructure is quite challenging in order to extend network lifetime. To address energy-related issues in scalable WSN-IoT environments for future IoT applications, this research proposes EEDC: An Energy Efficient Data Communication scheme by utilizing "Region based Hierarchical Clustering for Efficient Routing (RHCER)"—a multi-tier clustering framework for energy-aware routing decisions. The sensors deployed for IoT application data collection acquire important data and select cluster heads based on a multi-criteria decision function. Further, to ensure efficient long-distance communication along with even load distribution across all network nodes, a subdivision technique was employed in each tier of the proposed framework. The proposed routing protocol aims to provide network load balancing and convert communicating over long distances into shortened multi-hop distance communications, hence enhancing network lifetime.The performance of EEDC is compared to that of some existing energy-efficient protocols for various parameters. The simulation results show that the suggested methodology reduces energy usage by almost 31% in sensor nodes and provides almost 38% improved packet drop ratio. [ABSTRACT FROM AUTHOR]

The enormous increase in heterogeneous wireless devices operating in real-time applications for Internet of Things (IoT) applications presents new challenges, including heterogeneity, reliability, and scalability. To address these issues effectively, a novel architecture has been introduced, combining Software-Defined Wireless Sensor Networks (SDWSN) with the IoT, known as the SDWSN-IoT. However, wireless IoT devices deployed in such systems face limitations in the energy supply, unpredicted network changes, and the quality of service requirements. Such challenges necessitate the careful design of the underlying routing protocol, as failure to address them often results in constantly disconnected networks with poor network performance. In this paper, we present an intelligent, energy-efficient multi-objective routing protocol based on the Reinforcement Learning (RL) algorithm with Dynamic Objective Selection (DOS-RL). The primary goal of applying the proposed DOS-RL routing scheme is to optimize energy consumption in IoT networks, a paramount concern given the limited energy reserves of wireless IoT devices and the adaptability to network changes to facilitate a seamless adaption to sudden network changes, mitigating disruptions and optimizing the overall network performance. The algorithm considers correlated objectives with informative-shaped rewards to accelerate the learning process. Through the diverse simulations, we demonstrated improved energy efficiency and fast adaptation to unexpected network changes by enhancing the packet delivery ratio and reducing data delivery latency when compared to traditional routing protocols such as the Open Shortest Path First (OSPF) and the multi-objective Q-routing for Software-Defined Networks (SDN-Q). [ABSTRACT FROM AUTHOR]

In order to compensate for the shortcomings in the security of the AODV(Ad Hoc on Demand Distance Vector) routing protocol while obtaining the shortest paths based on this optimized protocol, a study of a TAODV(Trusted Ad Hoc on Demand Distance Vector Routing Algorithm)routing protocol that improves on the original AODV routing protocol is proposed using the trust mechanism model approach. This protocol performs the relevant operations based on the trust values of each node to determine the path trust values during the operation of the routing protocol. The simulation results show that the improved TAODV routing protocol outperforms the traditional AODV routing protocol in terms of normalized routing overhead, minimum hop count and optimal path, and enhances the robustness and destructiveness of the network. [ABSTRACT FROM AUTHOR]

In this paper, an improved routing protocol for multipath network load balancing is proposed for defects in the traditional AOMDV (Ad hoc On-demand Multipath Distance Vector) protocol. This research work analyzes problems in traditional routing protocols and estimates the available path load according to network transmission in Wireless Mesh Networks (WMN). Moreover, we design a load distribution scheme according to a given load and improve multi-path load balancing by using the MCMR method. We also control path discovery and the number of paths while also establishing routing paths and probability balancing. Lastly, improvements are made to the AOMDV protocol and efficient data transmission is acheived. The performance results of the modified routing protocol show that the designed protocol can improve successful delivery rate and prolong network survival time. [ABSTRACT FROM AUTHOR]

Wireless sensor network (WSN) comprises the interconnection of things or objects that are embedded with both hardware and software. The WSN is a tiny sensor with end device sensors that are connected to the Internet. To perform effective routing in the WSN efficient and reliable data collection, schemes are deployed with the routing protocol for low power and lossy networks (RPL) routing scheme for the low power and lossy network. The RPL routing scheme of the low and lossy routing protocol design for the network with the objective function. The objective function in RPL routing involved network construction and maintenance through hop count. The RPL scheme uses the destination-oriented directed acyclic graph (DODAG) with the greedy election for estimation of instability in the network. The routers in the WSN are enabled with the software-defined network (SDN) server node. The process of routing comprises detection of routes between the source and the destination. This paper focused on secure routing and monitoring schemes in WSN. To improve the secure routing process in WSN, this paper developed a deep RPL-software-defined network (DRPL_SDN). The DRPL_SDN concentrated on the parent selection through RPL based on the predicted energy level of the parent node. The prediction is performed with the DRPL_SDN-based reinforcement learning method with the estimation of child count through a partial stability routing mechanism. The secure prediction is performed through the deep reinforcement learning method in DRPL_SDN for the succeeded node count for the routing stability. The security model is evaluated with the utilization of the knowledge discovery in database (KDD) dataset. With the KDD dataset, the different attacks are evaluated in the proposed DRPL_SDN model. Additionally, the proposed DRPL_SDN exhibits better load balancing with the uncontrolled node in the network. The DRPL_SDN focused on the establishment of a link in the available network path through a dynamic controlled environment. The simulation analysis expressed that DRPL_SDN achieves the minimal packet loss of 236 and the energy consumption is minimal for 6%. The simulation examination expressed that the DRPL_SDN model exhibits the ~ 13% higher performance than the RPL and ELDR. [ABSTRACT FROM AUTHOR]

Mobile charging devices (MCDs) have been regarded as a promising way to solve the energy shortage of wireless sensor networks. Due to ignoring some important factors, such as redundant sensor nodes, there is still room to improve network lifetimes. We propose a charging strategy for wireless sensor networks with one energy-limited MCD. To give the best support for sensor nodes which need charging the most, an algorithm is proposed to find the minimum sensor nodes which keep the coverage and connectivity of the network and have the least energy requirements. Then, the goal of maximizing network lifetime is changed into how to utilize the limited energy of the MCD to guarantee the minimum sensor nodes work as long as possible. If the MCD has enough energy for all sensor nodes, the charging algorithm is designed to minimize the outage time of the network and maximize charging efficiency. Otherwise, if the energy capacity is larger than the least energy requirement, the charging target minimizes the outage time of the minimum sensor node; otherwise the charging problem becomes maximizing the lifetime of minimum sensor nodes, which has lower complexity. The results of simulation experiments confirm that our scheme prolongs network lifetime and improves charging efficiency. [ABSTRACT FROM AUTHOR]

Cardiac disorders are a leading cause of global casualties, emphasizing the need for the initial diagnosis and prevention of cardiovascular diseases (CVDs). Electrocardiogram (ECG) procedures are highly recommended as they provide crucial cardiology information. Telemedicine offers an opportunity to provide low-cost tools and widespread availability for CVD management. In this research, we proposed an IoT-based monitoring and detection system for cardiac patients, employing a two-stage approach. In the initial stage, we used a routing protocol that combines routing by energy and link quality (REL) with dynamic source routing (DSR) to efficiently collect data on an IoT healthcare platform. The second stage involves the classification of ECG images using hybrid-based deep features. Our classification system utilizes the "ECG Images dataset of Cardiac Patients", comprising 12-lead ECG images with four distinct categories: abnormal heartbeat, myocardial infarction (MI), previous history of MI, and normal ECG. For feature extraction, we employed a lightweight CNN, which automatically extracts relevant ECG features. These features were further optimized through an attention module, which is the method's main focus. The model achieved a remarkable accuracy of 98.39%. Our findings suggest that this system can effectively aid in the identification of cardiac disorders. The proposed approach combines IoT, deep learning, and efficient routing protocols, showcasing its potential for improving CVD diagnosis and management. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSNs), existing routing protocols mainly consider energy efficiency or security separately. However, these protocols must be more comprehensive because many applications should guarantee security and energy efficiency, simultaneously. Due to the limited energy of sensor nodes, these protocols should make a trade-off between network lifetime and security. This paper proposes a cluster-tree-based trusted routing method using the grasshopper optimization algorithm (GOA) called CTTRG in WSNs. This routing scheme includes a distributed time-variant trust (TVT) model to analyze the behavior of sensor nodes according to three trust criteria, including the black hole, sink hole, and gray hole probability, the wormhole probability, and the flooding probability. Furthermore, CTTRG suggests a GOA-based trusted routing tree (GTRT) to construct secure and stable communication paths between sensor nodes and base station. To evaluate each GTRT, a multi-objective fitness function is designed based on three parameters, namely the distance between cluster heads and their parent node, the trust level, and the energy of cluster heads. The evaluation results prove that CTTRG has a suitable and successful performance in terms of the detection speed of malicious nodes, packet loss rate, and end-to-end delay. [ABSTRACT FROM AUTHOR]

The Internet of Things in smart environments interrelates with Mobile Ad‐hoc Network and Wireless Sensor Network, which becomes more attractive and efficiently flourishing. Moreover, Mobile Ad‐hoc Network is applied in various fields including intelligent transportation, emergency communications after disaster, and Internet of Things. The incorporation of Internet of Things and Mobile Ad‐hoc Network become a rising theory for enabling opportunistic communication in Internet of Things. The security provisioning for secure communication is still the major challenge in Mobile Ad‐hoc Network – Internet of Things. Thus, in this paper, the DEroute algorithm is developed for secure communication Internet of Things structure, where Internet of Things nodes are located in mobile ad-hoc manner. In order to avoid the route list modification, nodes' address is encrypted based on generated secret keys by Diffie–Hellman key-exchange algorithm. The fuzzy system with trust parameters, like historical, indirect and direct trust factors are considered for the identification of secure nodes. The bi-filtering process is also performed for filtering important nodes. Thus, the developed DEroute model achieved enhanced performance with respect to delay, packet delivery ratio and throughput of 0.1674 sec, 87.23% and 25.19 mbps, respectively. [ABSTRACT FROM AUTHOR]

Sensor nodes are expected to remain autonomous for a long period of time and communication must be successfully maintained. Therefore, energy efficiency and communication reliability are the main challenges in wireless sensor networks (WSNs). Clustering-based routing protocols are the main solution to energy constraints in this kind of network. Channel coding is required in a lossy milieu to guarantee reliable and efficient transmission. However, this reliability is compromised by the added energy of encoding and decoding in the network. In this context, to explore the trade-off between energy efficiency and reliability, we proposed two approaches: ACC-LDPC (Adaptive Coding Clustered protocol with LDPC decoding) and ACC-RS/LDPC (Adaptive Coding Clustered protocol with RS and LDPC decoding) for clustered multi-hop WSNs. The proposed approaches are based on intra and inter-cluster distances to enhance the transmission reliability, extend the network lifetime and minimize the energy consumption in the WSN. Simulation results show that ACC-RS/LDPC scheme enhances both energy consumption and transmission reliability compared to the ACC-LDPC scheme in clustered multi-hop WSNs. ACC-RS/LDPC improves the reliability of the uncoded system by 90%, while ACC-LDPC enhances it by 82%. Thus, the ACC-RS/LDPC outperforms the ACC-LDPC by increasing the network lifetime by 33%. [ABSTRACT FROM AUTHOR]

The internet of things (IoT) is a collection of systems connected to an online network consisting of things. Routing Protocol for Low-Power and Lossy Networks (RPL) is a proactive routing protocol for wireless networks based on distance vectors. Several methods have been proposed for improving RPL protocol security, suffering from lack of accuracy, the authenticity of intrusion detection, and lack of scalability. Therefore, in this research, an intrusion detection system based on deep cellular learning automata and semantic hierarchy is developed to increase RPL protocol security. Semantic hierarchy is used to transform attack features into significant values, and deep cellular learning automata are employed to increase the security of the RPL protocol. Here five datasets related to attacks, including Darknet, "Version Number", "NSL-KDD", "Botnet", and Distributed Denial of Service (DDoS), have been used. Comparing the proposed results on five datasets indicates that the proposed method outperforms its counterparts. Also, the proposed model has been tested on Blackhole, NID, and BoT-IoT datasets based on ANN and CNN's Deep Neural Network. The results of penetration detection accuracy of the proposed method on Blackhole datasets, NID, and BoT-IoT were 99.65%, 99.71%, and 93.75%, respectively, which improved by averages of 0.42% compared to ANN and 0.55% compared to CNN methods. [ABSTRACT FROM AUTHOR]

In wireless sensor network projects, it is generally desired to cover the area to be monitored at a given cost and to achieve the maximum useful network lifetime. In the deployment of the wireless sensors, it is necessary to know in advance how many sensor nodes will be required, how much the distance between the nodes should be, etc., or what the transmit power level should be, etc. depending on the channel parameters of the area. This necessitates accurate calculation of variables such as maximum network lifetime, communication channel parameters, number of nodes to be used, and distance between nodes. As numbers reach to the order of hundreds, calculation tends to a NP hard problem to solve. At this point, we employed both single-based and stacked ensemble-based machine learning models to speed up the parameter estimations with highly accurate outcomes. Adaboost was superior over other models (Elastic Net, SVR) in single-based models. Stacked ensemble models achieved best results for the WSN parameter prediction compared to single-based models. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) is a smart technology that allows communication between humans and all things that contain sensors, actuators, embedded electronics, software, or storage via the internet. As a result, IoT should be seen as a part of the overall Internet of the future, which is likely to be very different from what we are using today. Despite the advantages of IoT, energy efficiency is still considered one of the main challenges in IoT. There are many algorithms that have been proposed to solve the energy efficiency problem. Unfortunately, most of them have some drawbacks. As a result, an Enhanced Threshold Sensitive Distributed Energy-Efficient Clustering routing protocol (ETSDEEC) for WSN-based IoT was proposed in this paper. Hard and soft thresholds are used in the proposed protocol to determine whether nodes are allowed to send their sensed data. From the simulation, we found that the proposed ETSDEEC protocol performs better than EDEEC and TDEEC protocols in terms of network lifetime, energy dissipationand throughput. It is also found that the proposed ETSDEEC can improve the lifetime by 59.8% in comparison to EDEEC and about 37.7% in comparison to TDEEC protocols. [ABSTRACT FROM AUTHOR]

Summary: The Internet of Things (IoT) has recently attained a prominent role in enabling smooth and effective communication among various networks. Wireless sensor network (WSN) is utilized in IoT to collect peculiar data without interacting with humans in specific applications. Energy is a major problem in WSN‐assisted IoT applications, even though better data communication is achieved through cross‐layer models. This paper proposes a new cross‐layer‐based clustering and routing model to provide a scalable and energy‐efficient long data communication in WSN‐assisted IoT systems for smart agriculture. Initially, the fuzzy k‐medoids clustering approach is used to split the network into various clusters since the formation of clusters plays an important role in energy consumption. Then, a new swarm optimization known as enhanced sparrow search algorithm (ESSA), which is the combination of SSA and chameleon swarm algorithm (CSA), has been introduced for optimal cluster head (CH) selection to solve the energy‐hole problems in WSN. A cross‐layer strategy has been preferred to provide efficient data transmission. Each sensor node parameter of the physical layer, network layer and medium access control (MAC) is considered for processing routing. Finally, a new bio‐inspired algorithm is known as the sandpiper optimization algorithm (SOA), and cosine similarity (CS) has been employed to determine the optimal route for efficient data transmission and retransmission. The simulation of the proposed protocol is implemented by network simulator (NS2), and the simulation results are taken in terms of end‐to‐end delay, PDR, communication overhead, communication cost, average consumed energy, and network lifetime. [ABSTRACT FROM AUTHOR]

Wireless sensor networks congestion occurs easily due to its centralized traffic pattern. Normally, mono-sync wireless sensor network experiences multiple traffic flow congestion in the dense environment of the network, which leads to excess energy consumption and severe packet loss. To overcome these issues, a congestion detection and alleviation mechanism using cluster based heuristic optimized hierarchical routing protocol is proposed in this paper. Here, congestion detection and alleviation utilize the features of sensor nodes. The congestion is categorized into two types: (i) node level congestion and (ii) link level congestion. The node level congestion is detected by assessing the buffer utilization and the interval amid the consecutive data packets. The link level congestion is considered with computing link usage utilizing back-off step of round robin carrier sense multi-access with collision avoidance. Congestion detection and alleviation reactively affected node/link through cuckoo hosted rider search multi-hop routing algorithm. It has two phases: the cluster head selection and multi-path routing. Cluster head selection is performed through Taylor multiple random forest kernel fuzzy C-means clustering algorithm and multi-path routing is performed through cuckoo hosted rider search multi-hop routing algorithm. The simulation of the proposed method is done in network simulator tool. Here, the performance metrics, like packet delivery ratio, delay, energy consumption, packet drop, overhead, network lifetime and throughput are calculated. The experimental outcomes of the proposed technique shows 11.6%, 18.4% and 28.1% lower delay, 78.2%, 65.4% and 52.6% higher packet delivery ratio, and 29.2%, 37.4% and 40.8% lower packet drop compared with the existing methods, like congestion detection and alleviation using multi-attribute decision-making in optimization-based hybrid congestion alleviation routing protocol in wireless sensor networks, congestion detection and alleviation using hybrid K-means with greedy best first search algorithms in packet rate reduction utilizing adaptive weight firefly algorithm ant colony optimization based routing protocol in wireless sensor networks and congestion detection and alleviation using multi-input time on task optimization algorithm for altered gravitational search algorithm routing protocol in wireless sensor networks. [ABSTRACT FROM AUTHOR]

Summary: Over the last decade, the Internet of Things (IoT) has become ever more popular, as is evident from its role in changing the human lifestyle and conferring remarkable privileges for them. It has a significant presence in various crucial areas, including smart cities, smart factories, manufacturing, transportation, and healthcare. Massive amounts of data generated by IoT devices have the potential to endanger the lifetime of nodes in IoT‐based networks due to increased communication power consumption. It has become crucial to propose solutions for network‐based issues, such as quality of service, security, network heterogeneity, congestion avoidance, reliable routing, and energy conservation. To address the mentioned problems, routing protocols play a critical role in data transmission among heterogeneous items. In such environments, routing refers to constructing routes between mobile nodes. Since identifying optimal routes among IoT nodes and establishing an effective routing protocol in an IoT network are an NP‐hard issue, employing metaheuristic algorithms may be a viable solution to overcome this problem. Various IoT routing protocols based on metaheuristic algorithms have been presented in recent years, but there is still a lack of systematic study for reviewing the existing works. The current study emphasizes the impact of metaheuristic algorithms in the IoT routing problem, discusses the optimization models, presents a comprehensive comparison of protocols based on critical parameters, and eventually suggests some hints for future studies. [ABSTRACT FROM AUTHOR]

One of the major challenge in Wireless Sensor Networks (WSN's) deployment is efficient energy consumption. Critical distance, proper routing algorithm and error control coding techniques can be used for energy optimization. As WSN contains a large number of power constrained sensors, the sensed data from the environment should be transmitted in a cooperative way to the base station (BS). The pattern of the clustering structure can extend the sensor network life time, reduce the total consumed energy and regulate the data transmission. Clustering concept combines group of sensors which are located in the same communication range. Some of the routing protocol like, SEED, LEACH, SEP, Z-SEP etc., suffers from idle listening problem, which cannot cope with an environment with sensor nodes. It leads to energy wastage across the network. To manage energy efficiency and traffic heterogeneity issues, a new routing protocol called enhanced energy efficient sleep awake aware intelligent sensor network (EEESAA) is proposed. Here, one sensor in each group will be in active mode whereas other sensors entered in sleep mode. Based on the nodes energy, sleep and awake node pairs will be altered. In the proposed method, one slot is allotted for group of pairs. The proposed approach is evaluated and compared against LEACH, SEP and Z-SEP protocols. Simulation results show that EEESAA protocol performs better than LEACH, SEP, Z-SEP in terms of cluster head selection, throughput, number of alive & dead nodes and network lifetime. [ABSTRACT FROM AUTHOR]

New energy integration is thought to be one of the most potential solutions to support the power system with a sustainable energy infrastructure. However, new energy is an uncertain power generation resource, and the electricity generated by it has the characteristics of randomness, intermittency and reverse peak regulation. Its large-scale integration into the power grid makes the operation and reliability scheduling of the power system more challenging. It was important to build a wireless sensing and monitoring network to monitor the power and change trend of the new energy field (station) in real time. The energy consumption of wireless sensing monitoring network is an important factor to improve the reliability of new energy scheduling. Based on the energy consumption of the wireless sensing monitoring network built by the new energy scheduling, the compression sensing technology was integrated and the network routing protocol (I-LEACH protocol) was optimized. The sampling data was transmitted by the cluster head node at the compression rate of 0.6, the improved OMP (Orthogonal Matching Pursuit) algorithm was reconstructed to achieve reliable data transmission, and the network energy consumption was further reduced. Compared with the I-LEACH routing protocol network, the experiments show that the network residual energy of the proposed method increased by 22% and the life cycle increased by about 30%. This method is helpful to improve the reliability of new energy power dispatching system and it can provide reference for realizing the reliability scheduling of new energy power system. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are used in many different fields. One of the most recent and rapidly expanding applications is the Internet of Things (IoT), which enables the connectivity of numerous objects or devices over the Internet. However, WSNs have a bigger concern about battery power than mobile ad hoc networks, which shortens the network's lifetime. As a result, extensive research has been done on lowering WSNs' energy usage. Designing a hierarchical clustering algorithm is one of many methods for lowering the energy consumption of WSNs. Given the restricted hardware capabilities of the sensor nodes, modeling and building energy-efficient routing solutions to enhance the overall network lifetime has emerged as one of the most crucial approaches in wireless sensor networks. Cluster-based heterogeneous routing protocols, a typical feature of routing technology, have demonstrated efficacy in managing topology, energy consumption, data collection or fusion, dependability, or stability in distributed sensor networks. The existing Distributed Energy-Efficient Clustering (DEEC) clustering protocol is changed in this study by switching the power level between the nodes and adding a threshold limit for cluster head selection. The number of packets sent to a base station increases by 843% when comparing the proposed improved DEEC protocol to the existing DEEC protocol, increasing the number of living nodes to more than 10,000 rounds, or over 30,000 rounds, which can be used to extend the WSN lifetime. The suggested algorithm outperforms alternative energy-efficient protocols in terms of stability period and network lifetime under various scenarios of area, energy, and node density. [ABSTRACT FROM AUTHOR]