Energy efficient collaborative proactive routing protocol for Wireless Sensor Network

Introduction: This article is the result of the research “Energy efficient routing protocols in wireless sensor network: Examine the impact of M-SEEC routing protocols on the lifetime of WSN with an energy efficient TABU optimization routing protocol”developed in the IKG, Punjab Technical University, India in 2019.Problem: The task of finding and maintaining routes in WSNs is non-trivialsince energy restrictions and sudden changes in node status cause frequent and unpredictable changes.Objective: The objective of this paper is to propose an energy efficient heterogeneous protocolwith the help of a hybrid meta-heuristic technique.Methodology: In the hybrid meta-heuristic technique, the shortest route has been selected and the data forwarded to the sink in a minimal time span,savingenergy and making the network more stable. To evaluate the technique, a new hybrid technique has been created where the data transmission is implemented from the beginning under MATLAB 2013a.Results: The proposed technique is better than the existing ones since the remaining energy in the network is increased by 62% compared to normal nodes in MSEEC, 65% compared to advanced nodes in MSEEC and 70% compared to super nodes in MSEEC. The network lifetime was also enhanced by 70.8% compared to MSEEC.Conclusion: The proposed protocol was found to be superior based on the average residual energy.This paper proposes an efficient routing mechanism towards the energy efficient network.Originality: Through this research, a novel version of MSEEC protocol is carried out using the TABU search mechanism to generate the functions of two neighbourhoods to detect the optimum path with the aim of maximizing the network lifetime in an area of 200×200m2.Limitations: The lack of other routing techniques falls under swarm intelligence.

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.

Due to miniaturization of hardware and availability of low-cost, low-power sensors, Wireless Sensor Network and Multimedia Sensor Network applications are increasing day by day. Each application has a specific quality of service and experience requirements. The design of routing and MAC protocol which can fulfill the requirements of the application is challenging given the constrained nature of these devices. Considerable efforts are directed towards the design of energy efficient QoS-aware routing protocols. In this article, we present state of the art review of routing protocols for Wireless Multimedia Sensor Networks while addressing the challenges and providing insight into research issues.

QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks

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.

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.

Nowadays advanced technology of Wireless Sensor Networks used in many applications like health, environment, battle field etc. The sensor nodes equipped with limited power sources. Therefore, efficiently utilizing sensor nodes energy can maintain a prolonged network lifetime . One of the major issues in sensor networks is developing an energy-efficient routing protocol to improve the lifetime of the networks. In this paper, we propose EELBCRP (Energy-Efficient Level Based Clustering Routing Protocol), a protocol for wireless sensor networks. Network partitioned into annular rings by using various power levels at base station and each ring having various sensor nodes. Also consider the residual energy of each node and distance from the BS of nodes as the principle of cluster-head election. The mathematical formulae for election the cluster head is provided. The model developed is simulated in MATLAB. The results are obtained in terms of three metrics- lifetime of the network, number of clusters and energy consumption of clusters heads. From the results of simulation, it is observed that the performance of EELBCRP is better in terms of energy consumption of CH, number of clusters and lifetime of network compared with LEACH.

Wireless sensor networks contains small sensor node and processor which have several issues and challenges with regards to Limited Computational Capacity, Energy Efficiency, Path Planning Overhead and many more. Entire lifetime of network depends on efficient energy consumption in sensor network so it is a challenging task to design an Energy Efficient Routing Protocol for wireless sensor networks. Wireless sensor nodes dynamically self-organize themselves without utilizing preexisting infrastructure. Problem becomes more complex if some sensor node having mobility for some particular instance. In this paper we proposed an energy efficient routing protocol for WSN motivated by swarm intelligence of rummage behavior of ant and also covered mobility behavior of node. Furthermore we have combined the fuzzy logic with behavior of ant to take a better decision to find optimal path with less energy consumption. Our proposed algorithm utilize the principle of Fuzzy logic in addition of Ant Colony Optimization to develop energy efficient routing. The performance of our proposed work is evaluated on QualNet 7.4 Network Simulator. The simulation result shows that the proposed technique optimize the energy consumption, decrease RREQ packet and increase the lifetime of network as compare to existing routing protocol.

—Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

Introduction: Routing protocols in Wireless Sensor Networks (WSN) are of major concern because of the important factors like energy efficiency and reliability. Opportunistic Routing (OR) is the simplest and reliable routing technique for ad-hoc networks and WSN. The OR protocol guarantees data delivery in the network. As WSN need energy-efficient routing, therefore, energy- efficient OR protocols gained popularity in the last three years. Objectives: Opportunistic routing improves the performance of the network by utilizing the broadcasting abilities of wireless channels. In this paper, a new energy-efficient and reliable routing protocol has been proposed that is based on the opportunistic routing technique. Methods: The proposed protocol is based on the energy-efficient routing metric. The proposed OR protocol prioritizes among the candidate forwarders on the basis of energy-efficient routing metric and this will lead to the achievement of improved network lifetime. Results: The end-to-end delay is reduced because of the selection of candidate forwarders from the neighbor list of each node. The proposed protocol uses selective acknowledgment mechanisms. The simulation results of the proposed protocol depict the improved performance as compared to other recent OR protocols. Conclusion: The proposed protocol can directly be used with existing WSN applications. Further improvements can be made by utilizing more parameters like distance and the quality of transmission.

Advanced technology of Wireless Sensor Networks used in many applications like health, environment, battle field etc. The sensor nodes equipped with limited power sources. Therefore, efficiently utilizing sensor nodes energy can maintain a prolonged network lifetime. One of the major issues in sensor networks is developing an energy-efficient routing protocol to improve the lifetime of the networks. In this paper, we propose EEHCRP (Energy-Efficient Hierarchical Clustering Routing Protocol), a protocol for wireless sensor networks. Network partitioned into annular rings by using various power levels at base station and each ring having various sensor nodes. The mathematical formulae for choosing the cluster head are provided. The model developed is simulated in MATLAB. The results are obtained in terms of three metrics, lifetime of the network, and number of clusters and energy consumption of clusters heads. From the results of simulation, it is observed that the performance of EEHCRP is better in terms of energy consumption of CH, number of clusters and lifetime of network compared with LEACH.KeywordsWireless Sensor NetworkEnergy EfficiencyNetwork LifetimeClusteringLEACH protocol

Wireless Sensor Networks (WSNs) have led to tremendous growth in the development of sensor technology and offer numerous applications, such as wildlife monitoring, environment, healthcare, military surveillance and security systems. In terms of performance, the evolutions of WSN routing protocols play a vital role in extending the lifetime of networking operations. Due to the limited resources of power in sensor nodes, the design and implementation of an energy-efficient routing protocol comprise a key challenge for researchers. Before, in the case of a static sink, nodes at farther areas from the sink transmit their sensed data at a longer transmission range and die early, while nearby nodes face lesser transmission costs and stay alive for a longer period. This unbalanced energy distribution creates energy holes in ares far from the sink in WSNs. Mobility-based sink routing protocols are proposed to minimize the sub-optimal energy consumption in WSNs, as the sink mobility covers the sensor field, which alleviates the overall load-balancing among sensor nodes. In order to overcome the energy hole issue while prolonging the network lifetime, it is important to determine the optimal mobility pattern. In this regard, we propose the Spiral Mobility based on Optimized Clustering (SMOC) routing protocol and the Multiple sink-based SMOC (M-SMOC) routing protocol for large-scale WSNs. Performance evaluations of the proposed protocols are compared with various existing routing protocols based on static sink, random mobility and grid mobility. Different numbers of performance parameters are considered for evaluation, such as network lifetime, network stability, packet drop ratio, packet delivery ratio, end-to-end delay, average energy consumption, network connection time and the impact of different heterogeneity levels. Experimental results show the benefits of the spiral mobility pattern and how it improves the network lifetime and stability period over the existing state-of-the-art routing protocols.

Wireless Sensor Networks (WSNs) are designed by hundreds or thousands of tiny, low cost and multifunctional sensor nodes. Each sensor node has very low battery life. Sensor nodes have finite storage capabilities, transmission and processing range and energy resources are also limited. There are many design issues in WSNs such as mobility, energy consumption, network topology, data aggregation, localization, production cost, security, network size and density etc. Routing protocols provide efficient working of the network, increase network lifetime, responsible for maintaining the routes in the network and perform reliable multi-hop communication under various conditions. LEACH (Low Energy Adaptive Clustering Protocol) is one of the hierarchical protocol in WSNs. LEACH uses TDMA MAC Protocol. During random data distribution, a number of TDMA slots are wasted. Because sensor nodes don't know either they have data to send or not, they continuously listen to the medium and this result in idle listening problem. This paper proposed OE-LEACH (An Optimized Energy Efficient LEACH Algorithm for WSNs) to enhance the performance of the LEACH Protocol, reduce time delay and energy consumption. Network Lifetime and throughput of WSN also increases. The Proposed method is simulated in MATLAB 2010a.

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.

Among important issues in the current energy-efficient routing protocols for wireless sensor networks (WSNs) based on clustering approaches are how to determine the optimal number of clusters, how to generate clusters and how select cluster-heads to improve WSNs performance. These approaches aim to reduce energy consumption of the WSN nodes and to extend the network lifetime. This paper reviews and compares the performance of three clustering techniques for determining number of clusters: rule of thumb, elbow, and silhouette. Each of these techniques involves a distributed K-means approach to generate clusters. Moreover, we compare these three clustering methods with low energy adaptive clustering hierarchy (LEACH), Imp LEACH and MODLEACH in terms of network lifetime, energy consumption and the number of packets sent to the base station (BS). The results obtained indicate that rule of thumb method provides better performance compared to other clustering techniques in terms of energy consumption and network lifetime.