An energy-efficient unequal clustering routing protocol for wireless sensor networks

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.

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.

FAMACROW: Fuzzy and ant colony optimization based combined mac, routing, and unequal clustering cross-layer protocol for wireless sensor networks

SummaryEnergy conservation and fault tolerance are two critical issues in the deployment of wireless sensor networks (WSNs). Many cluster‐based fault‐tolerant routing protocols have been proposed for energy conservation and network lifetime maximization in WSNs. However, these protocols suffer from high frequency of re‐clustering as well as extra energy consumption to tolerate failures and consider only some very normal parameters to form clusters without any verification of the energy sufficiency for data routing. Therefore, this paper proposes a cluster‐based fault‐tolerant routing protocol referred as CFTR. This protocol allows higher energy nodes to become Cluster Heads (CHs) and operate multiple rounds to diminish the frequency of re‐clustering. Additionally, for the sake to get better energy efficiency and balancing, we introduce a cost function that considers during cluster formation energy cost from sensor node to CH, energy cost from CH to sink, and another significant parameter, namely, number of cluster members in previous round. Further, the proposed CFTR takes care of nodes, which have no CH in their communication range. Also, it introduces a routing algorithm in which the decision of next hop CH selection is based on a cost function conceived to select routes with sufficient energy for data transfer and distribute uniformly the overall data‐relaying load among the CHs. As well, a low‐overhead algorithm to tolerate the sudden failure of CHs is proposed. We perform extensive simulations on CFTR and compare their results with those of two recent existing protocols to demonstrate its superiority in terms of different metrics.

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

HEER – A delay-aware and energy-efficient routing protocol for wireless sensor networks

In wireless sensor networks, prolonging the life time is an important research topic. Based on the study of LEACH protocol and EEUC protocol, a novel zone-divided and energy-balanced clustering routing protocol for wireless sensor networks (ZECR) is brought up. The protocol divides the area into several zones according to the distance, and uses the unequal clustering method among these zones to solve the hot spots problem caused by multi-hop mechanism. In the cluster head election phase, only the nodes that meet the energy standard can participate in the competition; in the inter-cluster multi-hop routing phase, the cluster heads with high residual energy in high energy region will be selected as the relay node based on the advantages of zone-divided. Simulation results show that the protocol can effectively balance the energy consumption of each part of the network, solve the hot spots problem, apply to the energy heterogeneous network and prolong the network life time obviously.

Throughout the use of the small battery-operated sensor nodes encourage us to develop an energy-efficient routing protocol for wireless sensor networks (WSNs). The development of an energy-efficient routing protocol is a mainly adopted technique to enhance the lifetime of WSN. Many routing protocols are available, but the issue is still alive. Clustering is one of the most important techniques in the existing routing protocols. In the clustering-based model, the important thing is the selection of the cluster heads. In this paper, we have proposed a scheme that uses the bubble sort algorithm for cluster head selection by considering the remaining energy and the distance of the nodes in each cluster. Initially, the bubble sort algorithm chose the two nodes with the maximum remaining energy in the cluster and chose a cluster head with a small distance. The proposed scheme performs hierarchal routing and direct routing with some energy thresholds. The simulation will be performed in MATLAB to justify its performance and results and compared with the ECHERP model to justify its performance. Moreover, the simulations will be performed in two scenarios, gateway-based and without gateway to achieve more energy-efficient results.

Aimed at the problem of unbalanced energy consumption of cluster heads caused by inter-cluster communications in wireless sensor networks clustering routing protocols, a novel algorithm named cluster head load balanced clustering (CHLBC) is presented. Based on uneven distributed cluster heads, CHLBC builds backbone network's inter-cluster transit route which is composed of cluster heads and calculates relay traffic of cluster heads. Sensors take the cluster head's relay traffic into consideration in the process of choosing the best cluster head and realize load balance of cluster heads. Simulation results show that the routing protocol effectively balances the load among cluster heads and achieves an obvious improvement on the network lifetime.

Wireless Sensor Networks (WSNs) play a necessary position in todays actual world applications. WSNs are a team of autonomous sensor nodes that are geographically distributed to accumulate information and monitor events. WSNs are similarly sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor information can be transported via wireless. Sometimes called dust network, minute sensors as small as dust referring to smart dust. WSNs are spatially distributed two to screen or bodily temperature, sound, pressure, etc. and to cooperatively ignore their data via the network to different locations. Each such sensor network node has typically various parts. Routing in WSNs in one of the important technique, because all node executes its battery power, if may be one node failure it collapse entire networks. Routing in WSNs is in reality difficult due to the intrinsic characteristics that differentiate these networks from different networks. The plan of routing protocols in WSN is affected via number of exigent factors. In this paper, a review on routing protocols for Wireless Sensor Networks (WSNs) and performance of its execution.

A genetic algorithm based distance-aware routing protocol for wireless sensor networks

Energy is one of the most important factors in the design of routing protocols in wireless sensor networks. This paper first analyzes the energy consumption in typical clustering protocols and finds that the consumption is not evenly distributed among nodes. Thus some nodes die quickly with the reduction of the network lifetime. Then a new energy-balanced strategy is introduced in clustering protocols. The strategy assigns the head communication load to base station by detecting the energy consumption in the cluster heads. The evenly distributed energy among the nodes is realized by controlling the head consumption. Simulation results show that the lifetime of the network is significantly prolonged with the new energy-balanced strategy.

One of the most important topics in the field of wireless sensor networks is the development of approaches to improve network lifetime. In this paper, an energy-efficient control and routing protocol for wireless sensor networks is presented. This algorithm is based on reinforcement learning for energy management in the network. This protocol seeks to optimize routing policies to maximize the long-term reward received by each node, using reinforcement learning, which is a machine learning approach. In order to improve the lifetime of wireless sensor network, three energy management approaches have been proposed. The first approach is to navigate correctly using reinforcement learning to reduce the length of the routes and to improve energy consumption. The second approach is to exploit a sleep scheduling technique to improve node energy consumption. The last approach is used to restrict data transmission of each node based on the received data change rate. Simulation results show that in terms of network lifespan, the proposed method significantly outperforms previous reported methods.

Increasingly, the services operations which perform data sensing and data propagation in a dynamic environment are important tasks of wireless sensor networks. Therefore, increasing the network lifetime is the main contribution of this investigation. We propose a novel power-aware chessboard-based adaptive routing (PCAR) protocol to support immobility management in wireless sensor networks. The paramount design challenge in this work is to scale-down the network energy consumption, thus maximizing the network lifetime. Our PCAR protocol utilizes vector-oriented propagation, power-consideration decision, and multi-path routing protocols to guide the propagating data to its destination. Moreover, the properties of the clusters are combined in the PCAR to form the cluster-plates in a chessboard-based clustered sensor network. The alternate usage of cluster-head nodes and sleep nodes increases energy efficiency. The opportune divide-and-conquer multi-path fusion mechanism slows down and balances energy consumption. Finally, a performance analysis shows that energy efficiency is achieved by the PCAR protocol.

Wireless sensor network (WSN) consists of thousands of sensor nodes with low power, low memory, and low computational capabilities. Therefore, energy issues have to be taken into considerations while designing WSN applications and protocols. Routing protocols such as LEACH and LEACH-C have been proposed for energy conservation in WSN. However, these typical protocols have drawback of unequal energy depletion in cluster heads (CHs) due to the different transmission distance from each CH to the base station (BS). In order to minimize the energy consumption caused by large distance of CHs from the BS, we propose dynamic clustering and distance aware routing protocol (DDAR) for WSN which takes into account of node distance for selecting CH, dynamic approach of selecting the CH nodes, and two level hierarchy of clustering with super cluster head (SCH) node near to the BS. Simulation results show that the proposed DDAR protocol consumes about 15.5% less energy than conventional LEACH protocol.