Improved LEACH Routing Protocol Through Selecting Cluster Head Node and Data Transmission Algorithm

2016 ◽  
Vol 13 (10) ◽  
pp. 7184-7188
Author(s):  
Hong Dai ◽  
Heng Hui Ge

For LEACH routing protocol in the clustering routing protocol of wireless sensors, the network energy consumption inequality, node energy inequality and deficiency of cluster head election, this paper proposes the method of improving the cluster head election through node residual energy and the distance between the nodes. To balance the network energy consumption, improves the algorithm of stable data transmission phase. The simulation experiment results prove the fact that the improved algorithm is better than the original algorithm through comparing the node mortality, receiving data amount of base station and residual energy of the node.

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.


Author(s):  
Fuseini Jibreel ◽  
Emmanuel Tuyishimire ◽  
I M Daabo

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.


Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.


2020 ◽  
Author(s):  
Hamid Reza Farahzadi ◽  
Mostafa Langarizadeh ◽  
Mohammad Mirhosseini ◽  
Seyed Ali Fatemi Aghda

AbstractWireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zuo Chen ◽  
Min He ◽  
Wei Liang ◽  
Kai Chen

Wireless sensor network (WSN) is a kind of distributed and self-organizing networks, in which the sensor nodes have limited communication bandwidth, memory, and limited energy. The topology construction of this network is usually vulnerable when attacked by malicious nodes. Besides, excessive energy consumption is a problem that can not be ignored. Therefore, this paper proposes a secure topology protocol of WSN which is trust-aware and of low energy consumption, called TLES. The TLES considers the trust value as an important factor affecting the behavior of node. In detail, the TLES would take trust value, residual energy of the nodes, and node density into consideration when selecting cluster head nodes. Then, TLES constructs these cluster head nodes by choosing the next hop node according to distance to base station (BS), nodes’ degrees, and residual energy, so as to establish a safe, reliable, and energy saving network. Experimental results show that the algorithm can effectively isolate the malicious node in the network and reduce the consumption of energy of the whole network.


2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.


2019 ◽  
Vol 8 (4) ◽  
pp. 11996-12003

Wireless Sensor network becomes an essential part of Internet of things paradigm due their scalability, ease of deployment and user-friendly interface. However, certain issues like high energy consumption, low network lifetime and optimum quality of service requirement force researchers to develop new routing protocols. In WSNs, the routing protocols are utilized to obtain paths having high quality links and high residual energy nodes for forwarding data towards the sink. Clustering provide the better solution to the WSN challenges by creating access points in the form of cluster head (CH). However, CH must tolerate additional burden for coordinating network activities. After considering these issues, the proposed work designs a moth flame optimization (MFO) based Cross Layer Clustering Optimal (MFO-CLCO) algorithm to consequently optimize the network energy, network lifetime, network delay and network throughput. Multi-hop wireless communication between cluster heads (CHs) and base station (BS) is employed along with MFO to attain optimum path cost. The simulation results demonstrate that the proposed scheme outperforms existing schemes in terms of energy consumption, network lifetime, delay and throughput.


Author(s):  
M. Jalasri ◽  
L. Lakshmanan

AbstractFog computing and the Internet of Things (IoT) played a crucial role in storing data in the third-party server. Fog computing provides various resources to collect data by managing data security. However, intermediate attacks and data sharing create enormous security challenges like data privacy, confidentiality, authentication, and integrity issues. Various researchers introduce several cryptographic techniques; security is still significant while sharing data in the distributed environment. Therefore, in this paper, Code-Based Encryption with the Energy Consumption Routing Protocol (CBE-ECR) has been proposed for managing data security and data transmission protocols using keyed-hash message authentication. Initially, the data have been analyzed, and the distributed cluster head is selected, and the stochastically distributed energy clustering protocol is utilized for making the data transmission. Code-driven cryptography relies on the severity of code theory issues such as disorder demodulation and vibration required to learn equivalence. These crypto-systems are based on error codes to build a single-way function. The encryption technique minimizes intermediate attacks, and the data have protected all means of transmission. In addition to data security management, the introduced CBE-ECR reduces unauthorized access and manages the network lifetime successfully, leading to the effective data management of 96.17% and less energy consumption of 21.11% than other popular methods.The effectiveness of the system is compared to the traditional clustering techniques.


Wireless sensor networks (WSN) are gaining attention in numerous fields with the advent of embedded systems and IoT. Wireless sensors are deployed in environmental conditions where human intervention is less or eliminated. Since these are not human monitored, powering and maintaining the energy of the node is a challenging issue. The main research hotspot in WSN is energy consumption. As energy drains faster, the network lifetime also decreases. Self-Organizing Networks (SON) are just the solution for the above-discussed problem. Self-organizing networks can automatically configure themselves, find an optimalsolution, diagnose and self-heal to some extent. In this work, “Implementation of Enhanced AODV based Self-Organized Tree for Energy Balanced Routing in Wireless Sensor Networks” is introduced which uses self-organization to balance energy and thus reduce energy consumption. This protocol uses combination of number of neighboring nodes and residual energy as the criteria for efficient cluster head election to form a tree-based cluster structure. Threshold for residual energy and distance are defined to decide the path of the data transmission which is energy efficient. The improvement made in choosing robust parameters for cluster head election and efficient data transmission results in lesser energy consumption. The implementation of the proposed protocol is carried out in NS2 environment. The experiment is conducted by varying the node density as 20, 40 and 60 nodes and with two pause times 5ms, 10ms. The analysis of the result indicates that the new system consumes 17.6% less energy than the existing system. The routing load, network lifetime metrics show better values than the existing system.


Author(s):  
Ekaterina Andreevna Evstifeeva ◽  
Valeriy Dmitrievich Semeykin

Clustering, as one of the energy-efficient approaches, is widely used in wireless sensor networks. This method is based on creating clusters and selecting cluster head nodes in a wireless sensor network. Clustering saves network energy because data transfer is restricted between multiple nodes. Thus, clustering is provided between several nodes, and the service life of the wireless sensor network can be extended. Since the parent cluster node interacts with other nodes of the network, a node with a high level of residual energy must be selected to perform this role. When the energy level of the selected cluster head node becomes lower than the threshold value, then the re-election of this node takes place. It should be noted that multiple patterns of choosing cluster head nodes built using various parameters (residual node energy, distance from the base station to a node, distance between the head node and a cluster member, the number and proximity of neighboring nodes, etc.) lacked for a factor of energy consumption, i.e. how many times nodes communicated to each other. To cope with the problem, this paper presents a prognostic algorithm for selecting a cluster head node using fuzzy logic. This algorithm suggests using a number of input parameters, such as the residual energy of the node, the proximity of neighboring nodes, and the centralization of the node in the cluster. The proposed algorithm has been implemented using the software package MATLAB Fuzzy Logic Toolbox. The simulation results prove the advantages of the proposed technique; application of the input parameters mentioned above helps select optimal cluster head nodes in a wireless sensor network, which increases power efficiency of a wireless sensor network.


Sign in / Sign up

Export Citation Format

Share Document