Energy efficient cluster based routing scheme for mobile Wireless Sensor Networks

Wide usage of wireless sensor network (WSN) is the reason for development of many routing protocols. Recent advances in WSN observe the increased interest in the potential use in applications like Military, Environmental, Health, Vehicular, Mechanical stress levels on attached objects, disaster management etc. Wireless sensor networks are callously restricted by storage capacity, energy and computing power. So it is essential to design an energy efficient aware protocol in order to augment the network lifetime. WSN also has the influencing features to perform remote communication, it is also shrouded with various loopholes in its precise operation, where majority of the communication issues are raised from deployment of existing standards of routing protocols and algorithm. Sensors are expected to be remotely deployed in unnoticed environments. Routing as one key technologies of wireless sensor network has now become very important research work because the applications of WSN is everywhere, it is impractical that there is a routing protocol suitable for all applications. In this paper, a review on routing protocol in WSNs is carried out which are classified as data-centric, hierarchical and location based depending on the network structure. Then some of the multipath routing protocols which are widely used in WSNs like Multipath Multispeed Protocol (MMSPEED), Braided Multipath Routing Protocol, Energy-Aware Routing to improve network performance are also discussed. Massive research work has already been carried out in past to introduce some of the effective routing protocols to enable robust communication system in WSN. Advantages and disadvantages of each routing algorithm are discussed thereafter. This paper also discusses the critical open issues that are yet to be solved. This paper compares and summarizes the performances of routing protocols.

The sensor nodes are independent and work as sender, receiver and intermediate node in Wireless Sensor Network (WSN). The sensor nodes are forming the small network in which the one or more sender is sending data to one destination/s through intermediate nodes or sending information to Base Station (BS). The information collect by base station is further analyzed. The nodes are also static or mobile depends on the situation or conditions. The connection establishment and data sending is possible through routing protocols of WSN. The routing protocols of WSN are not same as traditional wireless routing protocols. One major issue on this network is security. The routing protocols are sending information to destination from particular source and the routing strategy is provides the better way of delivery in the network. The sensor nodes in network are performing through limited battery supply called node energy or power. The attacker are also affected the limited energy resource. In this paper the center of consideration is on the security issues related to WSN routing protocols. The routing in WSN remains a key issue because of that without accurately functioning of routing protocols, the network cleanly will not work the technique it's intended to. Unfortunately, routing also one of the most difficult to protect against attacks malicious activities because of the administration in WSN. The better protection scheme is provides the complete security from attacks and the secure routing is provides the better and trustful network performance.

Wireless Sensor Networks (WSNs) are consist of very tiny nodes structure, with very small batteries without having facility to recharge it. It works under any hard circumstances, hence this type of network is gaining high importance day by day. Maximum focus of researchers is to enhance or optimized its energy efficiency level. Routing protocol is the main energy expensive operation of sensor networks which utilize maximum energy resources of sensor network. Already a good number of routing protocols has been designed for energy efficiency or optimization with different approaches under controlled conditions. With this research we try to propose energy optimization of wireless sensor network through our proposed position response routing protocol (PRRP), under certain controlled parametric consideration. Research results shows a significant energy optimization in the life cycle of WSN. Index Terms—WSN, energy efficient, WSN routing protocol, GPS, PRRP, energy optimization

The lifetime of Wireless Sensor Network (WSN) is based on the energy of each sensor. Therefore, numerous routing protocols have been introduced such as SEP (Stable Election Protocol), LEACH (Low energy adaptive clustering hierarchy) and EAMMH (Energy Aware Multi-hop Multi-path Hierarchical routing protocol) to stable the lifetime of WSN by efficient utilization of energy of the sensors. In WSN networks data is collected and forwarded wirelessly to the base stations. Routing protocols in WSN provide an efficient path for multi-hop communication because the transmission range and battery power storage of nodes is limited. As nodes are usually deployed in remote areas so, they face challenges of long lifetime, network architecture, security issues, and network coverage. Many routing protocols have been developed to increase the efficiency of networks. Out of these clustering algorithms are the best choice to increase the lifetime of the nodes. Each protocol has its limitations in different scenarios. In this paper, we discussed and compared the performance of LEACH, EAMMH and SEP. SEP is an efficient algorithm due to its weighted cluster head (CH) selection method. Simulation results are obtained using MATLAB. Design metrics of energy consumption and network lifetime are under consideration in this research work.

The existing routing protocols for wireless sensor networks were not reasonable in design, which limited their application. Most of the existing studies did not take into account the energy consumption of the network and the balanced use of the energy of sensor nodes, which led to the unsatisfactory application effect of wireless sensor networks in some fields. Therefore, from the perspective of energy balance in wireless sensor networks, this paper proposed a construction method of an energy balance routing protocol in wireless sensor networks based on a fuzzy control strategy. Firstly, based on the analysis of the basic composition of wireless sensor networks and the structure of sensor nodes, this paper expounded the basic process of wireless data transmission and summarized the classification and characteristics of routing protocols in wireless sensor networks from different angles. Secondly, according to the node data transmission characteristics of wireless sensor networks, the energy balance use model of sensor nodes was established, and the design method of the energy balance routing protocol based on fuzzy control strategy was proposed, and the data transmission link was optimized. Finally, through experimental comparative analysis, the results showed that the energy balanced routing protocol proposed in this paper can effectively realize the energy balanced use of the network data transmission process. Compared with other common routing protocols, the wireless sensor network routing protocol proposed in this paper can not only improve the data transmission efficiency and reduce the data redundancy but also save energy consumption and prolong the network running time. The design method of routing protocol proposed in this paper will be conducive to the optimization and application of routing protocol in wireless sensor networks and provide a theoretical basis for the related research of wireless sensor networks.

Wireless sensor network (WSN) seeks an unequal clustering approach to solve its energy hole and HOTSPOT issue. Increasing the cluster number and decreasing the size of the cluster near the sink equally distribute the load across the network. The approach is to made buffer aware to enhance the network lifetime and avoid data packet drop due to buffer overflow. The increase in buffer size is always not possible in preconfigured sensor nodes, making lifetime and data loss as a major problem. An energy-aware buffer management (EABM) routing protocol is designed to overcome the issue. The memory vacancy and energy level are considered before routing the next hop data to the cluster. The proposed EABM routing protocol is compared with LEACH, LEACH-C, ALEACH and EAR routing protocols to support our claim. The proposed routing protocol provides higher lifetime of 1.17 rounds, 1.1 times throughput and 0.73 times reduced packet drop considering LEACH as a benchmark protocol. The energy and buffer filling near the sink are equally distributed in case of the proposed EABM routing protocol.

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Wireless Sensor Network (WSN) is a promising approach for a variety of applications. Because of limitation of energy resource, memory space and processing capability of sensor nodes, it is very difficult to implement IP-based routing protocols in WSN. Recently, many research focus on developing special routing protocols for WSNs with the main design criteria: energy efficiency, load balance and reliability. The most well known routing protocol class is hierarchical which divides network into many clusters. Each cluster is represented by a cluster head (CH) that is responsible for receiving data from all non-CH members, aggregating these data and sending to the base station (BS). In order to balance energy consumption of the entire network, CHs are not fixed but rotated. Therefore, the hierarchical protocols can decrease and balance the energy consumption and prolong network lifetime. LEACH is one of the first cluster-based for WSN, which includes distributed cluster formation. In this paper, we propose a new hierarchical routing protocol (called EL-LEACH: Energy and Load balance LEACH) which achieves energy efficiency and load balance. Our simulation result shows that our new scheme EL-LEACH achieves better energy consumption, load balance and network life time than other well known LEACH protocols.

Designing and development of energy effective path planning algorithm is very key research domain in order to tackle the issues of limited life-time for Wireless Sensor Networks (WSNs). So in WSNs, energy efficiency is major concern of researchers. Overall advancement in routing protocols prove that clustering is much better approach as compared to flat and location-based energy efficient routing protocols. Due to better performance, multiple energy efficient clustering routing protocols have been proposed. But existing clustering algorithms are centralized or distributed, which are not intelligent enough and do not produce hybrid cluster-head selection. In this paper, we propose a cluster structured path planning algorithm named, Hybrid Advance Distributed Centralized Clustering (HADCC) path planning energy efficient algorithm. HADCC proposed model is fascinated with hybrid cluster head selection algorithm. This hybrid algorithm makes decision of cluster head selection of nodes. In order to execute proposed model we have also proposed an advance network topology, in which the whole network region is divided into two physical levels. First physical level consists of a circular region, containing homogeneous normal nodes and all important Base Station. While, second physical level is outer region of the circle that contains advanced heterogeneous nodes. Simulation results indicate that HADCC prolongs the network lifetime as compared to existing advanced clustering routing protocols for both homogeneous and heterogeneous WSNs. HADCC outperforms in case of stability and network life time as compared to the existing clustering algorithms.

The selection of routing protocols is playing a major role in the device and proper utilization of wireless sensor networks (WSNs) that can help to provide better interconnection networks. On preserving the role of key performance, metric related to routing protocols is also an important and challenging task in the WSNs. Therefore, the sensor nodes life can be improved in efficient manner by using routing protocols that preserve the energy consumption and quality of service (QoS). Three different kinds of categories are used in the design of routing protocols which are data centric, hierarchical, and location-based approaches. Energy consumption can be improved by reducing the effect of redundancy level and transferring the passive motes sleep mode. The data transmission time also impacts on the energy conservation and QoS in WSNs. The surveillance and monitoring-related applications are the demanding research field in the WSNs that has to resolve the issue QoS routing in the manner of reliable data delivery. Energy consumption and QoS constraints are two complementary factors in the routing protocol, but the time delay factor can be involved in such a manner to satisfy both the performance metrics in routing protocol in WSNs.

One of the most rapidly expanding areas, nowadays, in networking systems is the Wireless Sensor Network (WSN). Typically WSNs rely on multi-hop routing protocols which must be able to establish communication among nodes and guarantee packet deliveries. In this paper, we present a novel approach for the implementation of the WSN routing protocols, which takes advantage of modern FPGAs in order to provide faster routing decisions while consuming significantly less energy than existing systems. Despite our focus on a particular routing protocol (GPSR), the platform developed has the additional advantage that due to the reconfigurability feature of the FPGA it can efficiently execute different routing protocols based on the requirements of the different WSN applications. As our real world experiments demonstrate, we accelerated the execution of the most widely used WSN routing protocol (GPSR) by at least 31 times when compared to the speed achieved when the exact same protocol is executed on a low power Intel Atom processor. More importantly by utilizing a high-end FPGA the overall energy consumption was reduced by more than 90%.

Wireless Sensor Networks (WSNs) are fundamental to security and surveillance applications such as military defense, disaster management, and intrusion monitoring. The performance of these networks depends largely on the efficiency of routing protocols. This paper examines the Ad hoc On-Demand Distance Vector (AODV) routing protocol in multi-hop WSN environments for target tracking, evaluating critical metrics including Packet Delivery Ratio (PDR), End-to-End Delay, Energy Consumption, and Network Lifetime. Simulation results illustrate the impact of node depletion due to transmission loss, affecting network stability and robustness in target detection. In-network detection in WSNs presents trade-offs between real-time data transmission, energy efficiency, and trajectory lifespan. Inefficient routing optimization may result in increased latency, packet loss, and premature node failure, ultimately reducing localization accuracy. While AODV’s reactive path-based approach offers manageable overhead, its performance degrades under increased energy consumption and route rediscovery delays. This study systematically evaluates AODV’s strengths and limitations in time-sensitive detection scenarios. Findings indicate that AODV ensures reliable data transmission in early network stages but suffers significant performance deterioration as node energy declines, impacting coverage and responsiveness. To enhance AODV’s target tracking capabilities, this paper proposes adaptive energy-saving techniques and hybrid routing schemes. These strategies contribute to ongoing research aimed at optimizing routing protocols to balance accuracy and node longevity for real-time WSN applications.

Due to open network nature of wireless sensor networks make them highly vulnerable to a variety of security attacks and easy target for adversaries, which may capture these nodes, analyze and easily insert fake route information. Wireless sensor network is an emerging, cost effective and unsupervised solution for collecting this information from the physical world and sending this information back to centralized authority for further processing. GRPW (Geographic Routing in connected wireless sensor networks based on Multiple Sinks) is one of the basic routing protocols used for Supporting Mobile Sinks in Wireless Sensor Networks. GRPW, a geographical routing protocol for wireless sensor networks, is based on an architecture partitioned by logical levels, on the other hand based on a multipoint relaying flooding technique to reduce the number of topology broadcast. GRPW-MuS uses periodic HELLO packets to neighbor detection. The wormhole attack can form a serious threat in wireless sensor networks, especially against many wireless sensor networks routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in GRPW is provided called GRPW-MuS-s. Using OMNET++ simulation and the MiXiM framework, results show that GRPW-MuS-s protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than GRPW). The average energy usage at each node for GRPW-MuS-s protocol during the neighbor discovery and route discovery is very low than GRPW-MuS, which is much lower than the available energy at each node. The cost analysis shows that GRPW-MuS-s protocol only needs small memory usage at each node, which is suitable for the sensor network.

Network lifetime is one of the most crucial factors that affect the performance of a Wireless Sensor Network (WSN). In order to maximize the network lifetime, it is essential that a routing protocol is designed from the purpose of energy efficiency. One way through which energy efficiency can be achieved in a protocol is by evenly distributing load among all the nodes in the network. This paper introduces Robust Formally Analysed Protocol for Wireless Sensor Networks Deployment with Load Balancing (RAEED-LB). This protocol takes the decision of selecting the next node on the basis of load balancing. The performance of RAEED-LB and RAEED is compared through formal verification. The formal verification results show that RAEED-LB achieves network lifetime gain in the range of 10% to 35% over RAEED.

In recent years, Wireless device networks have achieved associate degree attention on a world level. This comprises small sensors with restricted power and restricted resources. The applicability of wireless sensor networks (WSNs) in various fields such as medical research and civilian applications is proliferating enormously. Every routing protocol designed for WSNs should be energy-efficient, reliable and prolong the network lifetime. Due to the resources and energy constraints in WSNs, routing can be considered as a matter of contention in networks. This research proposes a beacon-enabled least-time and energy-efficient routing protocol with single-level data-aggregation using an IEEE 802.15.4. Considering the low complexness and low power consumption it is appropriate for low-rate wireless personal area networks as WSNs. On comparison of the proposed protocol with the popular ad hoc and other WSN routing protocols, the results show that the proposed protocol outperforms the routing protocols in the literature in terms of latency, throughput, and average energy consumption.