Hybrid Power Bank Deployment Model for Energy Supply Coverage Optimization in Industrial Wireless Sensor Network

Energy supply is one of the most critical challenges of wireless sensor networks(WSNs)and industrial wireless sensor networks(IWSNs).While research on coverage optimization problem(COP)centers on the network’s monitoring coverage,this research focuses on the power banks’energy supply coverage.The study of 2-D and 3-D spaces is typical in IWSN,with the realistic environment being more complex with obstacles(i.e.,machines).A 3-D surface is the field of interest(FOI)in this work with the established hybrid power bank deployment model for the energy supply COP optimization of IWSN.The hybrid power bank deployment model is highly adaptive and flexible for new or existing plants already using the IWSN system.The model improves the power supply to a more considerable extent with the least number of power bank deployments.The main innovation in this work is the utilization of a more practical surface model with obstacles and training while improving the convergence speed and quality of the heuristic algorithm.An overall probabilistic coverage rate analysis of every point on the FOI is provided,not limiting the scope to target points or areas.Bresenham’s algorithm is extended from 2-D to 3-D surface to enhance the probabilistic covering model for coverage measurement.A dynamic search strategy(DSS)is proposed to modify the artificial bee colony(ABC)and balance the exploration and exploitation ability for better convergence toward eliminating NP-hard deployment problems.Further,the cellular automata(CA)is utilized to enhance the convergence speed.The case study based on two typical FOI in the IWSN shows that the CA scheme effectively speeds up the optimization process.Comparative experiments are conducted on four benchmark functions to validate the effectiveness of the proposed method.The experimental results show that the proposed algorithm outperforms the ABC and gbest-guided ABC(GABC)algorithms.The results show that the proposed energy coverage optimization method based on the hybrid power bank deployment model generates more accurate results than the results obtained by similar algorithms(i.e.,ABC,GABC).The proposed model is,therefore,effective and efficient for optimization in the IWSN.

Development of an Artificial Fish Swarm Algorithm Based on aWireless Sensor Networks in a Hydrodynamic Background

The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor network(WSN)in a hydrodynamic background.The nodes of this algorithm are viscous fluids and artificial fish,while related‘events’are directly connected to the food available in the related virtual environment.The results show that the total processing time of the data by the source node is 6.661 ms,of which the processing time of crosstalk data is 3.789 ms,accounting for 56.89%.The total processing time of the data by the relay node is 15.492 ms,of which the system scheduling and the Carrier Sense Multiple Access(CSMA)rollback time of the forwarding is 8.922 ms,accounting for 57.59%.The total time for the data processing of the receiving node is 11.835 ms,of which the processing time of crosstalk data is 3.791 ms,accounting for 32.02%;the serial data processing time is 4.542 ms,accounting for 38.36%.Crosstalk packets occupy a certain amount of system overhead in the internal communication of nodes,which is one of the causes of node-level congestion.We show that optimizing the crosstalk phenomenon can alleviate the internal congestion of nodes to some extent.

An immune-swarm intelligence based algorithm for deterministic coverage problems of wireless sensor networks

A novel immune-swarm intelligence (ISI) based algorithm for solving the deterministic coverage problems of wireless sensor networks was presented.It makes full use of information sharing and retains diversity from the principle of particle swarm optimization (PSO) and artificial immune system (AIS).The algorithm was analyzed in detail and proper swarm size,evolving generations,gene-exchange individual order,and gene-exchange proportion in molecule were obtained for better algorithm performances.According to the test results,the appropriate parameters are about 50 swarm individuals,over 3 000 evolving generations,20%-25% gene-exchange proportion in molecule with gene-exchange taking place between better fitness affinity individuals.The algorithm is practical and effective in maximizing the coverage probability with given number of sensors and minimizing sensor numbers with required coverage probability in sensor placement.It can reach a better result quickly,especially with the proper calculation parameters.

On Layout Optimization of Wireless Sensor Network Using Meta-Heuristic Approach

One of the important research issues in wireless sensor networks(WSNs)is the optimal layout designing for the deployment of sensor nodes.It directly affects the quality of monitoring,cost,and detection capability of WSNs.Layout optimization is an NP-hard combinatorial problem,which requires optimization of multiple competing objectives like cost,coverage,connectivity,lifetime,load balancing,and energy consumption of sensor nodes.In the last decade,several meta-heuristic optimization techniques have been proposed to solve this problem,such as genetic algorithms(GA)and particle swarm optimization(PSO).However,these approaches either provided computationally expensive solutions or covered a limited number of objectives,which are combinations of area coverage,the number of sensor nodes,energy consumption,and lifetime.In this study,a meta-heuristic multi-objective firefly algorithm(MOFA)is presented to solve the layout optimization problem.Here,the main goal is to cover a number of objectives related to optimal layouts of homogeneous WSNs,which includes coverage,connectivity,lifetime,energy consumption and the number of sensor nodes.Simulation results showed that MOFA created optimal Pareto front of non-dominated solutions with better hyper-volumes and spread of solutions,in comparison to multi-objective genetic algorithms(IBEA,NSGA-II)and particle swarm optimizers(OMOPSO,SMOPSO).Therefore,MOFA can be used in real-time deployment applications of large-scale WSNs to enhance their detection capability and quality of monitoring.

A Novel Approach Based on Hybrid Algorithm for Energy Efficient Cluster Head Identification in Wireless Sensor Networks

The Wireless Sensor Networks(WSN)is a self-organizing network with random deployment of wireless nodes that connects each other for effective monitoring and data transmission.The clustering technique employed to group the collection of nodes for data transmission and each node is assigned with a cluster head.The major concern with the identification of the cluster head is the consideration of energy consumption and hence this paper proposes an hybrid model which forms an energy efficient cluster head in the Wireless Sensor Network.The proposed model is a hybridization of Glowworm Swarm Optimization(GSO)and Artificial Bee Colony(ABC)algorithm for the better identification of cluster head.The performance of the proposed model is compared with the existing techniques and an energy analysis is performed and is proved to be more efficient than the existing model with normalized energy of 5.35%better value and reduction of time complexity upto 1.46%.Above all,the proposed model is 16%ahead of alive node count when compared with the existing methodologies.

改进流向算法的无线传感器网络覆盖优化

针对标准流向算法易陷入局部最优和收敛精度低等问题,提出一种融合莱维(Levy)飞行和入侵杂草策略的改进流向算法.首先,该算法在选择水流流向时引入Levy飞行机制,使水流沿最优水流位置方向做Levy飞行运动,避免陷入局部最优;其次,利用入侵杂草策略,对每一代水流进行繁殖、空间扩散和竞争操作,增加水流的多样性,扩大搜索范围,提高全局寻优能力.最后,将改进流向算法应用于无线传感器网络覆盖优化中,并与标准流向算法及其他改进算法进行实验对比.仿真结果表明,相比标准流向算法及其他改进算法,所提改进流向算法的覆盖性能有大幅提升,覆盖率可达98.52%,可实现更均匀的节点分布和更低的部署成本.

基于TCPSO的三维无线传感器网络覆盖

针对三维无线传感器网络(3D WSNs)的节点部署问题,提出了一种基于双层混沌粒子群优化(TCPSO)算法的解决方案。利用TCPSO算法对节点进行优化部署,以提高网络的空间覆盖率。TCPSO算法通过非线性分类系数将种群分为精英种群和普通种群,分别采取不同的速度、位置更新公式进行迭代优化。TCPSO提出了基于Logistic混沌映射的递减惯性权重,用来控制算法在局部的开发,并且为了避免算法早熟,引入了Levy飞行策略增强算法的全局搜索能力。通过在1个三维网格空间中进行仿真实验,验证TCPSO以及粒子群优化(PSO)算法解决3D WSNs的节点部署问题的能力。分别在不同数量的节点数、不同的通信半径以及不同的种群规模上进行了3组实验,实验采用控制变量法,观察在不同条件下TCPSO的性能。TCPSO在全部的实验中提出的节点部署方案均明显优于PSO的部署方案。

基于改进AFSA算法的智慧农业监测网络研究

智慧化农业监测实际上是将无线传感器网络应用于农业监测场景中实时采集农田、气象、养殖等方面的数据。多个微小型嵌入式系统相互协作共同构成无线传感器网络,可实时监测、感知、收集和处理环境信息,并以无线通信方式进行信息交互。无线传感器网络覆盖是无线传感器网络监测的基础,直接影响网络感知质量。建立了面向农业场景的无线传感器网络覆盖问题模型,提出了一种基于改进人工鱼群算法的覆盖优化策略,提高了网络覆盖率和算法收敛性,得到最优网络传感器节点覆盖。

基于邻居信息的无线传感网络节点覆盖优化方法

无线传感网络的冗余节点会导致网络节点覆盖不均匀,为了提升无线传感网络节点覆盖效果,提出基于邻居信息的无线传感网络节点覆盖优化方法。利用邻居信息获取网络节点与邻居节点的距离、能量及覆盖率,根据获取结果判断无线传感网络中是否存有冗余节点,若存有冗余,则需要对节点实施休眠处理,以此降低节点能耗。基于处理结果建立无线传感网络覆盖模型,令网络节点在网络中均匀分布,并采用粒子群算法优化模型,使粒子能够不断迭代更新自身位置及速度,达到网络节点覆盖率最大化的目的,实现网络节点覆盖优化。实验结果表明,所提方法的无线传感网络节点覆盖率和收敛性分别高达97%和98.4%,能够有效实现网络节点部署,确保无线传感网络节点覆盖效果。

多策略增强樽海鞘算法下的WSN覆盖优化

为了提高无线传感器网络(wireless sensor network,WSN)的节点覆盖率,提出一种多策略增强的樽海鞘优化算法(enhanced salp swarm algorithm,ESSA)。首先使用Halton序列代替随机序列生成个体的初始化位置,避免随机点之间间隙过大或重叠;其次引入新的非线性收敛因子,加速收敛。最后采用柯西变异机制,增加个体的多样性,促使个体快速跳出局部最优点。将该算法应用到无线传感器网络覆盖优化问题上,并与其他优化方法对比,ESSA表现出更快的收敛速度和更高的覆盖率。

基于萤火虫群优化算法的无线传感器网络覆盖优化

无线传感器网络加速了无线通信的发展,无线网络覆盖率的高低可直接影响网络的性能。为改善传感器节点随机分布时的不合理部署问题以提高网络覆盖率,提出一种相对较优的无线传感器网络覆盖算法。针对粒子群优化(particle swarm optimization,PSO)算法局部搜索能力存在不足、容易陷入局部极值点、无法得到最优结果的问题,引入局部搜索能力较强的萤火虫群优化(glowworm swarm optimization,GSO)算法,实现网络有效覆盖率的提高,对节点实现快速覆盖。最后通过实验验证,结果表明,提出的改进GSO(improved GSO,IGSO)算法相较于传统鲸鱼优化算法(whale optimization algorithm,WOA)、PSO算法在网络覆盖率上有较大提升。

基于人工鱼群算法的dv-hop定位算法改进研究

随着无线网络传感器在各行各业的广泛应用,实际应用场景中的许多问题逐渐浮现出来,尤其是定位算法缺陷。文章主要从无线传感器定位的dv-hop算法局限性出发,指出其用跳段距离代替直线距离的显著缺点,并基于各项研究,提出应用人工鱼群算法的全局密集网络特点对dv-hop定位算法进行改进。经验证,基于人工鱼群算法改进后的dv-hop定位算法能显著弱化无线传感器节点定位误差大,减少节点硬件开销,提升无线传感器的定位精度和效率。

基于改进PSO算法的传感器网络覆盖优化

当无线传感器网络(wireless sensor network,WSN)采用概率覆盖模型时,难以采用几何方法进行网络覆盖率的优化。针对这一问题,通过提出一种改进粒子群优化(particle swarm optimization,PSO)算法,有效提高了WSN网络的覆盖率。首先对粒子越界处理的方法进行推了广,提高了其适用范围;其次,针对PSO算法容易陷入局部最优解的问题,通过对粒子探索能力进行增强,提出了一种探索能力增强型PSO(explorative capability enhancement PSO,ECE-PSO)算法,有效改善了种群陷入局部最优解的缺点。基于概率覆盖模型的WSN覆盖优化的仿真验证表明,ECE-PSO算法显著提高了解的质量,有效改善了算法收敛于局部最优解的缺点,且ECEPSO算法具有较强的稳定性。

基于改进鱼群算法的WSN覆盖优化策略

本文提出了一种基于改进人工鱼群算法的无线传感器网络覆盖优化策略.通过对人工鱼群视野范围和步长的自适应调整,提高了算法的寻优精度、收敛速度以及稳定性;再结合WSN网络覆盖的性能,使网络覆盖得以优化.仿真结果表明,改进的人工鱼群算法优化的网络覆盖率比基本人工鱼群算法的网络覆盖率提高了17%.

基于鱼群算法的无线传感网络覆盖优化策略

无线传感网络是能量受限的网络,有效覆盖和能耗是衡量其性能的两个重要指标。将最大化网络覆盖率和最小化工作节点数作为网络优化目标,建立了网络覆盖优化的数学模型,并利用鱼群算法并行寻优、收敛快速的特性,提出了一种基于鱼群算法的覆盖优化策略。仿真实验表明,该算法能求解最优覆盖工作节点,并可以改进网络节点调度的实时性。

基于水波优化算法的无线传感器网络覆盖研究

为了提高无线传感器网络(WSN)覆盖的有效性,提高传感节点对目标区域的覆盖率,采用水波优化(WWO)算法对传感节点部署坐标进行优化。首先,根据区域像素点及目标节点数量初始化传感节点坐标集,根据传感节点坐标和目标节点坐标、区域像素大小计算区域覆盖率;然后,将区域覆盖率作为适应度函数,建立WWO算法模型,将初始传感节点集作为WWO输入集,通过水波的传播、折射和碎波操作不断更新水波位置,同时求解各水波的适应度值;最后,选择适应度值最高的水波个体作为传感节点分布的最优解,当区域覆盖率或水波更新迭代次数达到阈值时,输出最优水波个体。分别采用蚁群、人工鱼群、粒子群优化算法和该文算法进行覆盖性能仿真。在覆盖率方面,该文算法最优,达到稳定时可以获得约95%的区域覆盖率,粒子群次之,蚁群算法最差。在收敛性能方面,蚁群算法最快,该文算法次之。

基于改进萤火虫优化算法的WSN覆盖优化分析

对改进萤火虫算法性能及其在WSNs网络覆盖优化中的应用问题进行了研究。分析了基本萤火虫算法的全局收敛性,针对其收敛效率低的缺陷,给出了算法改进策略,并证明了改进的萤火虫算法以概率1收敛于全局最优解,在此基础上,提出了基于萤火虫优化的网络覆盖算法,建立了以网络均匀度及网络覆盖率为准则的数学模型,推导了节点冗余度与网络覆盖率之间的关系,给出了节点休眠策略,并将节点部署划分成不同的阶段,在每个阶段,分别采用改进的萤火虫算法对模型进行求解,进而得到无线传感器网络最优覆盖,最后对经典测试函数和WSNs网络覆盖问题进行实验仿真,仿真结果表明改进的算法具有更加理想的运算结果,而且能有效地给出WSNs网络覆盖优化方案。

基于人工鱼群算法的无线传感器网络覆盖优化

针对网络节点严重冗余而导致的网络成本增加、生命周期过短等缺陷,提了一种基于人工鱼群算法的覆盖优化方法。首先以节点的利用率和网络有效覆盖率作为优化目标,建立相应的数学模型,然后采用人工鱼群算法对模型进行求解,得到无线传感器网络的最优覆盖方案。仿真结果表明,人工鱼群算法提高了无线传感器网络节点的覆盖率,减少了传感器节点冗余,有效降低了网络成本,网络生存时间得到了延长。

基于混沌粒子群算法的无线传感器网络覆盖优化

为了改善传感器节点随机部署时的不合理分布,提高网络覆盖率,以网络覆盖率为优化目标,提出了基于混沌粒子群的无线传感器网络覆盖优化算法。该算法利用混沌运动的遍历性和随机性,克服了粒子群算法后期陷入局部最优的缺点。仿真结果表明,该算法比基本粒子群算法具有更好的覆盖优化效果。

基于改进粒子群算法的WSN覆盖优化策略

为了实现WSN覆盖范围的最大化,延长网络寿命,在标准粒子群算法的基础上提出了一种无线传感器网络覆盖优化策略。通过粒子分簇并行搜索,采取碰撞理论使陷入局部最优的粒子迅速跳出,有效地避免了标准粒子群算法容易出现的早熟问题,提高了算法的稳定性。通过仿真实验分析了分簇数和碰撞阈值对覆盖性能指标的影响,仿真实验结果表明,基于碰撞理论的分簇粒子群算法覆盖策略有效地优化了网络的覆盖性能。