Accelerated Particle Swarm Optimization Algorithm for Efficient Cluster Head Selection in WSN

Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embedded sensors working as the primary nodes,termed Wireless Sensor Networks(WSNs),in which numerous sensors are connected to at least one Base Station(BS).These sensors gather information from the environment and transmit it to a BS or gathering location.WSNs have several challenges,including throughput,energy usage,and network lifetime concerns.Different strategies have been applied to get over these restrictions.Clustering may,therefore,be thought of as the best way to solve such issues.Consequently,it is crucial to analyze effective Cluster Head(CH)selection to maximize efficiency throughput,extend the network lifetime,and minimize energy consumption.This paper proposed an Accelerated Particle Swarm Optimization(APSO)algorithm based on the Low Energy Adaptive Clustering Hierarchy(LEACH),Neighboring Based Energy Efficient Routing(NBEER),Cooperative Energy Efficient Routing(CEER),and Cooperative Relay Neighboring Based Energy Efficient Routing(CR-NBEER)techniques.With the help of APSO in the implementation of the WSN,the main methodology of this article has taken place.The simulation findings in this study demonstrated that the suggested approach uses less energy,with respective energy consumption ranges of 0.1441 to 0.013 for 5 CH,1.003 to 0.0521 for 10 CH,and 0.1734 to 0.0911 for 15 CH.The sending packets ratio was also raised for all three CH selection scenarios,increasing from 659 to 1730.The number of dead nodes likewise dropped for the given combination,falling between 71 and 66.The network lifetime was deemed to have risen based on the results found.A hybrid with a few valuable parameters can further improve the suggested APSO-based protocol.Similar to underwater,WSN can make use of the proposed protocol.The overall results have been evaluated and compared with the existing approaches of sensor networks.

Type II Fuzzy Logic Based Cluster Head Selection for Wireless Sensor Network

Wireless Sensor Network(WSN)forms an essential part of IoT.It is embedded in the target environment to observe the physical parameters based on the type of application.Sensor nodes inWSN are constrained by different features such as memory,bandwidth,energy,and its processing capabilities.In WSN,data transmission process consumes the maximum amount of energy than sensing and processing of the sensors.So,diverse clustering and data aggregation techniques are designed to achieve excellent energy efficiency in WSN.In this view,the current research article presents a novel Type II Fuzzy Logic-based Cluster Head selection with Low Complexity Data Aggregation(T2FLCH-LCDA)technique for WSN.The presented model involves a two-stage process such as clustering and data aggregation.Initially,three input parameters such as residual energy,distance to Base Station(BS),and node centrality are used in T2FLCH technique for CH selection and cluster construction.Besides,the LCDA technique which follows Dictionary Based Encoding(DBE)process is used to perform the data aggregation at CHs.Finally,the aggregated data is transmitted to the BS where it achieves energy efficiency.The experimental validation of the T2FLCH-LCDAtechnique was executed under three different scenarios based on the position of BS.The experimental results revealed that the T2FLCH-LCDA technique achieved maximum energy efficiency,lifetime,Compression Ratio(CR),and power saving than the compared methods.

Cluster Head Selection Algorithm for UAV Assisted Clustered IoT Network Utilizing Blockchain

To guarantee the security of Internet of Things(IoT)devices,the blockchain tech⁃nology is often applied to clustered IoT networks.However,cluster heads(CHs)need to un⁃dertake additional control tasks.For battery-powered IoT devices,the conventional CH se⁃lection algorithm is limited.Based on the above problem,an unmanned aerial vehicle(UAV)network assisted clustered IoT system is proposed,and a corresponding UAV CH se⁃lection algorithm is designed.In this scheme,UAVs are selected as CHs to serve IoT clus⁃ters.The proposed CH selection algorithm considers the maximal transmit power,residual energy and distance information of UAVs,which can greatly extend the working life of IoT clusters.Through Monte Carlo simulation,the key performance indexes of the system,in⁃cluding energy consumption,average secrecy rate and the maximal number of data packets received by the base station(BS),are evaluated.The simulation results show that the pro⁃posed algorithm has great advantages compared with the existing CH selection algorithms.

Optimization of Head Cluster Selection in WSN by Human-Based Optimization Techniques

Wireless sensor networks(WSNs)are characterized by their ability to monitor physical or chemical phenomena in a static or dynamic location by collecting data,and transmit it in a collaborative manner to one or more processing centers wirelessly using a routing protocol.Energy dissipation is one of the most challenging issues due to the limited power supply at the sensor node.All routing protocols are large consumers of energy,as they represent the main source of energy cost through data exchange operation.Clusterbased hierarchical routing algorithms are known for their good performance in energy conservation during active data exchange in WSNs.The most common of this type of protocol is the Low-Energy Adaptive Clustering Hierarchy(LEACH),which suffers from the problem of the pseudo-random selection of cluster head resulting in large power dissipation.This critical issue can be addressed by using an optimization algorithm to improve the LEACH cluster heads selection process,thus increasing the network lifespan.This paper proposes the LEACH-CHIO,a centralized cluster-based energyaware protocol based on the Coronavirus Herd Immunity Optimizer(CHIO)algorithm.CHIO is a newly emerging human-based optimization algorithm that is expected to achieve significant improvement in the LEACH cluster heads selection process.LEACH-CHIO is implemented and its performance is verified by simulating different wireless sensor network scenarios,which consist of a variable number of nodes ranging from 20 to 100.To evaluate the algorithm performances,three evaluation indicators have been examined,namely,power consumption,number of live nodes,and number of incoming packets.The simulation results demonstrated the superiority of the proposed protocol over basic LEACH protocol for the three indicators.

Design of QoS Aware Routing Protocol for IoT Assisted Clustered WSN

In current days,the domain of Internet of Things(IoT)and Wireless Sensor Networks(WSN)are combined for enhancing the sensor related data transmission in the forthcoming networking applications.Clustering and routing techniques are treated as the effective methods highly used to attain reduced energy consumption and lengthen the lifetime of the WSN assisted IoT networks.In this view,this paper presents an Ensemble of Metaheuristic Optimization based QoS aware Clustering with Multihop Routing(EMOQoSCMR)Protocol for IoT assisted WSN.The proposed EMO-QoSCMR protocol aims to achieve QoS parameters such as energy,throughput,delay,and lifetime.The proposed model involves two stage processes namely clustering and routing.Firstly,the EMO-QoSCMR protocol involves crossentropy rain optimization algorithm based clustering(CEROAC)technique to select an optimal set of cluster heads(CHs)and construct clusters.Besides,oppositional chaos game optimization based routing(OCGOR)technique is employed for the optimal set of routes in the IoT assisted WSN.The proposed model derives a fitness function based on the parameters involved in the IoT nodes such as residual energy,distance to sink node,etc.The proposed EMOQoSCMR technique has resulted to an enhanced NAN of 64 nodes whereas the LEACH,PSO-ECHS,E-OEERP,and iCSHS methods have resulted in a lesser NAN of 2,10,42,and 51 rounds.The performance of the presented protocol has been evaluated interms of energy efficiency and network lifetime.

A Novel Improved Artificial Bee Colony and Blockchain-Based Secure Clustering Routing Scheme for FANET

Flying Ad hoc Network(FANET)has drawn significant consideration due to its rapid advancements and extensive use in civil applications.However,the characteristics of FANET including high mobility,limited resources,and distributed nature,have posed a new challenge to develop a secure and ef-ficient routing scheme for FANET.To overcome these challenges,this paper proposes a novel cluster based secure routing scheme,which aims to solve the routing and data security problem of FANET.In this scheme,the optimal cluster head selection is based on residual energy,online time,reputation,blockchain transactions,mobility,and connectivity by using Improved Artificial Bee Colony Optimization(IABC).The proposed IABC utilizes two different search equations for employee bee and onlooker bee to enhance convergence rate and exploitation abilities.Further,a lightweight blockchain consensus algorithm,AI-Proof of Witness Consensus Algorithm(AI-PoWCA)is proposed,which utilizes the optimal cluster head for mining.In AI-PoWCA,the concept of the witness for block verification is also involved to make the proposed scheme resource efficient and highly resilient against 51%attack.Simulation results demonstrate that the proposed scheme outperforms its counterparts and achieves up to 90%packet delivery ratio,lowest end-to-end delay,highest throughput,resilience against security attacks,and superior in block processing time.

A Novel Energy Aware Clustering Technique for Routing in Wireless Sensor Networks

Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.

Hybrid Marine Predators Optimization and Improved Particle Swarm Optimization-Based Optimal Cluster Routing in Wireless Sensor Networks(WSNs)

Wireless Sensor Networks(WSNs)play an indispensable role in the lives of human beings in the fields of environment monitoring,manufacturing,education,agriculture etc.,However,the batteries in the sensor node under deployment in an unattended or remote area cannot be replaced because of their wireless existence.In this context,several researchers have contributed diversified number of cluster-based routing schemes that concentrate on the objective of extending node survival time.However,there still exists a room for improvement in Cluster Head(CH)selection based on the integration of critical parameters.The meta-heuristic methods that concentrate on guaranteeing both CH selection and data transmission for improving optimal network performance are predominant.In this paper,a hybrid Marine Predators Optimization and Improved Particle Swarm Optimizationbased Optimal Cluster Routing(MPO-IPSO-OCR)is proposed for ensuring both efficient CH selection and data transmission.The robust characteristic of MPOA is used in optimized CH selection,while improved PSO is used for determining the optimized route to ensure sink mobility.In specific,a strategy of position update is included in the improved PSO for enhancing the global searching efficiency of MPOA.The high-speed ratio,unit speed rate and low speed rate strategy inherited by MPOA facilitate better exploitation by preventing solution from being struck into local optimality point.The simulation investigation and statistical results confirm that the proposed MPOIPSO-OCR is capable of improving the energy stability by 21.28%,prolonging network lifetime by 18.62%and offering maximum throughput by 16.79%when compared to the benchmarked cluster-based routing schemes.

A LEACH-Head Expected Frequency Appraisal Algorithm for Water-Environment Monitoring Networks

Water-environment monitoring network (WMN) is a wireless sensor network based real-time system, which collects, transmits, analyzes and processes water-environment parameters in large area. Both cluster selection mechanisms and energy saving strategies play an important role on designing network routing protocols for the WMN. Since those existing routing algorithms can not be used directly in the WMN, we thus propose an improved version of LEACH, a LEACH-Head Expected Frequency Appraisal (LEACH-HEFA) algorithm, for the WMN in this paper. Simulation results show that the LEACH-HEFA can balance the energy consumption of nodes, rationalize the clustering process and prolong the network lifetime significantly in the WMN. It indicates that the LEACH-HEFA is suitable to the WMN.

基于扇形链路策略的改进蚁群分簇路由协议

针对网络覆盖区域较大、节点数量较多的无线传感器网络,容易出现部分节点过早死亡等情况,提出一种基于扇形链路策略的改进蚁群分簇路由协议RACO-SL。通过加入奖惩因子,同时对精英个体采用蚁群优化算法的概率生成新的后代个体,对于普通个体,通过与随机选择的精英个体进行交叉变异操作,改进蚁群优化算法,以整个网络每次通信的能耗为优化目标选取较优的簇头节点集。为待转发簇头节点设计从可动态调节的扇形区域中选择下一跳中继节点的链路转发策略。实验结果表明,与现有协议相比,该协议在延长网络寿命、提高通信链路质量、增强网络覆盖度方面表现良好。

边缘计算中支持分簇编排的应用缓存方法研究

移动边缘计算通过在距离终端更近的位置提供计算存储服务来提供更优的任务处理表现.为减少系统通信链路压力,进一步优化任务处理时延和能耗,本文首先提出了一种支持位置更新的分布式分簇编排策略,对通信区域进行分簇和簇头选取,簇头作为编排节点进行簇内管理,当有卸载任务时寻找最佳执行设备进行处理;然后基于Docker容器提出应用程序协作缓存算法,通过在存储资源丰富的设备中提前部署高频拉取的应用程序来降低任务部署延迟,从而进一步降低任务处理延迟;最后应用多接入边缘计算仿真平台进行对比实验,结果表明提出的分簇编排策略和协作缓存算法可以有效降低网络和CPU占用率,获得超低任务部署和完成时延,显著提高服务质量,并显示出强可扩展性.

基于多跳分簇算法的异构融合通信网络节点负载均衡方法

针对网络节点负载不均衡、节点能量消耗较大、网络吞吐量较低的问题,提出基于多跳分簇算法的异构融合通信网络节点负载均衡方法。依据异构融合通信网络实时(RT)和非实时(NRT)业务的服务质量满意度,应用效用函数结合三角模融合算子,将重载网络通信业务转移至轻载网络,实现异构融合通信网络业务负载均衡;运用多跳分簇路由算法,依据节点位置和其所剩能量选取簇头,通过减少网络边缘的簇头数量,节省网络能量消耗,通过簇头节点剩余能量和链路权值大小选取下一路由,构建簇间路由通信机制,实现异构融合通信网络节点负载均衡。在实验验证方面,在5.5×15^(3)个周期时,存货节点为0,吞吐量最高可达到13.5×15^(4)bit,出色地完成异构融合通信网络节点负载均衡,合理选取簇头节点,减少节点能量的消耗,提升节点生存周期和网络吞吐量。

基于秘密分享的无线传感器网络多维数据安全聚合方案

无线传感器网络中的安全数据聚合方案旨在保护数据隐私、降低系统能耗,从而延长网络的生命周期。针对目前多维无线传感器网络中数据传输安全性不高、数据传输中的能量消耗过大等问题,提出一种基于阈值可变秘密分享的多维数据聚合方案(TCSSMDA)。首先,在本方案中,网络簇头的选择主要是依据网络节点的剩余能量以及其与基站的距离。同时,为了降低多维数据传输的能量消耗,使用预设值对多维传感器发送数据机制进行优化。最后,为了保证传感器的数据安全,使用设计了一种轻量级、高效通信的信息加密方式。安全性分析与模拟结果表明,所提出的方案在降低数据包大小、节点通信成本以及提升网络数据安全性和生存时间方面都表现出了较好的性能。

无人机自组织网络的簇头选择机制研究

近年来,为了适应日益复杂的无人机工作场景,多无人机系统应运而生,该系统依托无人机自组织网络(UAV Ad Hoc Network,UAVNET)实现,UAVNET设计能够直接影响多无人机系统的综合性能,因此,对UAVNET设计进行研究具有一定现实意义。簇头无人机需要承担维护分簇结构、协助簇间通信等任务,存在综合能耗相对较高的缺陷。本文以UAVNET设计中的簇头无人机能耗优化问题为研究对象,提出了GEDQN簇头选择算法,经过验证,本文提出的智能簇头选择机制能够在一定程度上减少簇头无人机的综合能耗。

智慧园区无线传感网络能量均衡覆盖优化系统

针对传统LEACH协议存在数据传输效率较低以及节点能量分布不均的缺陷,文中从功耗和效率层面出发,提出了一种无线传感网络能量均衡覆盖优化系统。对于节点能量分布不均的问题,设计了由剩余能量因子与距离因子所组成的系统权重因子,并根据该因子及竞争半径来选择簇头。同时基于遗传算法提出了一种单链多跳路由协议,进而提升了系统的功耗水平,解决了数据传输效率偏低的问题。以某智慧园区为模型进行的实验测试结果表明,所设计系统的存活节点个数、系统剩余能量以及数据包接收数量这三个指标均大幅领先,充分说明了改进后的算法能够有效减少系统的能量损耗并提升节点的利用率,使其可以存活至1200轮,从而延长整个WSN系统的运行周期。

一种主从式卫星集群的星间组网系统设计

为解决主从式卫星集群在离散稀疏拓扑下的组网通信问题,保障其星间实时交互遥控遥测及任务信息的需求,根据主从式卫星集群的分层、分簇的空间拓扑特点,本文提出了一套通信系统架构和星间组网协议栈的设计方案。首先,在网络层的设计上,给出了网络层的数据结构、基于多权重优先级代价函数的子网簇首选择备份机制以及子星建网入网的流程;其次,在数据链路层,根据分包遥控和分包遥测体制按照层次化对数据进行处理;然后,在物理层的设计中采用扩跳频作为星间链路的通信体制,采用时分多址方式实现卫星集群的多用户通信,并给出了星间链路的具体通信指标;最后,对星间通信进行了链路计算,计算结果表明物理层设计满足各星通信需求。

一种基于能量预测的无线传感器网络分簇算法

为了解决无线传感器网络能量有效利用的问题,提出一种利用能量预测选择簇头节点的分簇算法:CHEP利用文中建立的传感器节点工作状态转换模型,CHEP算法将所得的剩余能量预测参数作为考虑因素引入阀值的计算,从而使高剩余能量且能耗较慢的节点能够在每一轮中被优先选为簇头节点.通过仿真实验,将CHEP与其他分簇算法进行分析和比较,验证了CHEP算法中能量预测机制以及阀值改进的有效性.结果表明CHEP能够更好地平衡网络负载,延长网络寿命.

无线传感器网络中一种能量自适应的簇首选择机制

提出一种能量自适应的簇首选择机制.算法通过综合考虑候选节点的剩余能量级、通信能量损耗等参数来优化簇首的选择,从而有效地避免了低能量节点被选为簇首的可能性,进一步保证网络内节点能量负载的均衡性.仿真结果表明,改进的簇首选择机制能够很好地均衡网络能量损耗分布,有效延长近30%的网络生存时间.*

基于节点信任的LEACH协议簇头选举改进算法

针对LEACH协议在选举簇头时没有考虑到节点的信任值和节点的剩余能量,提出了一种新的簇头选举改进算法,即在数据传输阶段同时计算节点的信任值,为下一轮选举簇头节点作参考,从而在相对延长了网络寿命的同时确保了数据的可靠性,加强了网络的安全。由于在计算节点的信任值过程中已包含节点,故不需要额外考虑节点的剩余能量。仿真结果表明,改进后的算法不仅在网络寿命上要优于LEACH算法,同时在安全性能分析上也优于LEACH协议。

基于最优簇首数划分单元格的改进GAF算法

为构造良好的拓扑结构,降低节点能耗,延长网络生存期,对传统的GAF算法进行了改进。改进算法中考虑到连通度和最优簇首数的问题,提出了新的虚拟单元格划分方法。在簇首选择阶段,不仅考虑到节点剩余能量及节点距基站的距离,还考虑到节点吞吐率的问题,并通过定义簇首选择函数来进行簇首选择。仿真结果显示,改进的GAF算法有效地节省了节点能耗,延长了网络生存期。该算法的各项性能均优于传统的GAF算法。