scholarly journals A low energy adaptive clustering multi-hop routing protocol based on fuzzy decision

2015 ◽  
Vol 29 (6) ◽  
pp. 2547-2554 ◽  
Author(s):  
Feng Xu ◽  
Wenzhi Zhu ◽  
Jingfeng Xu ◽  
Haiguang Lai ◽  
Chenghui Zheng
Keyword(s):  
Routing Protocol ◽  
Low Energy ◽  
Fuzzy Decision ◽  
Adaptive Clustering

Research on Low Power Routing Protocol for WSNs

2014 ◽  
Vol 610 ◽  
pp. 927-932
Author(s):  
Ahmed Rouaba ◽  
Nouamane Soualmi ◽  
He Zun Wen
Keyword(s):  
Energy Source ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Communication Systems ◽  
Cluster Head ◽  
Life Time ◽  
Low Energy ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Save Energy

A wireless sensor network (WSN) consists of large number of autonomous sensors nodes; these nodes communicate with each other in dispersed manner to observe the environment. WSNs become one of the most important researches in modern communication systems. The energy source of nodes is limited and practically it is impossible to change or charge the battery. In order to save energy and increases the life time of battery in WSNs. Many energy routing protocols using the clustering were proposed in the literature. Low Energy Adaptive Clustering Hierarchy (LEACH) is the most famous routing protocol. In this paper we propose a new algorithm to choose the cluster head which has the highest energy. We shared the network to four regions, between them 90° for each part we find the powerful sensor between the sensors groups, and this last will be the cluster head of this round. Each sensor sends its data to the nearest cluster head and this last will send it to the sink. The same work for five and six clusters heads with sink in the center and in the corner (100, 0) is done.

A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks

2015 ◽  
Vol 11 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Wassim Jerbi ◽  
Abderrahmen Guermazi ◽  
Hafedh Trabelsi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Cluster Head ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Basic Algorithm ◽  
Adaptive Clustering

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.

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

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Lin Li ◽  
Donghui Li
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Cluster Head ◽  
Low Energy ◽  
Fuzzy Rules ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Energy Balanced Routing

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.

scholarly journals Energy-Efficient Clustering Scheme for Flying Ad-Hoc Networks Using an Optimized LEACH Protocol

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6016
Author(s):  
Salil Bharany ◽  
Sandeep Sharma ◽  
Sumit Badotra ◽  
Osamah Ibrahim Khalaf ◽  
Youseef Alotaibi ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Base Station ◽  
Low Energy ◽  
Sensor Nodes ◽  
Threshold Function ◽  
Adaptive Clustering ◽  
Leach Protocol ◽  
Energy Efficient Clustering

A Flying Ad-hoc network constitutes many sensor nodes with limited processing speed and storage capacity as they institute a minor battery-driven device with a limited quantity of energy. One of the primary roles of the sensor node is to store and transmit the collected information to the base station (BS). Thus, the life span of the network is the main criterion for the efficient design of the FANETS Network, as sensor nodes always have limited resources. In this paper, we present a methodology of an energy-efficient clustering algorithm for collecting and transmitting data based on the Optimized Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. The selection of CH is grounded on the new optimized threshold function. In contrast, LEACH is a hierarchical routing protocol that randomly selects cluster head nodes in a loop and results in an increased cluster headcount, but also causes more rapid power consumption. Thus, we have to circumvent these limitations by improving the LEACH Protocol. Our proposed algorithm diminishes the energy usage for data transmission in the routing protocol, and the network’s lifetime is enhanced as it also maximizes the residual energy of nodes. The experimental results performed on MATLAB yield better performance than the existing LEACH and Centralized Low-Energy Adaptive Clustering Hierarchy Protocol in terms of energy efficiency per unit node and the packet delivery ratio with less energy utilization. In addition, the First Node Death (FND) is also meliorated when compared to the LEACH and LEACH-C protocols.

Sign in / Sign up

Export Citation Format

Share Document