LEATCH: Low Energy Adaptive Tier Clustering Hierarchy

Akkari, Wafa; Bouhdid, Badia; Belghith, Abdelfettah

doi:10.1016/j.procs.2015.05.110

Cited by 38 publications

(21 citation statements)

References 8 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After receiving the information, the cluster head will send the information to the main station or next cluster heads. LEACH [7], [10]modifies the cluster head alternately to a Uniform Distribution of Energy Consumption among the nodes. The LEACH performance is controlled by the run-time.…”

Section: Sedighimanesh M; Sedighimanesh a Reducing Energy Consumpmentioning

confidence: 99%

See 1 more Smart Citation

Reducing Energy Consumption of the SEECH Algorithm in Wireless Sensor Networks Using a Mobile Sink and Honey Bee Colony Algorithm

Sedighimanesh¹,

Sedighimanesh²

2018

Rev. Dir. Est. e Telecomunicacoes

View full text Add to dashboard Cite

Purpose – Clustering, routing, and data dissemination are an important issue in wireless sensor networks. The basic functions of wireless sensor networks are phenomena controlling in the physical environment, and the reporting of sensed data to the central node called sink, in which more operations can be done on the data. The most important limitation of wireless sensor networks is energy consumption. There are several ways to increase the lifetime of these networks, that one of the most important is the using proper clustering method. The aim of this study is to reduce energy consumption using an effective clustering algorithm and for this purpose, the honeybee colony metaheuristic method was used for cluster heads selection. Methodology/approach/design – The simulation in this paper was done using MATLAB software and the proposed method is compared with the LEACH and SEED approach. Findings – The results of simulations in this research indicate that the research has significantly reduced the energy consumption in the network than LEACH and SEED algorithms. Originality/value – Given the energy constraints in the wireless sensor network, providing such solutions and using metaheuristic algorithms can dramatically reduce energy consumption and, consequently increase network lifetime.

show abstract

Section: Sedighimanesh M; Sedighimanesh a Reducing Energy Consumpmentioning

confidence: 99%

“…The selected cluster is announced to neighbors as the new cluster head. According to [6], [10], the most important weaknesses of this algorithm include:…”

Section: Sedighimanesh M; Sedighimanesh a Reducing Energy Consumptmentioning

confidence: 99%

Reducing Energy Consumption of the SEECH Algorithm in Wireless Sensor Networks Using a Mobile Sink and Honey Bee Colony Algorithm

Sedighimanesh¹,

Sedighimanesh²

2018

Rev. Dir. Est. e Telecomunicacoes

View full text Add to dashboard Cite

show abstract

“…CHs are selected randomly and the energy is divided between all the nodes equally. CHs aggregate all received data from all nodes in the clusters [15].…”

Section: Previous Workmentioning

confidence: 99%

Fuzzy-Clustering Based Data Gathering in Wireless Sensor Network

Abasi¹,

Sajedi²

2016

IJSC

View full text Add to dashboard Cite

show abstract

“…In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered as three key issues in designing routing protocols Wafa Akkari et al (2015) [12]. The choice of the optimal routes ensures the delivery of information to the base station and reduces the packet delivery delay.…”

Section: Orphan Problem and Proposed Solutionmentioning

confidence: 99%

A Routing Protocol Orphan-Leach to Join Orphan Nodes in Wireless Sensor Network

Jerbi¹,

Guermazi²,

Trabelsi³

2016

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

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, we propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy) a routing protocol that takes into account the orphan nodes. Indeed, a cluster member will be able to play the role of a gateway which allows the joining of orphan nodes. If a gateway node has to connect a important number of orphan nodes, thus a sub-cluster is created and the gateway node is considered as a CH' for connected orphans. As a result, orphan nodes become able to send their data messages to the CH which performs in turn data aggregation and send aggregated data message to the CH. The WSN application receives data from the entire network including orphan nodes. The simulation results show that O-LEACH performs better than LEACH in terms of connectivity rate, energy, scalability and coverage.

show abstract

LEATCH: Low Energy Adaptive Tier Clustering Hierarchy

Cited by 38 publications

References 8 publications

Reducing Energy Consumption of the SEECH Algorithm in Wireless Sensor Networks Using a Mobile Sink and Honey Bee Colony Algorithm

Reducing Energy Consumption of the SEECH Algorithm in Wireless Sensor Networks Using a Mobile Sink and Honey Bee Colony Algorithm

Fuzzy-Clustering Based Data Gathering in Wireless Sensor Network

A Routing Protocol Orphan-Leach to Join Orphan Nodes in Wireless Sensor Network

Contact Info

Product

Resources

About