Energy Balanced Routing Protocol Research Articles

An Improved Energy Balance Routing Protocol based on LEACH Protocol

An Improved Energy Balance Routing Protocol based on LEACH Protocol

Analytical Study of an Improved Cluster based Routing Protocol in Wireless Sensor Network

Objectives: To analyze the homogeneous protocols like Low Energy Adaptive Clustering Hierarchy (LEACH), Improved Energy Balanced Routing Protocol (IEBRP) and some of the heterogeneous protocols like Distributed Energy Efficient Clustering (DEEC) and Modified Stable Election Protocol (M-SEP). Methods/Statistical Analysis: We focus on the different levels of energy such as single energy level (LEACH, IEBRP), Distributed Energy Level (DEEC) and multi energy level (M-SEP). Later we compare the algorithms of design of LEACH, IEBRP, DEEC and M-SEP protocol too. Finally we simulate all the four protocols using C platform and calculated the lifetime of sensor networks with the help of four new matrices: First Node Died (FND), Some Node Died (SND), Half Node Died (HND) and Last Node Died (LND). Findings: Finding out the best suited path from sensor node to sink and calculating the efficiency with respect to different routing protocols determines that M-SEP is more efficient than other three routing protocols. M-SEP has more alive nodes with respect to number of rounds. Application/Improvements: Simulating all the matrices with respect to different parameters result reveals that M-SEP performs 22%, 40% and 55% respectively longer than LEACH, IEBRP and DEEC. It also increases the lifetime, no of data packet send to the BS and data transmission rate, other than three routing protocols.

Energy Efficient and Collaborative Communication Protocol for Wireless Sensor Networks

Now a day's, most of the research will be concentrated on wireless sensor networks (WSN) because wireless sensor network was a new computing and communication era which resulted due to the advanced reaching in various domain such as Information and communication Engineering. The usage of wireless network was increased which gave a wide deployment of sensor networks. Also, due to its wide application and least cost it became an emerging field. The wireless sensor networks communicate through their radio interface and Energy efficient routing protocols and QoS parameters are playing a vital role in WSN. The proper selection of routing protocol to transmit the data that contain higher energy efficiency and low delay can improve the sensor network lifetime. In this paper, an energy balanced routing protocol was used to consume the energy, the delay was reduced and throughput is increased using the energy efficient protocol.

An IP Format Based Algorithm for ZigBee Routing Protocol Optimization

Learning from the conventional practice of network IP address format, this paper proposed an IP-format-based algorithm for ZigBee energy-balanced routing protocol optimization. The algorithm combines node’s cluster address and node’s network short address into a new address and divides the address’s field as IP-format. So that the address will contain information of the network’s topology and provide decision base for a routing algorithm to optimize the original algorithm selection criteria. Meanwhile, in order to improve the ratio of valid data packets and reduce routing overhead, the new algorithm controls the general direction and the number of hops of the RREQ packets to reduce unwarranted data packet transmission. Finally, the simulation carried out on NS platform demonstrates the algorithm’s superiority on network’s delay jitter, overhead and residual energy.

Tree Based Energy Balancing Routing Protocol by Self Organizing in Wireless Sensor Networks

Today the wireless sensor networks (WSN) play a crucial role in wireless technology in various domains like military, medicine, communications etc. The energy conservation is the crucial factor in the WSN. The WSN is a system which has more number of nodes in which various sensors are fabricated on the nodes to monitor various factors of the given task. These nodes will form a network by connecting the one to other for the effective communication between the nodes, and sends the whole information to the base station (BS). As the nodes which we use for the WSN are of low cost and are battery operated. The main drawback is replacement of the battery in the WSN. The main goal is to conserve the energy consumption in WSN and also to balance the load on WSN. For this many protocols are designed like LEACH, PEGASIS, PEDAP, etc. in those balancing the load and time delayed. some drawbacks are there. So we proposed a protocol so called “Tree Based Energy Balancing routing Protocol by Self Organizing” (TEBRSO), in which instead of routing tables a routing tree will be used for routing from nodes to base station (BS), which chooses one root/control node for the broadcasting messages to the selected sensor nodes. By this protocol we can save the energy consumption in WSN and can extend the life time of it. The performance of this protocol is better when we compare with other energy saving protocols.

Tree based Energy Balanced Routing Protocol by using Clustering and Compressive Sensing Technique

The quick expansion in network multimedia equipments has permitted additional real-time digital services for example online games and work facility, video conferencing and distance education to develop to be the conventional internet tasks. WSN has developed into huge area of research in computational theory due to its broad range of applications. But because of restricted battery power, the energy consumption has turn into major restrictions of WSNs protocols. Though many protocols have been introduced to improve the energy efficiency further but still much enhancement can be done. GSTEB has shown relatively significant results over the existing WSNs protocols. But it has ignored the use of the three things like the effect of the mobile sink, Clustering and the effect of the compressive sensing. To defeat the constraints of the earlier work a new improved technique is proposed in this research paper. The future technique has the capability to overcome the restrictions of the GSTEB routing protocol by using the compressive sensing and level based clustering.

Extending Wireless Sensor Network Lifetime With Global Energy Balance

In this paper, a decentralized routing algorithm, called game theoretic energy balance routing protocol, is proposed to extend the network lifetime by balancing energy consumption in a larger network area using geographical routing protocols. The objective of the proposed protocol is to make sensor nodes deplete their energy at approximately the same time, which is achieved by addressing the load balance problem at both the region and node levels. In the region level, evolutionary game theory (EGT) is used to balance the traffic load to available subregions. At the node level, classical game theory (CGT) is used to select the best node to balance the load in the selected subregion. This two-level approach is shown to be an effective solution for load balancing and extending network lifetime. This paper shows the use of EGT and CGT in designing a robust protocol that offers significant improvement over existing protocols in extending network lifetime.

EE-LEACH: development of energy-efficient LEACH Protocol for data gathering in WSN

A wireless sensor network (WSN) consists of a huge number of sensor nodes that are inadequate in energy, storage and processing power. One of the major tasks of the sensor nodes is the collection of data and forwarding the gathered data to the base station (BS). Hence, the network lifetime becomes the major criteria for effective design of the data gathering schemes in WSN. In this paper, an energy-efficient LEACH (EE-LEACH) Protocol for data gathering is introduced. It offers an energy-efficient routing in WSN based on the effective data ensemble and optimal clustering. In this system, a cluster head is elected for each clusters to minimize the energy dissipation of the sensor nodes and to optimize the resource utilization. The energy-efficient routing can be obtained by nodes which have the maximum residual energy. Hence, the highest residual energy nodes are selected to forward the data to BS. It helps to provide better packet delivery ratio with lesser energy utilization. The experimental results shows that the proposed EE-LEACH yields better performance than the existing energy-balanced routing protocol (EBRP) and LEACH Protocol in terms of better packet delivery ratio, lesser end-to-end delay and energy consumption. It is obviously proves that the proposed EE-LEACH can improve the network lifetime.

Using multiparent routing in RPL to increase the stability and the lifetime of the network

Energy is a very scarce resource in Wireless Sensor Networks. While most of the current proposals focus on minimizing the global energy consumption, we aim here at designing an energy-balancing routing protocol that maximizes the lifetime of the most constraint nodes. To improve the network lifetime, each node should consume the same (minimal) quantity of energy. We propose the Expected Lifetime metric, denoting the residual time of a node (time until the node will run out of energy). We design mechanisms to detect energy-bottleneck nodes and to spread the traffic load uniformly among them. Moreover, we apply this metric to RPL, the de facto routing standard in low-power and lossy networks. In order to avoid instabilities in the network and problems of convergence, we propose here a multipath approach. We exploit the Directed Acyclic Graph (DAG) structure of the routing topology to probabilistically forward the traffic to several parents. Simulations highlight that we improve both the routing reliability and the network lifetime, while reducing the number of DAG reconfigurations.

An Energy Balanced Loop-Free Routing Protocol for Distributed Wireless Sensor Networks

To prolong the network lifespan, the energy-balanced routing algorithm builds its routes based on a weighted sum of node's depth, residual energy and energy density. It is a pity that this algorithm introduces routing loops and redundant hops, which result in end-to-end delay and consuming more energy. More seriously, packets cannot reach the sink. In this paper, to avoid routing loop and redundancy, a novel next-hop selection method is proposed, moreover, the routing loop and redundant hops detection and elimination mechanism have been built up. Theoretical analysis and simulation experiments show that the network lifespan is stretched by 68.72% and 24.65% compared with minimum hop routing and energy-balanced routing protocol (EBRP) separately.

Performance Optimization of Forward Aware Factor -Energy Balanced Routing Protocol In Wireless Sensor Networks

A wireless sensor network (WSN) consists of a large number of wireless sensor nodes. Since wireless sensor nodes are battery powered devices, they have limited processing and transmission power. In order to transmit sensing data to receiver effectively, it is important to design a routing protocol for WSNs. Since energy conservation is a key issue in WSNs, data aggregation should be exploited in order to save energy. In this case, redundant data can be aggregated at intermediate nodes reducing the size and number of exchanged messages and, thus, decreasing communication costs and energy consumption. This paper propose a Forward Aware Factor-Energy Balanced Routing Method (FAF-EBRM). In the experiments, this method is compared with LEACH. Experimental results show that this method FAF-EBRM outperforms LEACH, which balances the energy consumption, prolongs the network function lifetime and provides the best aggregation quality . Keywords: forward aware factor(FAF), Energy balance, Routing, Wireless sensor networks(WSNs).

A Study on Existing Protocols and Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks

Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of forming residue energy among sensor nodes, and eventually results in a network partition. In this paper, with the help of the concept of potential in physics, we design an Energy-Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field in terms of depth, energy density, and residual energy. The goal of this basic approach is to force packets to move toward the sink through the dense energy area to protect the nodes with relatively low residual energy. To address the routing loop problem emerging in this basic algorithm, enhanced mechanisms are proposed to detect and eliminate loops. The basic algorithm and loop elimination mechanism are first validated through extensive simulation experiments.Â

Energy Balance Routing Protocol Based on Location Information

For the current routing algorithm based on the geographic location information, the energy consumption is high and uneven. To address the problem, we propose an energy balance routing protocol (GEBR) based on the geographical location information, using a virtual sink technology to balance the node energy consumption within the scope of gateway communication. Simulation results show that compared with GEAR protocol, the GEBR protocol postponed the generation of energy hole, balanced energy consumption, effectively prolong the network lifetime.

Layer Based Energy-Balanced Reliable Routing Protocol for Wireless Sensor Networks in Coal Mine

Synthetically considering the special environment underground, we combined the wireless sensor network with the existing cable mine monitoring system, forming a new monitoring system based on Ethernet and WSN, and then we put forward a layer based energy-balanced reliable routing (LBEBR) protocol for WSN to solve the spot problem in zonal area of coal mine and to ensure the reliability of data transmission. The working face was divided into several equal rectangular layers. According to the optimal cluster radius calculated before, different numbers of nodes constituted clusters of different sizes in each layer. In the stage of data transmission, using the reliability evaluation of nodes and considering three factors, the residual energy of nodes, the distance between nodes and the reliability of nodes, to select the best next-hop node. Simulation results show that the protocol can not only balance the energy of the network, but also elude problem nodes effectively to increase the reliability of data transmission.

LEBRP a Lightweight and Energy Balancing Routing Protocol for Energy Constrained Wireless Ad Hoc Networks

A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on the network and are free to associate with any other wireless ad hoc network devices in their range. Due to their nature, these networks commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing protocol that is light enough for energy constrained networks, and find routes on the basis of remaining power of each node. Besides, we have also taken some other factors into consideration. These factors include the ratio of remaining power of a node to the distance of the node from next receiving node and the ratio of the remaining power of current node to the average remaining power of the whole network. This protocol puts emphasis on routing in such a way that the network stays heterogeneous in terms of remaining power of nodes. This homogeneity brings on a longer network lifetime. In addition, the presented protocol does not impose a high computational load on the network. Hence, it is lightweight enough to be used in networks with low computational power and constrained power resources.

Relocation routing for energy balancing in mobile sensor networks

AbstractWireless sensor networks (WSNs) have been widely investigated in the past decades because of its applicability in various extreme environments. As sensors use battery, most works on WSNs focus on energy efficiency issues (e.g., local energy balancing problems) in statically deployed WSNs. Few works have paid attention to the global energy balancing problem for the scenario that mobile sensor nodes can move freely. In this paper, we propose a new routing protocol called global energy balancing routing protocol (GEBRP) based on an active network framework and node relocation in mobile sensor networks. This protocol achieves global energy efficiency by repairing coverage holes and replacing invalid nodes dynamically. Simulation and experiment results demonstrate that the proposed GEBRP achieves superior performance over the existing scheme. In addition, we analyze the delay performance of GEBRP and study how the delay performance is affected by various system parameters.Copyright © 2013 John Wiley & Sons, Ltd.

Sink Mobility Based and Energy Balancing Routing Protocol

In the wireless sensor network routing protocol design, the sensor node monitoring data in multi-hop relay approach to sink node for transmission. For sink aggregation node fixed network, the nearby sink nodes of sensor nodes need to transfer other nodes of the monitoring data, consequently, it consumes large amounts of energy, and it's easy to premature death, making the network connectivity decline, even making the network intersected, shorten the lifetime of the network. In order to solve this problem, from the view of sink node, this thesis brings forward a protocol of SERP, which is a energy balancing routing protocol based on sink Mobility and prolongs the lifetime of network. It adopts the strategy of sink movement which makes the hot nodes inside the network take turns, balances the load among them. In SERP, firstly, the WSN deployment area is divided into finite Virtual cells ;Secondly ,we make the center of each virtual cell as the mobile position of sink node; at last, we confirm the residence time when sink node stays in each position through linear programming. Finally, the paper makes simulation al analysis aiming at above-mentioned routing protocols . The result shows that the inside node energy consumption is comparatively balanced and efficient, and the network lifetime is prolonged effectively.

EBRP: Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks

Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. In this paper, with the help of the concept of potential in physics, we design an Energy-Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field in terms of depth, energy density, and residual energy. The goal of this basic approach is to force packets to move toward the sink through the dense energy area so as to protect the nodes with relatively low residual energy. To address the routing loop problem emerging in this basic algorithm, enhanced mechanisms are proposed to detect and eliminate loops. The basic algorithm and loop elimination mechanism are first validated through extensive simulation experiments. Finally, the integrated performance of the full potential-based energy-balanced routing algorithm is evaluated through numerous simulations in a random deployed network running event-driven applications, the impact of the parameters on the performance is examined and guidelines for parameter settings are summarized. Our experimental results show that there are significant improvements in energy balance, network lifetime, coverage ratio, and throughput as compared to the commonly used energy-efficient routing algorithm.

An Novel Energy Balanced Dynamic Routing Protocol Based on Probability in Wireless Sensor Netwoks

Nodes in most wireless sensor networks (WSNs) are powered by batteries with limited energy. So it requires energy efficiency techniques to increase the lifetime of the network.In this paper, an novel energy balanced dynamic routing protocol based on probability(EBDRP-P) is proposed,which is able to prolong network lifetime and balance energy consumption between cluster heads. We introduce the typical energy model to compute energy consumption and state conversion to reduce energy consumption. In addition,we use residual energy,distance and neighbor cluster head number to compute probability of a head becomes the next hop,then reference the ideas of minimum cost spanning routing tree to constructure dynamic routing,namely,always select the maximum probability head as the next hop,which can balance the energy consumption between cluster heads and to prolong network lifetime.Further, simulation experiments are conducted to compare the EBDRP-P with some wellknown clustering algorithms and simulation results show that the proposed methods overcomes the existing methods in the aspects of energy consumption and network lifetime in wireless sensor networks.

Energy balance routing protocol for wireless sensor networks based on fuzzy next-hop selection

The implementation of energy balanced routing is an effective way to prolong the lifetime of wireless sensor networks (WSNs). To balance energy consumption, fuzzy next-hop selecting strategy was designed: nodes of different gradients are fuzzily classified into relevant levels; each level has a chance to provide a node with maximum residual energy as the next-hop. Based on the above strategy and directed diffusion (DD), fuzzy next-hop selection based energy balance (FNSEB) routing protocol was proposed. The simulation results showed that FNSEB utilized the limited energy more thoroughly and rationally, decreased the average energy consumption and prolonged the lifetime of WSNs.