scholarly journals An Energy-Balanced Routing Protocol for a Wireless Sensor Network

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Lin Li ◽  
Donghui Li

The wireless sensor network is an intelligent self-organizing network which consists of many sensor nodes deployed in the monitoring area. The greatest challenge of designing a wireless sensor network is to balance the energy consumption and prolong the lifetime of the network, seeing that the nodes can be powered only by batteries in most conditions. An energy-balanced routing protocol (EBRP) for wireless sensor networks is proposed in this paper. In EBRP, we divide the network into several clusters by using K-means++ algorithm and select the cluster head by using the fuzzy logical system (FLS). Since the previous researches did not demonstrate how to get the fuzzy rules for different networks, we propose a genetic algorithm (GA) to obtain the fuzzy rules. We code the rules as a chromosome, and the lifetime of the network is treated as a fit function. Then, through the selection, crossover, and mutation of each generation, the best offspring can be decoded as the best rule for each network model. Through the simulation, comparing with the existing routing protocols such as low-energy adaptive clustering hierarchy (LEACH), low-energy adaptive clustering hierarchy-centralized (LEACH-C), and stable election protocol (SEP), the EBRP prolongs the network lifetime (first node dies) by 57%, 63%, and 63%, respectively.

2016 ◽  
Vol 8 (3) ◽  
pp. 76 ◽  
Author(s):  
Ridha Azizi

Extend the life of a wireless sensor network (WSN) is a fundamental challenge, as they have a limited supply. Multiple protocols and approaches have been proposed to minimize power consumption. Routing protocols and especially the hierarchical approach is one of the techniques used to minimize energy consumption and to improve the duration of network life. In this paper we propose a new approach to transfer and select the CH (Cluster Head). ART-LEACH (Advanced Routing Transfer- Low-Energy Adaptive Clustering Hierarchy) is a self-organizing protocol based on clustering. Our approach is to use energy more evenly the selected nodes as CH. We evaluated the performance of LEACH (Low-Energy Adaptive Clustering Hierarchy) and IB-LEACH (Improved and Balanced Low Energy Adaptive Clustering Hierarchy) protocol with the proposed new approach using MATLAB as a simulation tool. The simulation results showed that our proposal provides a reduction in energy consumption and increase the duration of network life.


Author(s):  
Wassim Jerbi ◽  
Abderrahmen Guermazi ◽  
Hafedh Trabelsi

The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.


Author(s):  
Boselin Prabhu ◽  
Bala Kumar

Wireless sensor network (WSN) is a low-powered prestigious network fashioned by sensor nodes that treasures application in civilian, military, visual sense models and many others. Reduced energy utilization is an exigent task for these sensor networks. By the data aggregation procedure, needless communication between sensor nodes, cluster head and the base station is eluded. An evaluation of energy efficient optical low energy adaptive clustering hierarchy has been performed and the enactments have been compared with the prevailing low energy adaptive clustering hierarchy algorithm, between two detached wireless sensor network fields. The proposed clustering procedure has been primarily implemented to join two distinct wireless sensor fields. An optical fiber is used to join two reserved wireless sensor fields. This distributed clustering methodology chiefly targets in exploiting the parameters like network lifetime, throughput and energy efficiency of the whole wireless sensor system.


2013 ◽  
Vol 347-350 ◽  
pp. 1738-1742 ◽  
Author(s):  
Xiao Wen Ma ◽  
Xiang Yu

Wireless sensor networks comprise of minor battery driven devices with restricted energy resources.Once installed,the minor sensor nodes are usually unapproachable to the operator, and thus auxiliary of the energy source is not practicable.Hence,energy proficiency is a vital design issue that needs to be boosted in order to increase the lifetime of the network. LEACH is a popular hierarchical routing protocol which efficiently maintains the energy storage of nodes in Wireless Sensor Network (WSN).The nodes using LEACH are divided into clusters.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. This paper studies LEACH protocol, and focuses on how to decide the next hop nodes more reasonable when the data are transmitted at the steady state. Simulation has been done in NS2 and the results show that the algorithm after improved is more energy-efficient than LEACH protocol.


Sign in / Sign up

Export Citation Format

Share Document