Research on Improved Low-Energy Adaptive Clustering Hierarchy Protocol in Wireless Sensor Networks

Ying, Zhang; Li, Peisong; Mao, Lin

doi:10.1007/s12204-018-1991-0

Cited by 8 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…I-LEACH likewise chooses sub-CH alongside CH in each groups, so that at whatever point the CH passes on inside the round then sub-CH keeps on being CH for that specific group for that round to guarantee no deficiency of information. [17] K-LEACH Energy saving is the urgent issue in planning the remote sensor organizations. In this paper, an adjusted calculation for Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is proposed.…”

Section: Eth-leachmentioning

confidence: 99%

A Review on Descendants of Leach Protocol - A Pragmatic Approach

Charaan¹,

Therasa²,

Malathi³

2022

IJAR

View full text Add to dashboard Cite

A Wireless Sensor Networks (WSN) is a Wireless Networks comprising of spatially disseminated independent sensors to screen physical or natural circumstances. The battery power in these sensor nodes assumes a significant part in expanding the life expectancy of the nodes. Hierarchical routing protocols are the most popular protocols to limit the energy utilization when compared to Flat Routing. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a traditional Cluster based routing protocol for WSNs having great execution, energy productivity, and successful in elongating the lifetime of the network life time by consuming a little level of the complete disseminated energy in the framework. This paper reviews the condition of craft of various progressed, enhanced routing protocols that have been created from the LEACH. This paper features a portion of the downsides and issues of LEACH how these issues are vanquished by the relatives of LEACH. Appraisal of descendants of LEACH routing protocols in advised with regards to versatility, self-association, and conveyance of nodes, network control, Hop count, energy proficiency, and utilization of data.

show abstract

Section: Eth-leachmentioning

confidence: 99%

A Review on Descendants of Leach Protocol - A Pragmatic Approach

Charaan¹,

Therasa²,

Malathi³

2022

IJAR

View full text Add to dashboard Cite

show abstract

“…In [31], Zhang et al presented an improved LEACH algorithm for WSN to optimize the election of CH. In the initialization stage, the BS broadcasts the initialization message to the whole network.…”

Section: Related Workmentioning

confidence: 99%

“…e specific network parameters are listed in Table 1, and the BPSO parameters are listed in Table 2. For Table 1, the parameters network size, BS coordinates, control packet size, data packet size, and data packet number per round are defined by us, 10% as the percentage of CHs is the best value obtained through many experiments, and other parameters on energy are the same as parameters in [15,24,25,[29][30][31][32][33][34][35][36]. For Table 2, the number of the parameters of particles and the number of iterations are defined by us, and other parameters are the optimal values obtained through many experiments.…”

Section: Simulation Parameters and Evaluation Metricsmentioning

confidence: 99%

Combinatorial Optimization-Based Clustering Algorithm for Wireless Sensor Networks

Cao

Wang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

As node energy of wireless sensor networks (WSN) is limited and cannot be supplemented after exhaustion, clustering algorithm is frequently taken as an effective method to prolong the lifetime of WSN. However, the existing clustering algorithms have some drawbacks, either consuming excessive energy as a result of exchanging too much controlling information between nodes, or lacking a comprehensive perspective in terms of the balance among several conflicting objectives. In order to overcome these shortcomings, a novel combinatorial optimization-based clustering algorithm (COCA) for WSN is proposed in this paper. Different from the above mentioned algorithms which take clustering as a continuous optimization problem, COCA solves the clustering problem from the perspective of combinatorial optimization. Firstly, the clustering of WSN is abstracted into a combinatorial optimization problem. Then, the binary particle coding scheme of cluster head is proposed, which is based on the corresponding relationship between nodes and particle position vectors, and the fitness function is designed according to the parameters used in the process of cluster formation. Finally, the binary particle swarm optimization algorithm is applied to implement the clustering. COCA is validated under different scenarios compared with three other clustering algorithms. The simulation results show that COCA has better performance than its comparable algorithms.

show abstract

“…For more information, see https://creativecommons.org/licenses/by-nc-nd/4.0/ clustering algorithms. The topology-control structure can help balance limited energy consumption [14].…”

Section: Introductionmentioning

confidence: 99%

“…Thus, this protocol is not optimal in terms of energy consumption. Based on LEACH, another algorithm known as improved LEACH was proposed [14], which selects the path with minimum energy cost from the source to the BS. This protocol considers node energy and position to select a CH, connects every node to a CH, and performs clustering based on distances between nodes and data transfer energy consumption.…”

Section: Introductionmentioning

confidence: 99%

A Mechanism for Load Balancing Routing and Virtualization Based on SDWSN for IoT Applications

2022

View full text Add to dashboard Cite

Wireless sensor networks (WSN) are important communication components of an internet of things (IoT). With the development of IoT and the increasing number of connected devices, network structure management and maintenance face the serious challenge of energy consumption. By balancing the network load, the energy consumption can be improved effectively. In the conventional WSN architecture, the two prerequisites of the load-balancing mechanism, flexibility and adaptability, are difficult to achieve. softwaredefined networking (SDN) is a novel network architecture that can promote flexibility and adaptability using a centralized controller. In this paper, a novel SDN architecture aimed at reducing load distribution and prolonging lifetime is proposed, which consists of different components such as topology, BS and controller discovery, link, and virtual routing. Accordingly, a new mechanism is proposed for load-balancing routing through SDN and virtualization. Through direct monitoring of the link load information and the network running status, the employed OpenFlow protocol can determine load-balancing routing for every flow in different IoT applications. The flows in different resource applications can be directed to a base station (BS) via various routes. This implementation reduces the exchange of network status and other relevant information. Virtual routing aims to weigh forward nodes and select the best node for each IoT application. The simulation results show the distribution of load over the network in the proposed algorithm and are characterized by the balanced network energy consumption, but also it prolongs network lifetime in comparison to the LEACH, improved LEACH, and LEACH-C algorithms. IoT, load balancing, routing, SDN, WSN. INDEX TERMS

show abstract

Research on Improved Low-Energy Adaptive Clustering Hierarchy Protocol in Wireless Sensor Networks

Cited by 8 publications

References 5 publications

A Review on Descendants of Leach Protocol - A Pragmatic Approach

A Review on Descendants of Leach Protocol - A Pragmatic Approach

Combinatorial Optimization-Based Clustering Algorithm for Wireless Sensor Networks

A Mechanism for Load Balancing Routing and Virtualization Based on SDWSN for IoT Applications

Contact Info

Product

Resources

About