A Green Clustering Protocol for Mobile Sensor Network Using Particle Swarm Optimization

Energy consumption of sensor nodes is one of the crucial issues in prolonging the lifetime of wireless sensor networks. One of the methods that can improve the utilization of sensor nodes batteries is the clustering method. In this paper, we propose a green clustering protocol for mobile sensor networks using particle swarm optimization (PSO) algorithm. We define a new fitness function that can optimize the energy consumption of the whole network and minimize the relative distance between cluster heads and their respective member nodes. We also take into account the mobility factor when defining the cluster membership, so that the sensor nodes can join the cluster that has the similar mobility pattern. The performance of the proposed protocol is compared with well-known clustering protocols developed for wireless sensor networks such as LEACH (low-energy adaptive clustering hierarchy) and protocols designed for sensor networks with mobile nodes called CM-IR (clustering mobility-invalid round). In addition, we also modify the improved version of LEACH called MLEACH-C, so that it is applicable to the mobile sensor nodes environment. Simulation results demonstrate that the proposed protocol using PSO algorithm can improve the energy consumption of the network, achieve better network lifetime, and increase the data delivered at the base station.     

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.     

Double Cluster Based Energy Efficient Routing Protocol for Wireless Sensor Network

Reducing the energy consumption of sensor nodes and prolonging the life of the network is the central topic in the research of wireless sensor network (WSN) protocol. The low-energy adaptive clustering hierarchy (LEACH) is one of the hierarchical routing protocols designed for communication in WSNs. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios. A developed routing protocol named as DL-LEACH is proposed. The DL-LEACH protocol cluster head election considers residual energy of nodes, distance from node to the base station and neighbor nodes, which makes cluster head election reasonable and node energy consumption balance. The simulation results of proposed protocols are compared for its network life time in MATLAB with LEACH protocol. The DL-LEACH is prolong the network life cycle by 75 % than LEACH.     

基于双簇头非均匀分簇的LEACH协议的改进

在无线传感器网络中的LEACH协议是一种自适应聚类路由算法．由于LEACH协议存在着无法控制簇首在网络中的分布位置、簇首选择方式限制条件不够等缺点导致能量消耗太大．基于簇头能量限制和双簇头路由方式,对LEACH协议进行了改进,设计了一种降低能耗的双簇头非均匀分簇路由协议．双簇头非均匀分簇路由协议采用NS2进行网络仿真实验,通过仿真结果的分析以及与LEACH协议的对比,证明双簇头非均匀分簇路由协议有效提高了网络能耗的均衡性．     

FUCA: Fuzzy‐based unequal clustering algorithm to prolong the lifetime of wireless sensor networks

Wireless sensor network comprises billions of nodes that work collaboratively, gather data, and transmit to the sink. “Energy hole” or “hotspot” problem is a phenomenon in which nodes near to the sink die prematurely, which causes the network partition. This is because of the imbalance of the consumption of energy by the nodes in wireless sensor networks. This decreases the network's lifetime. Unequal clustering is a technique to cope up with this issue. In this paper, an algorithm, “fuzzy‐based unequal clustering algorithm,” is proposed to prolong the lifetime of the network. This protocol forms unequal clusters. This is to balance the energy consumption. Cluster head selection is done through fuzzy logic approach. Input variables are the distance to base station, residual energy, and density. Competition radius and rank are the two output fuzzy variables. Mamdani method is employed for fuzzy inference. The protocol is compared with well‐known algorithms, like low‐energy adaptive clustering hierarchy, energy‐aware unequal clustering fuzzy, multi‐objective fuzzy clustering algorithm, and fuzzy‐based unequal clustering under different network scenarios. In all the scenarios, the proposed protocol performs better. It extends the lifetime of the network as compared with its counterparts.     

Energy-balanced unequal clustering protocol for wireless sensor networks

Clustering provides an effective way to prolong the lifetime of wireless sensor networks.One of the major issues of a clustering protocol is selecting an optimal group of sensor nodes as the cluster heads to divide the network.Another is the mode of inter-cluster communication.In this paper,an energy-balanced unequal clustering(EBUC)protocol is proposed and evaluated.By using the particle swarm optimization(PSO)algorithm,EBUC partitions all nodes into clusters of unequal size,in which the clusters closer to the base station have smaller size.The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the 'hot-spots' problem can be avoided.For inter-cluster communication,EBUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads.Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime.     

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

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

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

基于改进SSA优化WSN分簇协议

无线传感器网络(Wireless Sensor Networks,WSN)的路由协议是无线传感器网络领域中的一个研究热点.针对LEACH协议的不足,提出一种基于自适应t分布改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)的改进LEACH协议(LEACH?ISSA),以解决...     

一种无线传感器网络异构分簇模型的簇头调度方案

将无线传感器网络划分成簇会有效利用系统资源,近来提出的基于异构分簇模型的无线传感器网络,是指网络中存在多种不同能力的节点,能力强的节点自动成为簇头,这种网络避免了复杂的簇头选举过程并有效降低了普通节点的硬件复杂性和成本。但是,固定簇头的方法会削弱系统的负载均衡以及健壮性。为了解决这个问题,提出了一种基于自适应退避策略的簇头调度方案,该方案通过适当增加冗余度实现传感节点的k覆盖,增强了网络的健壮性。同时,依赖于地理信息和剩余电池能量信息,簇头节点通过自主周期性睡眠来保证系统负载的均衡分配,延长网络生存期。     

Impact of the energy-based and location-based LEACH secondary cluster aggregation on WSN lifetime

The improvement of sensor networks’ lifetime has been a major research challenge in recent years. This is because sensor nodes are battery powered and may be difficult to replace when deployed. Low energy adaptive clustering hierarchical (LEACH) routing protocol was proposed to prolong sensor nodes lifetime by dividing the network into clusters. In each cluster, a cluster head (CH) node receives and aggregates data from other nodes. However, CH nodes in LEACH are randomly elected which leads to a rapid loss of network energy. This energy loss occurs when the CH has a low energy level or when it is far from the BS. LEACH with two level cluster head (LEACH-TLCH) protocol deploys a secondary cluster head (2CH) to relieve the cluster head burden in these circumstances. However, in LEACH-TLCH the optimal distance of CH to base station (BS), and the choicest CH energy level for the 2CH to be deployed for achieving an optimal network lifetime was not considered. After a survey of related literature, we improved on LEACH-TLCH by investigating the conditions set to deploy the 2CH for an optimal network lifetime. Experiments were conducted to indicate how the 2CH impacts on the network at different CH energy levels and (or) CH distance to BS. This, is referred to as factor-based LEACH (FLEACH). Investigations in FLEACH show that as CHs gets farther from the BS, the use of a 2CH extends the network lifetime. Similarly, an increased lifetime also results as the CH energy decreases when the 2CH is deployed. We further propose FLEACH-E which uses a deterministic CH selection with the deployment of 2CH from the outset of network operation. Results show an improved performance over existing state-of-the-art homogeneous routing protocols.     

An intelligent and knowledge‐based overlapping clustering protocol for wireless sensor networks

Overlapping is one of the topics in wireless sensor networks that is considered by researchers in the last decades. An appropriate overlapping management system can prolong network lifetime and decrease network recovery time. This paper proposes an intelligent and knowledge‐based overlapping clustering protocol for wireless sensor networks, called IKOCP. This protocol uses some of the intelligent and knowledge‐based systems to construct a robust overlapping strategy for sensor networks. The overall network is partitioned to several regions by a proposed multicriteria decision‐making controller to monitor both small‐scale and large‐scale areas. Each region is managed by a sink, where the whole network is managed by a base station. The sensor nodes are categorized by various clusters using the low‐energy adaptive clustering hierarchy (LEACH)‐improved protocol in a way that the value of p is defined by a proposed support vector machine–based mechanism. A proposed fuzzy system determines that noncluster heads associate with several clusters in order to manage overlapping conditions over the network. Cluster heads are changed into clusters in a period by a suggested utility function. Since network lifetime should be prolonged and network traffic should be alleviated, a data aggregation mechanism is proposed to transmit only crucial data packets from cluster heads to sinks. Cluster heads apply a weighted criteria matrix to perform an inner‐cluster routing for transmitting data packets to sinks. Simulation results demonstrate that the proposed protocol surpasses the existing methods in terms of the number of alive nodes, network lifetime, average time to recover, dead time of first node, and dead time of last node.     

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

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

Fuzzy logic based unequal clustering for wireless sensor networks

The primary challenges in outlining and arranging the operations of wireless sensor networks are to enhance energy utilization and the system lifetime. Clustering is a powerful approach to arranging a system into an associated order, load adjusting and enhancing the system lifetime. In a cluster based network, cluster head closer to the sink depletes its energy quickly resulting in hot spot problems. To conquer this issue, numerous algorithms on unequal clustering are contemplated. The drawback in these algorithms is that the nodes which join with the specific cluster head bring overburden for the cluster head. So, we propose an algorithm called fuzzy based unequal clustering in this paper to enhance the execution of the current algorithms. The proposed work is assessed by utilizing simulation. The proposed algorithm is compared with two algorithms, one with an equivalent clustering algorithm called LEACH and another with an unequal clustering algorithm called EAUCF. The simulation results using MATLAB demonstrate that the proposed algorithm provides better performance compared to the other two algorithms.     

A novel residual energy‐based distributed clustering and routing approach for performance study of wireless sensor network

Non‐uniform energy consumption during operation of a cluster‐based routing protocol for large‐scale wireless sensor networks (WSN) is major area of concern. Unbalanced energy consumption in the wireless network results in early node death and reduces the network lifetime. This is because nodes near the sink are overloaded in terms of data traffic compared with the far away nodes resulting in node deaths. In this work, a novel residual energy–based distributed clustering and routing (REDCR) protocol has been proposed, which allows multi‐hop communication based on cuckoo‐search (CS) algorithm and low‐energy adaptive‐clustering–hierarchy (LEACH) protocol. LEACH protocol allows choice of possible cluster heads by rotation at every round of data transmission by a newly developed objective function based on residual energy of the nodes. The information about the location and energy of the nodes is forwarded to the sink node where CS algorithm is implemented to choose optimal number of cluster heads and their positions in the network. This approach helps in uniform distribution of the cluster heads throughout the network and enhances the network stability. Several case studies have been performed by varying the position of the base stations and by changing the number of nodes in the area of application. The proposed REDCR protocol shows significant improvement by an average of 15% for network throughput, 25% for network scalability, 30% for network stability, 33% for residual energy conservation, and 60% for network lifetime proving this approach to be more acceptable one in near future.     

An unequal cluster-based routing scheme for multi-level heterogeneous wireless sensor networks

In wireless sensor networks (WSNs), clustering can significantly reduce energy dissipation of nodes, and also increase communication load of cluster heads. When multi-hop communication model is adopted in clustering, “energy hole” problem may occur due to unbalanced energy consumption among cluster heads. Recently, many multi-hop clustering protocols have been proposed to solve this problem. And the main way is using unequal clustering to control the size of clusters. However, many of these protocols are about homogeneous networks and few are about heterogeneous networks. In this paper, we present an unequal cluster-based routing scheme for WSNs with multi-level energy heterogeneity called UCR-H. The sensor field is partitioned into a number of equal-size rectangular units. We first calculate the number of clusters in each unit by balancing energy consumption among the cluster heads in different units. And then we find the optimal number of units by minimizing the total energy consumption of inter-cluster forwarding. Finally, the size of clusters in each unit is elaborately designed based on node’s energy level and the number of clusters in this unit. And a threshold is also designed to avoid excessive punishment to the nodes with higher energy level. Simulation results show that our scheme effectively mitigates the “energy hole” problem and achieves an obvious improvement on the network lifetime.     

无线传感器网络模糊逻辑分簇路由协议

在无线传感器网络（Wireless Sensor Network,WSN）中,LEACH协议通过概率模型来选举簇头,由于没有考虑到传感器节点的分布情况和能量剩余等信息,可能会使得部分节点过早死亡.针对这一问题,提出基于模糊逻辑的分簇路由协议（DFLCP）.在预选簇头阶段,根据节点剩余能量等信息利用模糊逻辑计算出节点的竞争半径,使得簇头分布相对均匀;在簇头选举阶段,通过模糊逻辑确定节点成为簇头的概率.仿真结果表明：DFLCP协议可有效控制簇头节点的分布密度和簇的半径,均衡网络负载,延长节点平均生存时间.     

Fuzzy-based unequal clustering protocol for underwater wireless sensor networks

Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA.     

An Improved LEACH Routing Algorithm for Wireless Sensor Network

Optimization of energy consumption is major concern for the design and planning of wireless sensor networks (WSNs). Recent research has demonstrated that organizing nodes in clusters has higher energy efficiency. LEACH is the most popular routing protocol for cluster-based in WSNs, and FCM algorithm is used for the optimum number of the clusters and their location. Aiming at the shortcomings of LEACH and FCM-LEACH, which including inaccurate cluster centers, unreasonable clustering and sole data transmission mode. This paper proposes a new energy efficient routing algorithm (NF-LEACH). In the new algorithm, There are many factors have considered to prolong the network life cycle that they are the degree of membership, residual energy, base station distance and data transmission mode. Finally, the comparison among LEACH, FCM-LEACH, and NF-LEACH has been done. The results show that the NF-LEACH has the longest lifetime and the most evenly distributed amongst three algorithms.     

能量不均衡的传感器网络路由算法研究

结合实际应用中传感器网络能量分布不均衡的特点,分析了以低功耗自适应集簇分层型协议(Low Energy Adaptive Clustering Hierachy Protocol,LEACH)为代表的分簇路由协议存在的不足。在改进LEACH协议的基础上,提出了LEACH-SCE协议,并以二级能量异构网络为例通过MATLAB软件对协议的性能进行了仿真验证,仿真结果表明,通过优化高能节点的簇头选择概率,改进协议可以更加有效地利用网络能量,同等条件下,比LEACH协议的生存周期提高了31%,有效节约了网络成本。