LEACH-C Protocol Research Articles

Investigation of Energy Efficient Clustering Algorithms in WSNs: A Review

In recent years, Wireless Sensor Networks (WSNs) are attracting more attention in many fields as they are extensively used in a wide range of applications, such as environment monitoring, the Internet of Things, industrial operation control, electric distribution, and the oil industry. One of the major concerns in these networks is the limited energy sources. Clustering and routing algorithms represent one of the critical issues that directly contribute to power consumption in WSNs. Therefore, optimization techniques and routing protocols for such networks have to be studied and developed. This paper focuses on the most recent studies and algorithms that handle energy-efficiency clustering and routing in WSNs. In addition, the prime issues in these networks are discussed and summarized using comparison tables, including the main features, limitations, and the kind of simulation toolbox. Energy efficiency is compared between some techniques and showed that according to clustering mode “Distributed” and CH distribution “Uniform”, HEED and EECS are best, while in the non-uniform clustering, both DDAR and THC are efficient. According to clustering mode “Centralized” and CH distribution “Uniform”, the LEACH-C protocol is more effective.

Performance Analysis and Evaluation of a Multi-Hop Routing Protocol for Wireless Multimedia Sensor Networks

Researchers in wireless multimedia sensor networks (WMSNs) are constantly interested in designing and developing energy-efficient routing protocols. Numerous clustering routing protocols have been developed in recent years to overcome the limitation of consuming less energy and prolong the lifetime of sensor nodes in homogeneous and heterogeneous WMSNs. Existing approaches depend on single-hope communication, in which sensor nodes consume more energy and die faster. Inter-communication nodes can play an important role in reducing energy by transmitting data in a multi-hope fashion to the sink. An energy-efficient multi-path clustering with load balancing routing protocol for wireless multimedia sensor networks (EEMCL) is proposed in this study. In this protocol, the main cluster heads (MCHs) are preselected in each network cluster and filled with more energy than normal sensor nodes. The two secondary cluster heads (SCHs) with the highest energy nodes will be selected by the main cluster head algorithm. Moreover, inter-cluster multi-hop routing with the help of MCHs can enhance the network lifetime when the sink is located at the corner of the sensing field. The simulation results verify that the proposed multi-hop technique provides better performance than existing LEACH, LEACH-C, SEEN, and IEE-LEACH routing protocols in scenario 1 and when compared with CPMA in scenario 2. The last node dead (LND) for the proposed protocol is at round 5721, 2225 for LEACH, 2300 for LEACH-C, 2900 for SEEN, and 3160 for IEE−LEACH in scenario 1, while in scenario 2, the LND for the proposed protocol is at round 3820 and 435 for the CPMA routing protocol.

Hybrid Bacteria Foraging Algorithm With PSO and DE Algorithm for Optimal Cluster Head Selection in Wireless Sensor Networks

Network lifetime and energy constraint are the main issues for the application of wireless sensor networks. Sensor nodes spend more energy in the communication process and affect the network lifetime. Clustering is the technique for choosing the optimal cluster head from the clusters. LEACH-C is the clustering protocol in WSN. BFA is applied in the LEACH-C protocol to form the optimal clusters. This optimization obtains more steps in the tumbling process and reaches the global optimum solution very slowly. This method directly affects the network lifetime. The above limitations are overcome by introducing the hybrid approach of bacteria foraging algorithm by integrating the PSO, and DE is applied in LEACH-C algorithm for finding the optimal cluster head. The best foraging solution is utilized in the chemotactic behavior of the bacterium by using PSO and DE algorithms. The proposed methodology increases by 66% and 77% of the alive nodes when compared to FA and BFPSO.

Construction of Modularized English Teaching Platform for Multimedia Wireless Network Based on NS2 Simulation Software

Using the NS2 network simulation tool to teach the “wireless network” course can enhance students’ understanding of wireless network protocols through visualization and can also improve students’ ability to analyze problems hands on. We built a multimedia wireless network modularized English teaching platform based on NS2 simulation software; made full use of the rich components and network resources provided by NS2 to achieve a high degree of code reuse and reduce the time for developing simulation codes; designed the overall framework of this multimedia wireless network modular English teaching platform based on the B/S structure; and solved the weight coefficient and importance value of the learning input evaluation index, based on the feedback elite teaching optimization algorithm, the improved teaching formula, the increase in the number of exchanges, and the improvement in the learner’s performance. The experimental results show that the LEACH and LEACH-C protocols of the clustered NS2 simulation software have more surviving nodes most of the time, which indicates that the clustering routing protocol has better performance.

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

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.

Energy efficient intra-cluster data aggregation technique for wireless sensor network

Cluster based routing strategies are popular categories of routing protocols among wireless sensor networks (WSNs). In a typical cluster based routing protocols, few nodes are elected as cluster Head (CH) nodes and they form clusters with other nodes of the networks known as cluster members. The data sensed by cluster members is sent to CH node for data aggregation and further processing. Data Aggregation is considered to be one of the important methods used to prolong the network lifetime of WSN. Data aggregation is quite popular among cluster based routing protocols for WSN, where the data packets are aggregated by intermediate nodes till it reaches to BS. Data aggregation ultimately helps in reducing the number of data messages thereby assisting in network life prolongation. In this paper, an intra-cluster data aggregation technique (ICA) for WSNs is proposed. ICA constructs the intra cluster data aggregation path from a source node to its CH node in an energy efficient way. The data packets are aggregated along the aggregation path by intermediate relay nodes till the message reaches to designated CH node. Comparative analysis of ICA, LEACH and LEACH-C protocols are carried by considering the parameters such as number of alive nodes, energy consumption, number of data packets received by BS. Results obtained show that ICA performs better compared to LEACH and LEACH-C protocols.

Duty Cycling Centralized Hierarchical Routing Protocol With Content Analysis Duty Cycling Mechanism for Wireless Sensor Networks

In this paper, a Duty Cycling Centralized Hierarchical Protocol (DCCHP) has been proposed for wireless sensor networks. DCCHP is an energy efficient protocol that prolongs the lifetime of the network by applying a duty cycling mechanism named DCM that chooses the nodes that send unimportant data in a certain epoch to be candidates to be put to sleep. But if the proposed equations for choosing the cluster head nodes put any of them in a high priority it works in the active mode. When comparing DCCHP to the previously proposed LEACH-CS, LEACH-C protocols, using a simulation study, DCCHP in average extends the network lifetime 50% more than LEACH-CS and about 60% more than LEACH-C across a different number of nodes in the network scaled up to 1000 nodes. That is because DCCHP chooses the definite number of nodes of unimportant data to be switched to sleeping mode unlike LEACH-CS and unlike LEACH- C which keeps all nodes in active mode. Also an analytical study of energy consumption proves that DCCHP preserves energy consumption more than LEACH-CS and DCCHP. DCCHP has been proposed for applications with scarce resources.

Performance Comparison of LEACH and LEACH-C Protocols in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) draw the attention of researchers due to the diversity of applications that use them. Basically, a WSN comprises many sensor nodes that are supplied with power by means of a small battery installed in the node itself; the node can also be self-charged by a solar cell. Sometimes it is impossible to change the power supply of battery-operated nodes. This dictates that sensor nodes must utilize the energy they have in an optimal manner. Data communication is the main cause of energy dissipation. In this context, designing protocols for WSNs demands more attention to the design of energy-efficient routing protocols that allow communications between sensor nodes and their base station (BS) with the least cost. LEACH is a prominent hierarchical cluster-based routing protocol. It groups sensor nodes into clusters to reduce energy dissipation. On the other hand, LEACH-C is a protocol based on LEACH that claims to improve energy dissipation over LEACH. In this paper, a successful attempt was made to compare these two protocols using MATLAB. The results show that LEACH-C has better performance than LEACH in terms of power dissipation.

An energy-aware buffer management (EABM) routing protocol for WSN

Wireless sensor network (WSN) seeks an unequal clustering approach to solve its energy hole and HOTSPOT issue. Increasing the cluster number and decreasing the size of the cluster near the sink equally distribute the load across the network. The approach is to made buffer aware to enhance the network lifetime and avoid data packet drop due to buffer overflow. The increase in buffer size is always not possible in preconfigured sensor nodes, making lifetime and data loss as a major problem. An energy-aware buffer management (EABM) routing protocol is designed to overcome the issue. The memory vacancy and energy level are considered before routing the next hop data to the cluster. The proposed EABM routing protocol is compared with LEACH, LEACH-C, ALEACH and EAR routing protocols to support our claim. The proposed routing protocol provides higher lifetime of 1.17 rounds, 1.1 times throughput and 0.73 times reduced packet drop considering LEACH as a benchmark protocol. The energy and buffer filling near the sink are equally distributed in case of the proposed EABM routing protocol.

Particle Swarm Optimization-Based Unequal and Fault Tolerant Clustering Protocol for Wireless Sensor Networks

Clustering is one of most efficient energy saving techniques for maximizing network lifetime in wireless sensor networks. In the multi-hop approach, cluster heads (CHs) close to the base station deplete their energy very quickly due to high inter-cluster relay traffic load, causing the hot spot problem. Thus, a clustering protocol is required to be energy efficient as well as fault tolerant. This paper presents a particle swarm optimization (PSO)-based unequal and fault tolerant clustering protocol referred as PSO-UFC. The proposed protocol addresses imbalanced clustering and fault tolerance issues in the existing energy-balanced unequal clustering (EBUC) protocol for the long-run operation of the network. To solve the imbalanced clustering problem, the PSO-UFC protocol utilizes unequal clustering mechanism to balance intra-cluster and inter-cluster energy consumption between the Master CHs (MCHs). Also, in PSO-UFC protocol the network connectivity is restored by electing an extra CH called Surrogate CH due to sudden failure of MCH. The obtained simulation results demonstrate that the PSO-UFC protocol prolongs the network lifetime against EBUC, PSO-C, and LEACH-C protocols.

Energy Efficient Energy Hole Repelling (EEEHR) Algorithm for Delay Tolerant Wireless Sensor Network

Reducing energy consumption and increasing network lifetime are the major concerns in Wireless Sensor Network (WSN). Increase in network lifetime reduces the frequency of recharging and replacing batteries of the sensor node. The key factors influencing energy consumption are distance and number of bits transmitted inside the network. The problem of energy hole and hotspot inside the network make neighbouring nodes unusable even if the node is efficient for data transmission. Energy Efficient Energy Hole Repelling (EEEHR) routing algorithm is developed to solve the problem. Smaller clusters are formed near the sink and clusters of larger size are made with nodes far from the sink. This methodology promotes equal sharing of load repelling energy hole and hotspot issues. The opportunity of being a Cluster Head (CH) is given to a node with high residual energy, very low intra cluster distance in case of nodes far away from the sink and very low CH to sink distance for the nodes one hop from the sink. The proposed algorithm is compared with LEACH, LEACH-C and SEP routing protocol to prove its novel working. The proposed EEEHR routing algorithm provides improved lifetime, throughput and less packet drop. The proposed algorithm also reduces energy hole and hotspot problem in the network.

Adaptive Simulated Evolution based Approach for Cluster Optimization in Wireless Sensor Networks

Energy consumption minimization is crucial for the constrained sensors in wireless sensor networks (WSNs). Partitioning WSNs into optimal set of clusters is a promising technique utilized to minimize energy consumption and to increase the lifetime of the network. However, optimizing the network into optimal set of clusters is a non-polynomial (NP) hard problem, and the time needed to solve such problem increases exponentially as the number of sensors increases. In this paper, simulated evolution (SimE) algorithm is engineered to tackle the problem of cluster optimization in WSNs. A goodness measure is developed to measure the accuracy of assigning nodes to clusters and to evaluate the clustering quality of the overall network. SimE was developed such that the number of clusters and cluster heads are adaptive to number of alive nodes in the network. In fact, extensive simulation results demonstrate that SimE provides near optimal clustering and improves the lifetime of the network by about 21% compared to the traditional LEACH-C protocol.

Energy aware routing technique based on Markov model in wireless sensor network

ABSTRACTThe wireless sensor network has placed its inevitable position in monitoring and surveillance purpose. The remote and unattended condition of wireless sensor network seeks a new energy-efficient algorithm. Enhancing the lifetime of wireless sensor network has become the primary need to prolong the monitoring duration. This paper envisage the increase in lifetime of nodes by properly selecting the cluster head (CH) based on the residual energy state and total number of frames transmitted to the sink. The role of sensor node is modeled as finite state machine and realized as Markov process. The process helps in scheduling the role of the sensor node and in the process of CH selection. Lifetime enhancement is achieved by selecting optimal CH among eligible cluster members (CM). The proposed algorithm outperforms the other algorithms in terms of lifetime by 1.83 times and increase in throughput by 1.07 times when compared to LEACH-C protocol. The results supports that EAR increases the lifetime of the network and serves as the better solution for HOT SPOT and energy hole problem to the network.

Clustering in Wireless Sensor Networks using IDEC-LEACH-C Hybrid Energy Efficient Protocol

Recent advances in wireless telecommunication and electronics have provided the ability to design and produce sensors with low consumption power, small size, fair price and different usages. These small sensors, which are able to accomplish tasks like receiving different peripheral information, are the cause of creation of an idea for developing networks called Wireless Sensor Networks (WSN). The most challenging task in WSN networks is routing. There are different protocols in WSN, which were used for routing data packages from beginning to destination. LEACH is the first and the most famous hierarchical clustering algorithm with effective energy for WSNs, which was proposed for decreasing the energy consumption. Definite clustering protocol (DEC) uses the remaining energy of each cluster node (RE) for the process of selecting CH. As long as the RE of each node is higher than its adjacent, DEC considers that node as a selection choice and guarantees that each CH has enough energy to cope with its role, of course until the end of the network lifetime (unlike LEACH). In this research, it is decided that in order for improving the results, the LEACH-C protocol, which excels the performance of the LEACH protocol, to be combined with the protocol IDEC (Improved DEC). In this study, the descriptive-analytical approach was carried out as a research methodology based on the proposed model. The proposed model was combined with two algorithms of LEACH-C and IDEC. In this study, results of LEACH, LEACH-C and DEC were compared. According to the research results, we observed that the performance of the proposed protocol excels other proposed protocols. The protocol ICED & LEACH-C saves energy. As we know, decreased energy consumption increases lifetime of the network. General Terms Wireless Sensor Networks (WSN); Energy

Fuzzy based Distributed Cluster Formation and Route Construction in Wireless Sensor Networks

The efficiency of cluster formation has a sound effect on limiting battery lifetime in cluster based wireless sensor networks. Fuzzy based decision support system enables node to make evaluation and pass a soft decision on the state of being configured as normal or cluster leader without the presence of precise information about different clustering parameters. In this paper, a distributed fuzzy based cluster formation is presented in which the set of appropriate cluster heads are elected to setup clusters and optimal routes toward the base station are constructed based on the candidate gateway nodes. Initially, the base station partitions the network into different tiers and then nodes define themselves to the corresponding tier. The minimum distance from the border of corresponding tier and energy level limit the selection probability of node to become cluster head or gateway node. The fuzzy logic toolbox is developed in C++ and integrated with OMNeT++ simulation platform to implement the protocol and experimental results reveal that the proposed protocol prolongs the network lifetime compared to LEACH-C and CHEF protocols.

Impact of Black Hole and Sink Hole Attacks on Routing Protocols for WSN

With the drastic growth of Internet and VLSI design, applications of WSNs are increasing tremendously that ranges from environmental monitoring, habitat monitoring, traffic surveillance to battle fields. In WSN a number of tiny sensor nodes managed by small batteries are deployed in a hostile environment to monitor the physical parameters. During transmission, the sensor nodes consume considerable amount of energy. There are many constraints on these sensor nodes such as limited memory, limited battery power, and limited processing capability. Moreover, these factors impose a restricted lifetime for the entire network. When sensor nodes send the information to the base station (BS), routing protocol plays the key role to deliver the information at the destination. Low Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-C is the well-known distributed and centralized clustering routing protocol respectively. In LEACH, the cluster head (CH) is elected on a probabilistic threshold value on a rotation basis and only CHs are allowed to send the information to the BS. LEACH-C is the modified version of LEACH and works on the centralized principle. Further, WSNs are vulnerable to many types of attacks, as WSNs are normally deployed in a harsh environment. So, security is one of the major challenging issues that need to be focused. Many researchers have addressed these issues on LEACH protocol as LEACH is the first ever cluster based routing protocol. As far as our knowledge is concerned, there is a lack of research in the current literature by considering both LEACH and LEACH-C protocol under some attacks. So, we have made an attempt to analyze the performance of both the protocols under some well-known attacks like black hole and sink hole attacks. Again, we plan to propose a detection mechanism which is in progress.

An Energy-Saving Routing Algorithm for Wireless Body Sensor Network using Data Compression Technique

A wireless sensor network (WSN) is used to monitor the environmental condition. There consist of N number of sensor nodes which are connected to each other and they are clustered in to different groups. There have a cluster head (CH) which is used to manage the cluster members (CM). when the sensor node is active, energy will be reduced vitally in order to increase the life time of the sensor node different application has be implemented .In this method Energy consumption will been reduced by implementing leach-c protocol and LZW compression technique so the lifetime of the sensor node is increased.

Trust Factor based LEACH-C protocol for Wireless Sensor Networks

Trust in wireless sensor network is an essential feature to detect various kind of attacks in the network. Wireless sensor nodes are more prone to attacks as nodes are deployed in an open environment. In case of centralized low energy adaptive cluster head protocol cluster heads in each round are selected by sink node. We propose a trust factor based LEACH-C protocol, to detect malicious nodes based on trust calculations which involves observation of various parameters and evaluation of trust factors. Simulation is conducted in using NS-2, by varying the number of malicious nodes and results are analyzed for energy consumption, number of data packets sent and percentage of malicious node detection.

Multilevel minimised delay clustering protocol for wireless sensor networks

In this paper, a multilevel minimised delay clustering protocol (MMDCP) is proposed. MMDCP is proved to extend the lifetime of wireless sensor networks through levelling and through a better choice of cluster heads. MMDCP assigns the number of the lower level cluster heads and the leaf nodes in the network so as to minimise the end-to-end delay. When comparing MMDCP to LEACH-C, THCHP and Delay-Aware protocols; MMDCP succeeds in extending the lifetime of the network and in minimising the end-to-end delay and also in increasing throughput values. MMDCP also improves the structure of the network of delay-aware protocol. Two radio models are used in evaluation, the first order radio model and the discrete radio model. The obtained results are proved analytically and via simulation. These results make the proposed protocol a very good candidate for use in crises management applications like pre-expectation of landslides and early control of slum fires.

Energy Efficient Cluster based Routing Protocol for Wireless Sensor Networks

Wireless sensor network is a great boon to wireless technology which can be used in various critical applications, making it more familiar in emerging technologies which we use in our day to day life. Even though it has several advantages, it has some drawbacks like limited communication bandwidth, energy consumption etc. The purpose of the paper is to design an energy efficient cluster based routing protocol to minimize energy consumption since energy resource is the major life factor for a node. Usage of clustering concept in hierarchical protocol provides more advantages than any other traditional routing protocols. LEACH and LEACH-C are most commonly used hierarchical routing protocols. The author is proposing an enhancement of LEACH-C protocol, instead of using constant round time usage of adaptive variable round time method provides a multi-hop communication between distance nodes to base station. Thus by using this method, this protocol can be used for larger geographical region with less energy consumption and less cluster head death. The results were obtained by using NS2 simulator which shows the improvement of overall network efficiency by comparing with existing protocols.