Low-Energy Adaptive Unequal Clustering Protocol Using Fuzzy c-Means in Wireless Sensor Networks

Clustering technique in wireless sensor networks incorporate proper utilization of the limited energy resources of the deployed sensor nodes with the highest residual energy that can be used to gather data and send the information. However, the problem of unbalanced energy consumption exists in a particular cluster node in the network. Some more powerful nodes act as cluster head to control sensor network operation when the network is organized into heterogeneous clusters. It is important to assume that energy consumption of these cluster head nodes is balanced. Often the network is organized into clusters of equal size where cluster head nodes bear unequal loads. Instead in this paper, we proposed a new protocol low-energy adaptive unequal clustering protocol using Fuzzy c-means in wireless sensor networks (LAUCF), an unequal clustering size model for the organization of network based on Fuzzy c-means (FCM) clustering algorithm, which can lead to more uniform energy dissipation among the cluster head nodes, thus increasing network lifetime. A heuristic comparison between our proposed protocol LAUCF and other different energy-aware protocol including low energy adaptive clustering hierarchy (LEACH) has been carried out. Simulation result shows that our proposed heterogeneous clustering approach using FCM protocol is more effective in prolonging the network lifetime compared with LEACH and other protocol for long run.     

Energy optimized micro genetic algorithm based LEACH protocol for WSN

This article presents the design, analyses and implementation of the novel routing protocol for energy optimization based on LEACH for WSN. Network Lifetime is the major problem in various routing protocols used in WSN. In order to overcome that problem, our proposed routing protocol is developed, which is a combination of Micro Genetic algorithm with LEACH protocol. Our proposed µGA-LEACH protocol, strengthen the cluster head (CH) selection and also reduce the energy consumption of the network when compared to existing protocols. This paper shows the improvement of network lifetime and energy consumption with the optimal CH selection based on a micro genetic algorithm and also compared the results with an existing hierarchical routing protocol like LEACH, LEACH-C, LEACH GA and GADA LEACH routing protocol with various packet sizes, and initial energy.

     

基于剩余能量和睡眠控制的改进LEACH算法

无线传感器网络（WSN）路由协议研究的一个重要的目标是如何在有限的能源下降低整个网络的能耗,提高网络的生存时间。以分簇路由协议LEACH为研究基础,提出了一种改进算法。该算法改进了簇首选择规则,引入协调件协议算法,通过在成簇阶段降低剩余能量低的节点被选择成为簇首的概率,在稳定运行阶段使簇首节点尽可能多的保持睡眠状态,从而降低了网络能耗。仿真结果表明,与原LEACH算法相比,改进的算法能够明显地延长网络生存时间。     

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

一种基于LEACH路由协议的改进算法

无线传感器网络的生存时间受传感器节点软硬件条件的限制,改进传感器网络路由协议是延长网络生存时间的有效途径。LEACH协议是最早提出的经典分层路由协议,文中基于LEACH协议提出改进,应用K-medoids算法改进LEACH协议的簇首分簇机制,并通过Matlab仿真实验,证实了改进后的LEACH算法在均衡化网络能耗,延长网络的生命周期方面具有优越性。     

基于冗余节点的LEACH协议的改进

无线传感器网络中LEACH协议是一种典型的能有效延长网络生命周期的节能通信协议。因为其优秀的节能效果和其简单的规程得到了广泛的认可。但是LEACH簇头算法存在簇头开销大、簇头没有确定的数量和位置等不足。而在成簇后的稳定阶段,节点通过一跳通信将数据传送给簇头,簇头也通过一跳通信将聚合后的数据传送给基站,这样会造成簇头节点...     

基于节点位置的无线传感器网络分簇路由协议

针对LEACH协议生成非均匀簇造成能量损耗的问题,以网络簇头分布最优和降低能量损耗为目的,从选择簇头节点、形成簇、簇间路由等方面做了改进。经过理论分析和仿真实验与LEACH和LEACH-C算法比较,结果表明,该路由协议的设计使各节点较均衡地消耗能量,节点生存时间更长,延长了整个无线传感器网络的生命周期。     

Assimilation of fuzzy clustering approach and EHO‐Greedy algorithm for efficient routing in WSN

The problems related to energy consumption and improvement of the network lifetime of WSN (wireless sensor network) have been considered. The base station (BS) location is the main concern in WSN. BSs are fixed, yet, they have the ability to move in some situations to collect the information from sensor nodes (SNs). Recently, introducing mobile sinks to WSNs has been proved to be an efficient way to extend the lifespan of the network. This paper proposes the assimilation of the fuzzy clustering approach and the Elephant Herding Optimization (EHO)‐Greedy algorithm for efficient routing in WSN. This work considers the separate sink nodes of a fixed sink and movable sink to decrease the utilization of energy. A fixed node is deployed randomly across the network, and the movable sink node moves to different locations across the network for collecting the data. Initially, the number of nodes is formed into the multiple clusters using the enhanced expectation maximization algorithm. After that, the cluster head (CH) selection done through a fuzzy approach by taking the account of three factors of residual energy, node centrality, and neighborhood overlap. A suitable collection of CH can extremely reduce the utilization of energy and also enhancing the lifespan. Finally, the routing protocol of the hybrid EHO‐Greedy algorithm is used for efficient data transmission. Simulation results display that the proposed technique is better to other existing approaches in regard to energy utilization and the system lifetime.     

无线传感器网络功率路由算法研究

无线传感器网络的应用越来越广泛,主要是军事、工业、医疗等方面。然而无线传感器网络具有节点能量、存储和计算能力非常有限等特点,文中在传统的LEACH（低功耗自适应集簇分层型）协议的基础上进行了改进,并提出了一种新的无线传感器网络路由算法LEACH-N。新算法沿用了LEACH协议簇的结构,在簇头选择方法上基于传统DCHS算法的簇头选择算法,簇内成员与簇头之间直接通信,簇头与基站之间轮流进行单跳和多跳通信;多跳通信则是采用一种改进的MTE（最小传输能量）路由算法。通过NS2仿真软件对LEACH-N协议与LEACH协议分别进行了性能测试。实验结果表明,相比LEACH协议,LEACH—N协议系统能耗低、网络生命周期长,且具有更好的规模可扩展性。     

An improved cluster formation process in wireless sensor network to decrease energy consumption

Wireless 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.

     

一种基于LEACH协议的改进算法

作为能量有效、基于层次结构的路由协议的典型代表,LEACH协议存在的不足表现为网络中会出现极大簇和极小簇并存;当节点能量不同时簇头选择不合理;在簇头死亡后簇内节点仍会消耗能量.本文基于LEACH提出了一种改进算法,使用引入簇成员数门限和合并极小簇的方法避免极大簇和极小簇同时存在;通过对簇头能量消耗的估计,在簇头能量耗尽...     

A boolean spider monkey optimization based energy efficient clustering approach for WSNs

Wireless sensor network (WSN) consists of densely distributed nodes that are deployed to observe and react to events within the sensor field. In WSNs, energy management and network lifetime optimization are major issues in the designing of cluster-based routing protocols. Clustering is an efficient data gathering technique that effectively reduces the energy consumption by organizing nodes into groups. However, in clustering protocols, cluster heads (CHs) bear additional load for coordinating various activities within the cluster. Improper selection of CHs causes increased energy consumption and also degrades the performance of WSN. Therefore, proper CH selection and their load balancing using efficient routing protocol is a critical aspect for long run operation of WSN. Clustering a network with proper load balancing is an NP-hard problem. To solve such problems having vast search area, optimization algorithm is the preeminent possible solution. Spider monkey optimization (SMO) is a relatively new nature inspired evolutionary algorithm based on the foraging behaviour of spider monkeys. It has proved its worth for benchmark functions optimization and antenna design problems. In this paper, SMO based threshold-sensitive energy-efficient clustering protocol is proposed to prolong network lifetime with an intend to extend the stability period of the network. Dual-hop communication between CHs and BS is utilized to achieve load balancing of distant CHs and energy minimization. The results demonstrate that the proposed protocol significantly outperforms existing protocols in terms of energy consumption, system lifetime and stability period.     

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.     

Performance Analysis of Adaptive Routing Structure for Wireless Sensor Network Based on Load Balancing

Wireless sensor network consists of sensor nodes with battery operated device. The key challenges in the wireless sensor network are energy consumption and routing optimization. This work presents the cluster based load balancing (CBLB) routing protocol. The proposed routing protocol is used to minimize the energy consumption and increase the routing performance. It avoids the routing robustness, delay and increases the delivery rate and network performance. In existing techniques, different routing protocols such as LEACH, HEED and MESTER were used to increase the network performance and to decrease the energy consumption. But these existing techniques did not satisfy the performance requirements of wireless sensor networks. Hence, there is a requirement to develop a technique that meets the QoS requirements and needs of wireless sensor network. The proposed CBLB routing protocol creates a cluster head in the decentralized network and the cluster head will be used to distribute the workload evenly to the cluster members for reducing the energy consumption in wireless sensor network. Experimental results analyze the performance of the proposed protocol with the different existing protocols. The proposed protocol achieves high throughput, delivery rate and reduces the energy consumption, delay and routing overhead.     

基于TinyOS的无线传感器网络LEACH算法的改进

LEACH协议是无线传感器网络中最流行的分簇路由协议之一.针对LEACH算法簇分布不均匀以及网络能耗不均衡等问题提出了一种高效节能多跳路由算法.在簇建立阶段,新算法根据网络模型计算出最优簇头间距值,调整节点通信半径以控制簇的大小,形成合理网络拓扑结构;在数据传输阶段,簇头与基站之间采用多跳的通信方式,降低了节点能耗.在TinyOS操作系统下,使用nesC语言设计实现了LEACH-EEMH算法.基于TOSSIM平台的仿真结果表明,新算法较LEACH算法在均衡网络能耗、延长网络寿命方面具有显著优势.     

Modulated relay based stable election protocol for large-scale wireless sensor networks

Internet of things (IoT) applications based on wireless sensor networks (WSNs) have recently gained vast momentum. These applications vary from health care, smart cities, and military applications to environmental monitoring and disaster prevention. As a result, energy consumption and network lifetime have become the most critical research area of WSNs. Through energy-efficient routing protocols, it is possible to reduce energy consumption and extend the network lifetime for WSNs. Using hybrid routing protocols that incorporate multiple transmission methods is an effective way to improve network performance. This paper proposes modulated R-SEP (MR-SEP) for large-scale WSN-based IoT applications. MR-SEP is based on the well-known stable election protocol (SEP). MR-SEP defines three initial energy levels for the nodes to improve the network energy distribution and establishes multi-hop communication between the cluster heads (CHs) and the base station (BS) through relay nodes (RNs) to reduce the energy consumption of the nodes to reach the BS. In addition, MR-SEP reduces the replacement frequency of CHs, which helps increase network lifetime and decrease power consumption. Simulation results show that MR-SEP outperforms SEP, LEACH, and DEEC protocols by 70.2%, 71.58%, and 74.3%, respectively, in terms of lifetime and by 86.53%, 86.68%, and 86.93% in terms of throughput.     

基于改进LEACH的多簇头分簇路由算法

为了降低无线传感器网络(WSN)的能耗,延长网络的生存周期,提出一种多簇头双工作模式的分簇路由算法.算法对低功耗自适应集簇分层(LEACH)协议作了以下改进:采用多簇头双工作模式来分担单簇头的负荷,以解决单簇头因能耗较大而过早消亡的问题;选举簇头时充分考虑节点位置和节点剩余能量,并应用粒子群优化(PSO)算法优化簇头的选举,以均衡网络内各节点的能耗;建立簇与簇之间的数据传输路由,以减少簇间通信的能耗.仿真结果表明,算法有效降低了网络的能耗,延长了网络的生存周期.     

Improved bat optimization algorithm and enhanced artificial bee colony-based cluster routing scheme for extending network lifetime in wireless sensor networks

In this paper, improved bat and enhanced artificial bee colony optimization algorithm-based cluster routing (IBEABCCR) scheme is proposed for optimal cluster head (CH) selection with the merits of global diversity and improved convergence rate. It is proposed for achieving optimal CH selection by balancing the tradeoff between the phases of exploration and exploitation. It specifically targeted on the formulation of an ideal CH selection scheme using improved bat optimization algorithm (IBOA) for minimizing the energy depletion rate. It also focuses on the design of an enhanced artificial bee colony (EABC)-based sink node mobility scheme for determining the optimal points of deployment over which sink nodes can be moved to achieve better delivery of packets from CH to sink node. This CH selection and sink node mobility schemes are contributed for extending the network lifespan using the fitness function, which adopted the factors of node centrality, node degree, distance amid CH and base station (BS), distance among sensor nodes, and residual energy during CH selection process. The simulation experiments were performed using MATLAB version 2018, which confirmed that the number of alive nodes realized in the network is enhanced by 39.21% with the location of BS positioned at (100, 100). The number of rounds (network lifetime) is enhanced by 23.84% with different BS locations in the network. Furthermore, the packets received at the BS are also realized to be enhanced by 26.32% on an average in contrast to the baseline CH schemes used for investigation.     

基于最优簇头数的无线传感器网络安全LEACH路由协议

提出一种基于最优簇头数的无线传感器网络安全LEACH路由协议,该协议模拟真实传感器网络情况建立了三维空间模型,通过理论分析和仿真实验方法得到LEACH协议的最优簇头数,使网络能耗达到最优。在能量优化的同时把增强安全性作为设计目标,根据LEACH协议的特点,采用预置共享密钥对的方法,在簇头选举和数据传输阶段采用在数据包尾部捎带加密信息的方法,实现数据加密,在只增加少量能量开销的情况下数据机密性得到了实现。仿真验证了新协议的有效性,在能量优化的同时提高了路由安全性,延长了网络生命期。     

LEACH协议的改进与仿真分析

在深入分析无线传感器网络路由协议设计目标的基础上,由于低功耗自适应分簇路由协议（LEACH,Low Energy Adaptive Clustering Hierarchy）簇头既要融合簇内节点发送来的数据又要将处理后的数据发送给基站,导致能量消耗较大。因此融入负载平衡和簇内成链的思想对LEACH协议进行改进,通过贪婪算法使簇内节点数据传输采用链式传输,让簇头工作时间尽量延长,使簇的稳定阶段时间提高,全网节点负载均衡。通过NS2对改进的LEACH协议进行仿真分析,结果表明改进的LEACH协议网络寿命极大延长。