Routing Protocol For Wireless Sensor Networks Research Articles

SOA-EACR: Seagull optimization algorithm based energy aware cluster routing protocol for wireless sensor networks in the livestock industry

The primary goal of Wireless Sensor Networks (WSNs) in the livestock industry is to monitor the health conditions of various animals and their activities. Energy conservation in WSN is one of the most challenging tasks since the devices are connected to limited resource devices. So, clustering is the best choice to save energy in WSN. The sensor nodes are connected to the animal and move from one location to another because of the dynamic nature. In recent years, several clustering protocols have been proposed using an optimization algorithm to conserve energy in the network. However, it takes more time to converge in selecting the best cluster head in the network. The energy is therefore drained early in the network. To overcome the limitation, this paper proposes a Seagull Optimization Algorithm based Energy Aware Cluster Routing Protocol (SOA-EACR) in WSN to prolong the network's lifespan and reduce the end to end delay. The SOA-EACR balances the exploration and exploitation during the CH selection. Thus, it prolongs the lifespan of the network. The simulation is performed using MATLAB 2019a. The efficacy of SOA-EACR is compared with CLPSO, CACONET and GWO. The proposed SOA-EACR enhances the network life by 20 % and increases the packet delivery ratio by 2–5 %.

Enhancing Wireless Sensor Networks Routing Protocols based on Cross Layer Interaction

Wireless sensor networks aim to develop a smart city based on sensing environment. The routing protocols of wireless sensor networks is important to transfer the data in smart cities since sensor nodes have limited power and transmission range. The aim of this research is to enhance wireless sensor networks routing protocols based on proposed cross-layer interaction between physical layer and network layer also a proposed routing table information of wireless sensor nodes is developed to consider the transmission power of neighbor’s nodes to determine the next hop. Cross-layer interaction provides a useful information and effective adaptation for WSN routing protocols. As a result, the proposed routing protocol shows an improvement in network performance when number of intermediate nodes are minimized.

A Systematical Roadmap on Various Security Vulnerabilities and Countermeasures in Routing Algorithms upon WSNs

Wireless Sensor Networks (WSN) is now an evolving technology and has a broad range of applications, such as battlefield surveillance, traffic surveillance, detection of forest fires, detection of floods, etc. The communication nature of the wireless sensor network is unprotected and dangerous due to deployment in hostile environments, restricted resources, an automatic nature, and untrusted media for broadcast transmission. For wireless sensor networks, several routing protocols have been suggested, but none of them have been developed with protection as a target. The majority function in routing algorithms currently in place for sensor networks optimize a restricted capacities in sensor nodes and the application based design of WSNs. A WSNs, however, are exposed to a number of possible threats that impede the network's regular activity. Thus, there is a strong need to provide the routing protocols of the OSI structure layer with a safe mechanism to prevent an attacker from obstructing it.
 
 The well-known attacks against all layers are discussed in this systematic roadmap, and debilitating attacks against routing protocols are analyzed and defined in particular. Several suggested attack countermeasures, design considerations and paper contributions are also included in the routing protocols. The assertion of the study is that WSN routing protocols must be built with protection in mind, and this is the only efficient solution in WSNs for safe routing. The aim of this paper is also to provide problems, attacks and countermeasures related to protection. Finally, it is hoped that this roadmap would inspire potential researchers to come up with smarter and better protection measures and make their network safer.
 The first such research analysis of secure routing protocols in WSNs is this roadmap study.

Grid-Based Routing Model for Energy Efficient and Secure Data Transmission in WSN for Smart Building Applications

Presently, due to the establishment of a sensor network, residual buildings in urban areas are being converted into smart buildings. Many sensors are deployed in various buildings to perform different functions, such as water quality monitoring and temperature monitoring. However, the major concern faced in smart building Wireless Sensor Networks (WSNs) is energy depletion and security threats. Many researchers have attempted to solve these issues by various authors in different applications of WSNs. However, limited research has been conducted on smart buildings. Thus, the present research is focused on designing an energy-efficient and secure routing protocol for smart building WSNs. The process in the proposed framework is carried out in two stages. The first stage is the design of the optimal routing protocol based on the grid-clustering approach. In the grid-based model, a grid organizer was selected based on the sailfish optimization algorithm. Subsequently, a fuzzy expert system is used to select the relay node to reach the shortest path for data transmission. The second stage involves designing a trust model for secure data transmission using the two-fish algorithm. A simulation study of the proposed framework was conducted to evaluate its performance. Some metrics, such as the packet delivery ratio, end-end delay, and average residual energy, were calculated for the proposed model. The average residual energy for the proposed framework was 96%, which demonstrates the effectiveness of the proposed routing design.

Fuzzy Logic-based Data Controlled Wireless Sensor Network Routing Protocol for Flood Early Warning

Floods account for 15% of all natural disasters related deaths. Therefore, early flood warning systems using wireless network of sensors installed in flood prone areas is necessary to provide early notice of impending flood. This research focuses on the use of an energy efficient routing protocol to prolong the life time of the Network. The importance of this is to minimize energy consumption as necessary for reliable field operations. It adopts the use of mandami Fuzzy logic-based data controlled routing protocol (F-DCRP).Simulation was carried out for the F-DCRP, LEACH and Crisp Data controlled routing protocol (DCRP). The performance of the three protocols were obtained and compared. The result showed that Cluster head (CH) load was better shared uniformly among all the nodes. Percentage of packets dropped showed that the proposed F-DCRP was 10% lower compared to DCRP and 50% lower compared to LEACH resulting in more packets sent per round and greater reliability compared to LEACH and DCRP. The network lifetime was also improved by 40 % when compared to LEACH and DCRP.

EVALUATION OF THE PERFORMANCE OF RE-AODV ROUTING PROTOCOL WITH DIFFERENT MOBILITY MODELS IN WIRELESS SENSOR NETWORKS

This paper aims to present a detailed study of different mobility models applicable for Wireless Sensor Networks (WSN). Wireless Sensor Networks (WSN) have evolved dramatically in mobile networks, providing the key advantage of offering access to information without considering a user's spatial and topological characteristics. Due to the exponential advancement of the Internet and the development of small handheld devices as a source of connectivity and data sharing, the wireless network has almost exploded over the past few years. As a routing protocol for WSN in different studies, the Ad-hoc On-demand Distance-vector routing protocol (AODV) has shown better performance than different routing protocols. It offers quick adaptation to dynamic link conditions, low processing, low memory overheads, and low network utilization. To develop an optimized routing protocol, in our previous work, we had proposed an enhancement of the AODV routing protocol to increase the performance of the classic AODV protocol by optimizing the energy consumption and automatically maximizing the network lifetime. In this paper, we present a detailed study of mobility models applicable for WSN. We describe various mobility models representing mobile nodes whose movements are independent (individual mobility models) and dependent (group mobility models). Furthermore, we will focus on studying the behavior of our optimized version of AODV that we named RE-AODV with different existing mobility models so that we can, in the end, select the best mobility model. In terms of network efficiency, simulation results in this Work demonstrate that the type of mobility model used makes the difference and influences the behavior of nodes.

A novel algorithm for wireless sensor network routing protocols based on reinforcement learning

A novel algorithm for wireless sensor network routing protocols based on reinforcement learning

Types Routing Protocols based one Energy Efficiency

Abstract: Wireless sensor networks (WSNs) consist of autonomous sensors distributed in space to monitor physical or environmental conditions such as temperature, sound, and pressure, and to coordinate communications. The information collected reaches its destination through the network infrastructure. Energy-efficient routing protocols are becoming more important because sensor nodes are power-limited devices. Several tiered routing protocols have recently been proposed to minimize power consumption. For example, LEACH is a basic hierarchical routing protocol that uses clustering to achieve energy efficiency. Much research has been done to eliminate the shortcomings and improve the performance of hierarchical routing protocols. WSN hierarchical routing protocols and analyzes the capabilities and performance of existing hierarchical routing protocols. It also compares existing routing protocols, highlights key technical differences, and provides a performance comparison of some LEACH-based routing protocols. Finally, this article highlights the issues and challenges of existing WSN routing protocols. It supports future research on the selection of appropriate research areas and provides guidance on the selection of energy saving methods in the energy efficient design of WSN routing protocols. Keywords: wireless sensor network, routing protocols, CSMA, CH, TDMA

Energy‐aware intelligent hybrid routing protocol for wireless sensor networks

AbstractDesigning a wireless sensor network (WSN) energy‐aware routing protocol is a thought‐provoking mission. Thus, this article presents an energy‐saving routing protocol for WSNs. The proposed protocol considers the energy level of sensor nodes and the distance to the base station to optimally determine the best route. It also takes advantage of the inherent complementarity of clustering techniques. The proposed routing scheme also exploits data aggregation to improve energy utilization and reduce communication costs. To choose the flawless route between a source node and the base station, ant colony optimization and A* algorithms are integrated. Finally, the performance of the proposed routing technique is compared with those of other existing up‐to‐date protocols. The results show that the proposed routing protocol outperforms them in terms of total energy consumption, network lifetime, stability period, and goodput.

An Energy-Efficient Routing Protocol for 3D Wireless Sensor Networks

Energy optimization is a key problem of the energy-limited wireless sensor network (WSN), which is usually deployed in the three-dimensional space. In order to alleviate this problem, this paper studies the energy-efficient routing protocol for 3D WSN. The less sensor nodes work simultaneously, the more energy is saved. To minimize energy consumption on the premise of satisfying the full coverage of discrete points of interest (DPOI), finding the least and optimal node set for routing is an important problem. Through studying this problem, we propose an algorithm employing the improved genetic algorithm to find the minimum set of sensor nodes which can ensure the full coverage of DPOI. On the basis of the optimal node set, we propose a new adaptive clustering routing optimizing energy consumption, which includes three parts. The first one is selecting the cluster head according to the residual energy of the sensor node and the distance from the base station. The second one is setting the intra-cluster communication mode by considering the angle of node space. The last one is deciding inter-cluster communication mode by combining single-hop and multi-hop. To fully utilize the energy of the network, we design a node wake-up scheme to wake up the sleep node to replace the sensor nodes which runs out of energy. This policy also can make our proposed protocol suitable for the rechargeable WSN. In addition, we also consider the additional energy consumption of retransmission caused by the unreliable wireless channel. Simulation results show that our proposed scheme is obviously superior to other existing schemes in prolonging the WSN lifetime.

Evaluating DoS jamming attack on reactive routing protocol in wireless sensor networks

Wireless sensor networks (WSNs) over the years have emerged as the enabling underlining infrastructure for new wireless technology trends such as Internet-of Things (IoT) and Fog Computing. Its application has spread across diverse fields such as agriculture, military, healthcare and home automation. Despite its promising attributes, it is characterized by its extremely limited resources such as battery energy and memory. Additionally, its deployment in hostile and unattended areas make it vulnerable to security attacks. One of such attacks is the denial of service (DoS) jamming attack that is perpetrated by malicious nodes emitting radio frequency signals to disrupt and interfere with the normal functions of the sensor nodes in the network. This eventually causes a denial of service in the network. Different routing protocols have been proposed over the years to guarantee reliable communication and maintain the network lifetime and functionality for a reasonable duration, notwithstanding DoS jamming attack. Therefore, in this work, we evaluate the effect of a constant jamming DoS attack on two key reactive routing protocols in WSN, ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). Metrics such as packet sending ratio (PSR), packet loss (PL) and transmitted packets are used to measure the impact of constant jamming DoS attack in the network. Simulation results using network simulation 2 (NS2) and trace graph show that, irrespective of the adopted reactive routing protocol, the impact of the jamming attack is the same.

A Survey on Enhanced Energy Efficient Routing Protocol of WSN for Internet of Things

Wireless Sensor Networks (WSNs) are a resource-constrained network class recognized as a major energy consumer. Wireless sensor technologies are used in many commercialized industrial automation processes and other real-world applications. The WSN protocol is well-suited to harsh situations where deployment is difficult or impossible, such as the battlefield, a toxic chemical plant, the cloud, fog computing, and the Internet of Things, but not in a high-temperature network infrastructure environment. WSNs have introduced various Energy-Efficient Routing Protocols based on network (NW) organization and protocols in recent years. Various WSN routing options for energy efficiency are explored in this work. The WSN Energy Efficient Routing Protocol is compared to other routing systems. We also compare and investigate better WSN routing algorithms for cloud computing, fog computing, and the Internet of Things.

Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks.

Wireless Sensor Networks (WSNs) have gained great significance from researchers and industry due to their wide applications. Energy and resource conservation challenges are facing the WSNs. Nevertheless, clustering techniques offer many solutions to address the WSN issues, such as energy efficiency, service redundancy, routing delay, scalability, and making WSNs more efficient. Unfortunately, the WSNs are still immature, and suffering in several aspects. This paper aims to solve some of the downsides in existing routing protocols for WSNs; a Lightweight and Efficient Dynamic Cluster Head Election routing protocol (LEDCHE-WSN) is proposed. The proposed routing algorithm comprises two integrated methods, electing the optimum cluster head, and organizing the re-clustering process dynamically. Furthermore, the proposed protocol improves on others present in the literature by combining the random and periodic electing method in the same round, and the random method starts first at the beginning of each round/cycle. Moreover, both random and periodic electing methods are preceded by checking the remaining power to skip the dead nodes and continue in the same way periodically with the rest of the nodes in the round. Additionally, the proposed protocol is distinguished by deleting dead nodes from the network topology list during the re-clustering process to address the black holes and routing delay problems. Finally, the proposed algorithm’s mathematical modeling and analysis are introduced. The experimental results reveal the proposed protocol outperforms the LEACH protocol by approximately 32% and the FBCFP protocol by 8%, in terms of power consumption and network lifetime. In terms of Mean Package Delay, LEDCHE-WSN improves the LEACH protocol by 42% and the FBCFP protocol by 15%, and regarding Loss Ratio, it improves the LEACH protocol by approximately 46% and FBCFP protocol by 25%.

ASRPH: Application Specific Routing Protocol for Health care

While proceeding towards the age of Internet of Things (IoT), Wireless Sensor Network (WSN) is going to play an indispensable role in the overall networking architecture. Applications like health care, smart-city etc. are extensively using WSN frameworks to collect and analyse real-time data along with taking necessary actions based on the application’s requirements. While designing the routing protocol for WSN, the uniqueness and requirements of the application have the potential to play a dominant role. Generalizing the networking framework while ignoring application-specific requirements would lead towards designing an inefficient routing protocol. Considering these scenarios, we have proposed an application-specific routing protocol for the health care which would ensure the increase in network lifetime while maintaining the maximum throughput in data transmission. The proposed routing protocol has shown an improved performance in terms of metrics like throughput, network lifetime, end to end delay, packet delivery ratio and packet loss while comparing with some of the traditional routing protocols e.g. Routing Protocol for Low-Power and Lossy Networks and Collection Tree Protocol.

Node Location Privacy Protection in Unattended Wireless Sensor Networks

Node location protection is critical to the wireless sensor networks (WSN), especially for unattended environment. However, due to most of the static deployment and the limitations in energy, storage, and communication capabilities of the sensors, WSNs are vulnerable to various location (and derivative) attacks. In this work, we study the node location privacy protection issue from both aspects of attacks and defenses. First, we present a new two-phase location attack for two important types of nodes (including base station and source node). It can locate a base station node within few amounts of local wireless transmission monitoring and then reversely trace the location of the source node. Different from existing methods, the proposed attack determines the node location based on the transmission direction, which can break through existing defenses. Then, to defend against such attacks, we design a pseudospiral-based routing protocol for WSN. We analyze the performance of parameters such as routing probability, maximum detectable angle, hop count, and number of loops based on PU SBRF, MoRF, and PLAUDIT methods. The theory analysis and confrontation experiment of attack and defense show that the proposed scheme can protect the location privacy of the target node with moderate communication and computation overhead.

Robust Clustering Routing Method for Wireless Sensor Networks Considering the Locust Search Scheme

Multiple applications of sensor devices in the form of a Wireless Sensor Network (WSN), such as those represented by the Internet of Things and monitoring dangerous geographical spaces, have attracted the attention by several scientific communities. Despite their interesting properties, sensors present an adverse characteristic: they manage very limited energy. Under such conditions, saving energy represents one of the most important concepts in designing effective protocols for WSNs. The objective of a protocol is to increase the network lifetime through the reduction of energy consumed by each sensor. In this paper, a robust clustering routing protocol for WSNs is introduced. The scheme uses the Locust Search (LS-II) method to determine the number of cluster heads and to identify the optimal cluster heads. Once the cluster heads are recognized, the other sensor elements are assigned to their nearest corresponding cluster head. Numerical simulations exhibit competitive results and demonstrate that the proposed protocol allows for the minimization of the energy consumption, extending the network lifetime in comparison with other popular clustering routing protocols.

EAGBRP: A Gateway Based Routing Protocol for Heterogeneous Wireless Sensor Networks

In most of the cluster-based routing protocols for wireless sensor networks (WSNs), cluster heads (CHs) are selected from the normal sensors which may expire rapidly due to fast energy diminution for such an additional workload. As a consequence, the network lifetime of such cluster-based routing protocol reduces drastically. To resolve these constraints, in this study, we proposed a gateway-based routing protocol-namely Energy-Aware Gateway Based Routing Protocol (EAGBRP) for WSNs. In our proposed protocol, the deployed sensor nodes of a WSN were divided into five logical regions based on their location in the sensing field. The base station (BS) was installed out of the sensing area, and two gateway nodes were inaugurated at two predefined regions of the sensing area. The CH in each region is independent of the other regions and selected based on a weighted election probability. We implemented our proposed routing protocol through simulations. To evaluate the performance of our EAGBRP, we simulated SEP, M-GEAR, and MGBEHA (4GW) protocols. The network lifetime, throughput, and residual energy parameters are utilized for performance analysis. It is revealed from the performance analysis results that WSNs with EAGBRP achieve maximum network lifetime and throughput over other considered protocols with minimum energy consumption.

Energy and Collision Aware WSN Routing Protocol for Sustainable and Intelligent IoT Applications

Wireless Sensor Network (WSN) has wide range of applications including next generation intelligent IoT applications. Sensor nodes in WSNs don’t allow replacing batteries as phenomenon under consideration is not frequently accessible or inaccessible. Resource constrained WSN nodes run on batteries with limited capacity. For long running of the WSNs, energy consumption on each node and lifetime of overall network is a concern for IoT applications. To prolong lifetime of WSNs, use of energy efficient method is necessary and a challenging task. Most of the on-demand routing protocols use metrics like number of hops for the selection of path from the source node to the destination node. Purely hop count-based metrics leads to frequent broken paths as well as more energy consumption and results into reduced lifetime of IoT applications. Method proposed in this paper is a cross layer variant of AODV by replacing hop count metric with link quality and collision count. To establish a path, proposed method fetches link quality information from Physical layer and collision information from MAC layer to aid Network layer for making intelligent routing decisions using ZScore method. Using this information, proposed routing metric caters to select stable and sustainable routing path. Method proposed in this paper is implemented in well-known network simulator, NS-2 by incorporating necessary changes into existing physical and MAC layers as well as AODV protocol. A comparative analysis with existing methods is an indicator of improved performance in terms of energy efficiency, network lifetime, path stability and delay.

Delay-Sensitive, Reliable, Energy-Efficient, Adaptive and Mobility-Aware (DREAM) Routing Protocol for WSNs

A majority of Wireless Sensor Network (WSN) research at present is focussed on the problems of limited energy supply and its impact on network lifetime. Nevertheless, the plethora of applications conceivable with the help of WSNs often demand for MOO (Multi-Objective Optimization) formulations, where several design goals contend together for the best trade-off solution among them. Therefore, research investigators must also regard other miscellaneous issues in addition to energy efficiency for applicability of WSNs in practical scenarios like Internet of Things. DREAM (Delay-sensitive, Reliable, Energy-Efficient, Adaptive and Mobility-Aware) routing protocol is proposed in the present work, that ameliorates network lifetime (in terms of First Node Death and Last Node Death), throughput (in terms of number of packets sent to Base Station) and latency (average end-to-end delay in seconds) in the network along with enhancing the reliability (in terms of percentage packet loss) of delivered data. The proposed protocol also integrates mobility and heterogeneity of the nodes to cater to the needs of an application-independent general purpose WSN routing protocol, which can be used commercially. Comparative analysis with existing protocols establishes the superiority of the proposed protocol, which is capable of improving the network lifetime by about 3.54% and simultaneously lowering the delay by 35.5%, along with the amelioration of other parameters.

A novel energy harvesting with middle-order weighted probability (EHMoWP) for performance improvement in wireless sensor network (WSN)

Wireless sensor network (WSN) has been a promising technology and widely involved in environmental monitoring. The limited energy supply associated with WSNs impacts the lifetime of the network and the energy constraints make it difficult for sensor nodes to harvest environmental energy. This drawback on the performance of WSN is improved through routing and clustering techniques for environmental energy harvesting and termed as harvesting wireless sensor network (EH-WSN). As a result of the unique characteristics of EH-WSN, the performance of typical clustering and routing protocols of WSN are ineffective in EH-WSN. A novel energy harvesting middle-order weighted probability (EHMoWP) is proposed in this paper for the static and dynamic operation of WSN nodes. The proposed EHMoWP approach is based on the integration of cluster head selection and routing, with the utilization of a distributed–centralized approach which cogitates the energy of nodes, harvested energy, clustering process, and neighbor nodes. Simulation outcomes showed that this proposed EHMoWP outperforms significantly the conventional techniques concerning residual energy and the number of alive and dead nodes. The proposed EHMoWP exhibits almost 10% higher residual energy with improved network lifetime which is measured in terms of alive node and dead node count. Based on the analysis of dead node and alive node estimation, it was observed that the number of alive nodes was 10% higher and the number of dead nodes was 10% fewer than in the conventional technique. This is because the proposed EHMoWP exhibits 2 dead nodes less and 2 alive nodes higher than the existing technique.