Improved Load-Balanced Clustering for Energy-Aware Routing(ILBC-EAR)in WSNs

Sensors are considered as important elements of electronic devices.In many applications and service,Wireless Sensor Networks(WSNs)are involved in significant data sharing that are delivered to the sink node in energy efficient man-ner using multi-hop communications.But,the major challenge in WSN is the nodes are having limited battery resources,it is important to monitor the consumption rate of energy is very much needed.However,reducing energy con-sumption can increase the network lifetime in effective manner.For that,clustering methods are widely used for optimizing the rate of energy consumption among the sensor nodes.In that concern,this paper involves in deriving a novel model called Improved Load-Balanced Clustering for Energy-Aware Routing(ILBC-EAR),which mainly concentrates on optimal energy utilization with load-balanced process among cluster heads and member nodes.For providing equal rate of energy consumption among nodes,the dimensions of framed clusters are measured.Moreover,the model develops a Finest Routing Scheme based on Load-Balanced Clustering to transmit the sensed information to the sink or base station.The evaluation results depict that the derived energy aware model attains higher rate of life time than other works and also achieves balanced energy rate among head node.Additionally,the model also provides higher throughput and minimal delay in delivering data packets.

A load-balanced minimum energy routing algorithm for Wireless Ad Hoc Sensor Networks

Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. To maximize the network lifetime, it is essential to prolong each individual node’s lifetime through minimizing the transmission energy consumption, so that many minimum energy routing schemes for traditional mobile ad hoc network have been developed for this reason. This paper presents a novel minimum energy routing algorithm named Load-Balanced Minimum Energy Routing (LBMER) for WSNs considering both sensor nodes’ energy consumption status and the sensor nodes’ hierarchical congestion levels, which uses mixture of energy balance and traffic balance to solve the problem of “hot spots” of WSNs and avoid the situation of “hot spots” sensor nodes using their energy at much higher rate and die much faster than the other nodes. The path router established by LBMER will not be very congested and the traffic will be distributed evenly in the WSNs. Simulation results verified that the LBMER performance is better than that of Min-Hop routing and the existing minimum energy routing scheme MTPR (Total Transmission Power Routing).

Multihop Deterministic Energy Efficient Routing Protocol for Wireless Sensor Networks MDR

The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).

Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.

Energy Efficient Load Balancing and Routing Using Multi-Objective Based Algorithm in WSN

In wireless sensor network(WSN),the gateways which are placed far away from the base station(BS)forward the collected data to the BS through the gateways which are nearer to the BS.This leads to more energy consumption because the gateways nearer to the BS manages heavy traffic load.So,to over-come this issue,loads around the gateways are to be balanced by presenting energy efficient clustering approach.Besides,to enhance the lifetime of the net-work,optimal routing path is to be established between the source node and BS.For energy efficient load balancing and routing,multi objective based beetle swarm optimization(BSO)algorithm is presented in this paper.Using this algo-rithm,optimal clustering and routing are performed depend on the objective func-tions routingfitness and clusteringfitness.This approach leads to decrease the power consumption.Simulation results show that the performance of the pro-posed BSO based clustering and routing scheme attains better results than that of the existing algorithms in terms of energy consumption,delivery ratio,through-put and network lifetime.Namely,the proposed scheme increases throughput to 72%and network lifetime to 37%as well as it reduces delay to 37%than the existing optimization algorithms based clustering and routing schemes.

FEAR: Fuzzy-Based Energy Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are used in different civilian, military, and industrial applications. Recently, many routing protocols have been proposed attempting to find suitable routes to transmit data. In this paper we propose a Fuzzy Energy Aware tree-based Routing (FEAR) protocol that aims to enhance existing tree-based routing protocols and prolong the network’s life time by considering sensors’ limited energy. The design and implementation of the new protocol is based on cross-layer structure where information from different layers are utilized to achieve the best power saving. Each node maintains a list of its neighbors in order to use neighbors’links in addition to the parent-child links. The protocol is tested and compared with other tree-based protocols and the simulation results show that FEAR protocol is more energy-efficient than comparable protocols. According to the results FEAR protocol saves up to 70.5% in the number of generated control messages and up to 55.08% in the consumed power.

An Integrative Comparison of Energy Efficient Routing Protocols in Wireless Sensor Network

Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power. In this work, we have explored some energy-efficient routing protocols (LEACH, Directed Diffusion, Gossiping and EESR) and their expansions (enhancements), and furthermore, their tactics specific to wireless sensor network, such as data aggregation and in-network processing, clustering, different node role assignment, and data-centric methods. After that we have compared these explored routing protocols based on different metrics that affect the specific application requirements and WSN in general.

An Energy Efficient Routing Protocol for In-Vehicle Wireless Sensor Networks

In this paper, an advanced distributed energy-efficient clustering (ADEEC) protocol was proposed with the aim of balancing energy consumption across the nodes to achieve longer network lifetime for In-Vehicle Wireless Sensor Networks (IVWSNs). The algorithm changes the cluster head selection probability based on residual energy and location distribution of nodes. Then node associate with the cluster head with least communication cost and high residual energy. Simulation results show that ADEEC achieves longer stability period, network lifetime,and throughput than the other classical clustering algorithms.

Toward a Multi-Hop, Multi-Path Fault-Tolerant and Load Balancing Hierarchical Routing Protocol for Wireless Sensor Network

This paper describes a novel energy-aware multi-hop cluster-based fault-tolerant load balancing hierarchical routing protocol for a self-organizing wireless sensor network (WSN), which takes into account the broadcast nature of radio. The main idea is using hierarchical fuzzy soft clusters enabling non-exclusive overlapping clusters, thus allowing partial multiple membership of a node to more than one cluster, whereby for each cluster the clusterhead (CH) takes in charge intra-cluster issues of aggregating the information from nodes members, and then collaborate and coordinate with its related overlapping area heads (OAHs), which are elected heuristically to ensure inter-clusters communication. This communication is implemented using an extended version of time-division multiple access (TDMA) allowing the allocation of several slots for a given node, and alternating the role of the clusterhead and its associated overlapping area heads. Each cluster head relays information to overlapping area heads which in turn each relays it to other associated cluster heads in related clusters, thus the information propagates gradually until it reaches the sink in a multi-hop fashion.

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.

A Novel Energy Aware Clustering Technique for Routing in Wireless Sensor Networks

Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.

Analysis and Improvement on Routing Protocols for Wireless Sensor Networks

Routing protocols are perceived to be growing hotspots and required to devote more time and work to studying it. Research on routing protocols of wireless sensor networks is significantly important to accurately guide the application. Theoretical analysis and comparison are one of the key steps in the protocol research. Restricted by irreversible factors of power and others, lifetime of wireless sensor networks is very short. In this paper, we analyze and compare the characteristics and application fields of existing protocols. On the basis of that, this paper mainly proposes an improved directed diffusion exploring the phase of reinforcing path, which chooses the way to strengthen the path after evaluating the critical factors. It was determined by simulation that improved directed diffusion has a higher transmission rate, and it satisfies the requirements, which balancing the energy consumption and prolonging the lifetime.

Reliable energy-efficient routing with novel route update in wireless sensor networks

In this paper we introduce a novel energy-aware routing protocol REPU (reliable, efficient with path update), which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the re-ceived signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the waypoints. One distinct ad-vantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two waypoint nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simul-taneous packet forwarding.

Clustering routing algorithm of wireless sensor networks based on Bayesian game

To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.

An energy efficiency clustering routing protocol for WSNs in confined area

Wireless sensor networks (WSNs) are important application for safety monitoring in underground coal mines, which are difficult to monitor due to natural conditions. Based on the characteristic of limited energy for WSNs in confined underground area such as coal face and laneway, we presents an energy- efficient clustering routing protocol based on weight (ECRPW) to prolong the lifetime of networks. ECRPW takes into consideration the nodes' residual energy during the election process of cluster heads. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, the protocol also sets up a routing tree based on cluster heads' weight. The results show that ECRPW had better perfor- mance in energy consumption, death ratio of node and network lifetime.

LOA-RPL:Novel Energy-Efficient Routing Protocol for the Internet of Things Using Lion Optimization Algorithm to Maximize Network Lifetime

Energy conservation is a significant task in the Internet of Things(IoT)because IoT involves highly resource-constrained devices.Clustering is an effective technique for saving energy by reducing duplicate data.In a clustering protocol,the selection of a cluster head(CH)plays a key role in prolonging the lifetime of a network.However,most cluster-based protocols,including routing protocols for low-power and lossy networks(RPLs),have used fuzzy logic and probabilistic approaches to select the CH node.Consequently,early battery depletion is produced near the sink.To overcome this issue,a lion optimization algorithm(LOA)for selecting CH in RPL is proposed in this study.LOA-RPL comprises three processes:cluster formation,CH selection,and route establishment.A cluster is formed using the Euclidean distance.CH selection is performed using LOA.Route establishment is implemented using residual energy information.An extensive simulation is conducted in the network simulator ns-3 on various parameters,such as network lifetime,power consumption,packet delivery ratio(PDR),and throughput.The performance of LOA-RPL is also compared with those of RPL,fuzzy rule-based energyefficient clustering and immune-inspired routing(FEEC-IIR),and the routing scheme for IoT that uses shuffled frog-leaping optimization algorithm(RISARPL).The performance evaluation metrics used in this study are network lifetime,power consumption,PDR,and throughput.The proposed LOARPL increases network lifetime by 20%and PDR by 5%–10%compared with RPL,FEEC-IIR,and RISA-RPL.LOA-RPL is also highly energy-efficient compared with other similar routing protocols.

Optimized Algorithm for Clustering Routing for Wireless Sensor Networks

LEACH protocol randomly selects cluster head nodes in a cyclic manner. It may cause network to be unstable, if the low energy node is elected as the cluster head. If the size of cluster is too large or too small, it will affect the survival time of the network. To address this issue, an improved solution was proposed. Firstly, the scheme considered the average and standard deviation of the nodes’ residual energy and the distance between the node and the base station, then considered the distance between the node and the cluster head and the energy of the cluster head to optimize the cluster head selection and clustering. The performance analysis results showed this scheme could reduce premature deaths of the cluster heads and too high energy consumption of some clusters. Thus, the proposed algorithm could prompt the stability and prolong the lifetime of the network.

Energy Optimisation in Wireless Sensor Network

The solution we propose optimizes the energy inside the wireless sensor network (WSN) with higher performance. The WSN is composed of many sensors nodes which collect the information, treat that information then send it to the base station. The information is received by the base station (BS) then data?are?sent to the users by that BS. The most important element in sensor node is energy, as the lifetime of wireless sensor network depends on the sensor node energy. So many researches had been made in order to improve this energy basing routing protocols. As a result, we are able to propose a solution that optimizes this energy. In this paper, we are presenting a new approach of selecting node sensor base on routing protocol and process to send data to the base station. This ameliorates wireless sensor network lifetime and increases?the transmission sensor node to base station.

An Energy-Aware Clustering Approach for Wireless Sensor Networks

Energy conservation is an essential and critical requirement for a wireless sensor network with battery oper-ated nodes intended for long term operations. Prior work has described different approaches to routing protocol designs that achieve energy efficiency in a wireless sensor network. Several of these works involve variations of mote-to-mote routing (flat routing) while some make use of leader nodes in clusters to perform routing (hierarchical routing). A key question then arises as to how the performance of an energy-aware, flat routing protocol compare with that of one based on hierarchical routing. This paper demonstrates a hierarchical routing protocol design that can conserve significant energy in its setup phase as well as during its steady state data dissemination phase. This paper describes the design of this protocol and evaluates its performance against existing energy-aware flat routing protocols. Simulation results show that it exhibits competitive performance against the flat routing protocols.