Energy Aware Clustering Protocol (EACP) For Heterogeneous WSN

We present geometric broadcast for sensor and actor networks (GBSA), a novel broadcasting protocol for heterogeneous wireless sensor and actor networks. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. GBSA is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. GBSA does not need any neighborhood information and imposes very low communication overhead. GBSA is scalable to the change in network size, node type, node density and topology. GBSA accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed GBSA takes advantage of actor nodes, and uses their resources when possible, thus reducing the energy consumption by sensor nodes. Through simulation evaluations, we show that GBSA is very scalable and its performance is improved by the presence of actors. At best of our knowledge, GBSA is the first broadcast protocol designed specifically for heterogeneous sensor and actor networks.

Wireless sensor networks(WSN) are a kind of communication networks with in-dependent sensor nodes which could construct multi-hop ad hoc network to trans-fer data. The transport protocols for Wireless Sensor Network play an important role to promote the performance of the whole systems. This paper proposes a modified transport layer protocol for heterogeneous Wireless Sensor Networks(HWSN). As TCP is not suitable to use in HWSN directly, we design a modified transport protocol(named mTCP) based on TCP by a six-state finite state machine. Experimental results illustrate that our design can improve the communication capability of the transmission layer in heterogeneous wireless sensor networks significantly.

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.

Classical clustering protocols in wireless sensor networks (WSNs) assume that all nodes are equipped with the same amount of energy. As a result, they cannot take full advantage of the presence of node heterogeneity. In this study, a stable and energy‐efficient clustering (SEEC) protocol for heterogeneous WSNs is proposed. In addition, the extension to multi‐level of SEEC is presented. It depends on the network structure that is divided into clusters. Each cluster has a powerful advanced node and some normal nodes deployed randomly in this cluster. In the multi‐level architectures, more powerful supper nodes are assigned to cover distant sensing areas. Each type of nodes has its role in the sensing, aggregation or transmission to the base station. At each level of heterogeneity, the optimum number of powerful nodes that achieves the minimum energy consumption of the network is obtained. The proposed protocol is a heterogeneous awareness to prolong the stability period, which is crucial for many applications. The performance of the proposed protocol is compared by existing homogeneous and heterogeneous protocols. Simulation results show that the proposed protocol provides a longer stability period, more energy efficiency and higher average throughput than the existing protocols.

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.

QoSNET: An integrated QoS network for routing protocols in large scale 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.

Wireless sensor networks are a new emerging area where swarm intelligence can be applied with interesting implications. In fact, a strong analogy between unicellular organism colonies and wireless sensor networks can be emphasized: a sensor network can be viewed as a “colony” of simple, scarce resource nodes that, autonomously, are able only to perform simple tasks, but all together can accomplish very complex problems. In this paper we propose a routing protocol for multisink Wireless Sensor Networks with interesting properties: self organization, fault tolerance and environmental adaptation. The proposed protocol was inspired by the well known behavior (in artificial life studies) of “Slime Mold”. Such colony of unicellular organisms organizes itself in clusters by pheromone generation and evaporation mechanisms. In a similar manner our protocol manages the data traffic towards multiple sink nodes using the gradient concept and reaching high levels of autonomy and fault tolerance. We analyze the proposed protocol to examine the performances, the signalling overhead and the adaptation properties to environmental changes or nodes faults using simulation techniques.

Nowadays Wireless Sensor Networks WSNs are playing a vital role in several application areas ranging health to battle field. Wireless sensor networks are easy to deploy due to its unique characteristics of size and self-organizing networks. Wireless sensor nodes contain small unchangeable and not chargeable batteries. It is a resource constraint type network. Routing in WSN is most expensive task as it utilizes more power resources. This paper is intended to introduce energy efficient routing protocol, known as Position Responsive Routing Protocol (PRRP) to enhance energy efficiency of WSN. Position responsive routing protocol differs in several ways than other existing routing techniques. Position response routing protocol approach allows fair distribution of gateway\cluster head selection, maximum possible distance minimization among nodes and gateways\cluster heads to utilize less energy. Position responsive routing protocol shows significant improvement of 45% in energy efficiency of wireless sensor network life time as a whole by increasing battery life of individual nodes. Furthermore PRRP shows drastic increases for data throughput and provide better solution to routing energy hole due to it fair distributed approach of gateway selection. This work is the extension of Energy efficient routing protocol for wireless sensor network published in IEEE ICACT 2014.

An energy-balancing, cross-layer data gathering protocol (EB-CLDG) for wireless sensor networks (WSNs) is presented in this paper. EB-CLDG is proposed for monitoring and periodic reporting applications and the network is organized into concentric tiers around the sink. An energy-balancing clustering algorithm is employed to mitigate the “hot spot” problem. Thus the number of clusters closer to the sink node is bigger than those farther away from sink node, the inner cluster heads(CHs) can reduce the energy consumption within a cluster and preserve more energy for inter-cluster data relaying. In addition to, the MAC and routing of networks are integrated to minimize the protocol overhead. The scheme of synchronization within a cluster can not only synchronize sleep schedule to ensure data deliveries among neighbor nodes but also avoid energy waste for following and maintaining unnecessary schedules. And the scheme of invitation is employed to make collision-free within a cluster, which can reduce the density of contending nodes and the collisions of traffic being probably temporal correlation. Simulation results show that EB-CLDG leads to more uniform energy dissipation and prolongs the lifetime of network than S-MAC.

LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.

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.

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.

Due to the limitation of energy resources, energy efficiency is a key issue in wireless sensor networks (WSNs). Clustering is proved to be an important way to realize hierarchical topology control, which can improve the scalability and prolong the lifetime of wireless sensor networks. In this paper, an energy-driven unequal clustering protocol (EDUC) for heterogeneous wireless sensor networks is proposed. EDUC includes an unequal clustering algorithm and an energy-driven adaptive cluster head rotation method. The unequal size of clusters can balance the energy consumption among clusters, and the energy-driven cluster head rotation method can achieve the balance of energy consumption among nodes within a cluster, which reduces the waste of energy. Simulation experiments show that EDUC balances the energy consumption well among the cluster heads and prolongs the network lifetime.

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