Multi-sink Deployment Strategy for Wireless Sensor Networks Based on Improved Particle Swarm Clustering Optimization Algorithm

In wireless sensor networks(WSNs) with single sink,the nodes close to the sink consume their energy too fast due to transferring a large number of data packages,resulting in the "energy hole" problem.Deploying multiple sink nodes in WSNs is an effective strategy to solve this problem.A multi-sink deployment strategy based on improved particle swarm clustering optimization(IPSCO) algorithm for WSNs is proposed in this paper.The IPSCO algorithm is a combination of the improved particle swarm optimization(PSO) algorithm and K-means clustering algorithm.According to the sink nodes number K,the IPSCO algorithm divides the sensor nodes in the whole network area into K clusters based on the distance between them,making the total within-class scatter to minimum,and outputs the center of each cluster.Then,multiple sink nodes in the center of each cluster can be deployed,to achieve the effects of partition network reasonably and deploy multi-sink nodes optimally.The simulation results show that the deployment strategy can prolong the network lifetime.

Particle swarm optimization computer simulation of Ni clusters

The stable structures and energies of Ni clusters were investigated using particle swarm optimization(PSO)combined with simulated annealing(SA).Sutton-Chen many-body potential was used in describing the interatomic interactions.The simulation results indicate that the structures of Ni clusters are icosahedral-like and binding energy per atom tends to approach that of bulk materials when the atoms number increases.The stability of Ni clusters depends not only on size but also on symmetrical characterization.The structure stability of Nin clusters increases with the increase of total atom number n.It is also found that there exists direct correlation between stability and geometrical structures of the clusters,and relatively higher symmetry clusters are more stable.From the results of the second difference in the binding energy,the clusters at n=3 is more stable than others,and the magic numbers effect is also found.

A new-style clustering algorithm based on swarm intelligent theory

Traditional clustering algorithms generally have some problems, such as the sensitivity to initializing parameter, difficulty in finding out the optimization clustering result and the validity of clustering. In this paper, a FSM and a mathematic model of a new-style clustering algorithm based on the swarm intelligence are provided. In this algorithm, the clustering main body moves in a three-dimensional space and has the abilities of memory, communication, analysis, judgment and coordinating information. Experimental results conform that this algorithm has many merits such as insensitive to the order of the data, capable of dealing with exceptional, high-dimension or complicated data. The algorithm can be used in the fields of Web mining, incremental clustering, economic analysis, pattern recognition, document classification and so on.

Particle Swarm Optimized Optimal Threshold Value Selection for Clustering based on Correlation Fractal Dimension

The work on the paper is focused on the use of Fractal Dimension in clustering for evolving data streams. Recently Anuradha et al. proposed a new approach based on Relative Change in Fractal Dimension (RCFD) and damped window model for clustering evolving data streams. Through observations on the aforementioned referred paper, this paper reveals that the formation of quality cluster is heavily predominant on the suitable selection of threshold value. In the above-mentionedpaper Anuradha et al. have used a heuristic approach for fixing the threshold value. Although the outcome of the approach is acceptable, however, the approach is purely based on random selection and has no basis to claim the acceptability in general. In this paper a novel method is proposed to optimally compute threshold value using a population based randomized approach known as particle swarm optimization (PSO). Simulations are done on two huge data sets KDD Cup 1999 data set and the Forest Covertype data set and the results of the cluster quality are compared with the fixed approach. The comparison reveals that the chosen value of threshold by Anuradha et al., is robust and can be used with confidence.

Application of PP cluster method in the earthquake swarm analysis

Taking 98 earthquake swarms occurred in Xinjiang during 1972-1992 as examples,and & parameters (e. g. U,K, p and the maximum energy rate of earthquake sequence etc.)as the characteristic quantity in earthquakeswarrn pattern observation, the author made a numerical cluster by PP cluster analysis method. The results indicate that those 98 earthquake swarms can be divided into 4 types as A, B, C, D. There are 24 swarms in typeA, among which strong shocks occur nearby after 18 swarms in the coming 12 months.Among 61 earthquakeswarms in type C and D, strong shocks occur nearby only after 7 swarms in the same time period. The occurrence rate of strong shocks only takes 3/11 in type B swarms. No doubt, PP cluster analysis method can effectively distinguish precursory swarms (type A) and correctly judge the short-and medium-term trend in the areaaround the earthquake swarms. Being a new and useful classification, PP cluster provides a wide application tothe identification of the type of earthquake sequence.

Design of Clustering Techniques in Cognitive Radio Sensor Networks

In recent decades,several optimization algorithms have been developed for selecting the most energy efficient clusters in order to save power during trans-mission to a shorter distance while restricting the Primary Users(PUs)interfer-ence.The Cognitive Radio(CR)system is based on the Adaptive Swarm Distributed Intelligent based Clustering algorithm(ASDIC)that shows better spectrum sensing among group of multiusers in terms of sensing error,power sav-ing,and convergence time.In this research paper,the proposed ASDIC algorithm develops better energy efficient distributed cluster based sensing with the optimal number of clusters on their connectivity.In this research,multiple random Sec-ondary Users(SUs),and PUs are considered for implementation.Hence,the pro-posed ASDIC algorithm improved the convergence speed by combining the multi-users clustered communication compared to the existing optimization algo-rithms.Experimental results showed that the proposed ASDIC algorithm reduced the node power of 9.646%compared to the existing algorithms.Similarly,ASDIC algorithm reduced 24.23%of SUs average node power compared to the existing algorithms.Probability of detection is higher by reducing the Signal-to-Noise Ratio(SNR)to 2 dB values.The proposed ASDIC delivers low false alarm rate compared to other existing optimization algorithms in the primary detection.Simulation results showed that the proposed ASDIC algorithm effectively solves the multimodal optimization problems and maximizes the performance of net-work capacity.

Cooperative Particle Swarm Optimization in Distance-Based Clustered Groups

TCPSO (Two-swarm Cooperative Particle Swarm Optimization) has been proposed by Sun and Li in 2014. TCPSO divides the swarms into two groups with different migration rules, and it has higher performance for high-dimensional nonlinear optimization problems than traditional PSO and other modified method of PSO. This paper proposes a particle swarm optimization by modifying TCPSO to avoid inappropriate convergence onto local optima. The quite feature of the proposed method is that two kinds of subpopulations constructed based on the scheme of TCPSO are divided into some clusters based on distance measure, k-means clustering method, to maintain both diversity and centralization of search process are maintained. This paper conducts numerical experiments using several types of functions, and the experimental results indicate that the proposed method has higher performance than the TCPSO for large-scale optimization problems.

A New Clustering Algorithm Using Adaptive Discrete Particle Swarm Optimization in Wireless Sensor Network

Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.

基于先验特征聚类的目标检测优化方法

针对显著目标检测问题在没有任何先验信息的情况下,通过特征聚类和紧致性先验方案实现目标检测优化。优化后的方法包括四个步骤:首先采用超像素预处理将图像分割成超像素,以抑制噪声并降低计算复杂度;其次应用改进的虾群聚类算法对颜色特征进行分类;接着利用二维熵来衡量每个簇的紧密度,并构建背景模型;最后以背景区域与其他区域之间的对比度作为显著特征,并通过设计高斯滤波器增强其显著性。为了更好地评价显著目标检测的精度,本文通过多维评价指标进行优劣性实验分析,实验结果表明,文中算法具有较好的实时性与鲁棒性。

密度峰值聚类在塔机损伤诊断中的应用研究

建立塔机有限元模型,获取塔机完好状态和各损伤工况的各采集点的动态位移。提出了两种模型建立方法,基于悬臂梁的双输入单输出模型和基于时域数据的动态双输入单输出模型,对基于时域数据的双输入单输出模型首先利用最小二乘法计算参数初值,进一步利用粒子群优化方法进行参数优化,提高了模型精度。以完好工况的塔机数据为基础,建立基于悬臂梁的双输入单输出模型和基于时域数据的双输入单输出模型,计算参数,建立损伤识别模型,用待检状态的位移数值拟合模型,用两种模型计算出的残差方差做损伤因子,利用密度峰值聚类方法对损伤因子进行分析,实现了对塔机的损伤判定和损伤位置的确定。这种基于密度峰值聚类的诊断方法可对塔机微小损伤进行智能诊断和位置确定,该方法只需要塔机完好状态的数据和待检状态的数据即可自动诊断,解决了塔机损伤识别中损伤数据难以获取,因而无法实现智能训练和诊断的问题。

面向智能电网广域通信的可靠路由算法研究

无线传感器网络是智能电网广域通信中的基础组成单元,传统的无线传感器网络分簇路由协议虽能在一定程度上简化网络拓扑,但仍存在簇首选择不合理且系统能耗较高的问题。针对此,文中基于粒子群优化算法提出了一种改进的分簇路由协议。该协议利用粒子群算法的参数寻优特性对簇首搜寻方案加以改进,使得新方案考虑了距离、剩余能量、数据传输精度等多种因素。同时还使用粒子群自适应函数对该方案进行优化,从而提高了原算法的可靠性。在能耗实验测试中,所提算法迭代1 300次后的剩余能耗为31.2 J,在对比算法中为最优。而对路由路径的测试中,改进算法的平均运行时延为1.79 ms,平均误码率为0.212 5,在所有算法中均为最低,证明了该算法具有良好的实时性和可靠性。

基于混合粒子群算法的波浪能发电集群优化方法

对波浪能发电集群的优化控制有助于波浪能的有效利用,为此文章提出了基于混合粒子群算法的波浪能发电集群优化方法。以直驱式发电装置为研究对象,探讨其构成发电集群短期尺度下稳定状态的数学模型,由简至繁依次考虑波浪动态压力、装置间辐射影响和遮挡效应,以便更准确地模拟一定密集度的波浪能发电装置部署下的实际效果。以集群功率最大化为优化目标,根据装置运动和海域能量约束,提出混合粒子群算法求解集群的最优参数,在传统算法基础上设定自适应惯性权重并加入交叉和变异操作,以应对复杂集群方程解空间的多峰性问题。算例结果验证了所述集群优化方法的有效性,求解质量良好;同时表明波浪能发电集群规模越大,装置之间的辐射影响越复杂,遮挡效应越明显。

基于SACPS算法的住宅小区电动汽车集群有序充电

针对传统电动汽车有序充电存在的充电影响因素考虑不全、优化目标过于单一、充电体验不友好等问题,以住宅小区电动汽车集群充电为研究对象,构建集群有序充电模型,提出模拟退火的混沌粒子群(simulated annealing chaotic particle swarm,简称SACPS)算法,且使用该文算法对集群有序充电模型进行优化,最后对优化结果进行仿真实验.仿真实验结果表明:相对于其他2种算法,该文算法能使电动汽车集群有序充电模型取得更低的最佳适应度;与集群无序充电相比,SACPS算法的集群有序充电的负荷峰值、负荷峰谷比、充电费用分别降低了42.62%,96.81%,15.61%;SACPS算法的集群有序充电在一定程度上实现了与其他负荷的错峰用电.因此,SACPS算法具有优越性.

基于Docker Swarm集群的调度策略优化

轻量级虚拟化技术Docker及Docker集群管理工具Swarm的出现,为基于Linux平台的集群资源虚拟化提供了一套简单高效的解决方案。但是,能否充分发挥一个集群的整体性能,一个好的调度策略至关重要。目前Swarm工具内置的调度策略都无法很好地实现Docker集群的负载均衡,并且对集群资源的利用率不高,造成了很大的资源浪费。针对以上问题,文中利用权值调度算法对Docker Swarm集群的调度策略进行了优化,最终很好地实现了集群的负载均衡,充分发挥出了集群中每一个节点的性能,并提高了集群的整体性能。

基于遗传粒子群动态聚类算法的物流柔性分拣系统品规分配

目的针对目前烟草物流配送中心条烟分拣量大,不同条烟品规的分配对订单的总处理时间影响较大的问题,研究平衡各个分拣区品规的分配,提高分拣效率。方法建立以各分区品规相似系数和最小为目标函数的数学模型,并采用改进的遗传粒子群动态聚类(GAPSO-K)算法进行求解。首先,结合各品规分拣量对品规相似系数进行改进,并将其作为适应度函数;然后在粒子群算法中对惯性权重因子进行改进,使其值可以进行自适应改变;最后,在粒子群动态聚类算法中引入遗传算法中的交叉变异扩大解的搜索范围,基于Matlab对文中的其他算法进行求解对比,求得结果在EM-plant中进行仿真验证。结果结合某烟草物流配送中心数据仿真验证,利用GAPSO-K算法处理订单的时间为234.5 s,较传统时间大幅度较少,有效提升了柔性物流分拣效率。结论采用该算法可充分发挥2种算法的优良性,具有更好的收敛性及寻优性,为柔性物流品规分配提供了新思路。

面向无人艇集群避障的速度障碍算法研究

无人艇集群在海上公共区域航行需要考虑互相避障以及水面其他障碍的规避问题,故提出一种无人艇集群避障算法解决该问题。算法改进了速度障碍法,考虑障碍物位置和速度以估计未来时间窗口下可能发生碰撞的锥形区域,并规划出可行域半平面。之后引入海事避碰规则进一步约束无人艇的避碰方向和可行域范围。多障碍场景下,通过在若干个可行域的交集上寻找最优的避碰速度矢量,可引导无人艇避障。算法中各无人艇相互独立,不存在中心节点。进行了仿真验证,将数十条无人艇划分为多个集群进行相互避障测试。仿真结果表明,该方法能够有效地避免无人艇集群之间的碰撞,具有较好的鲁棒性和实时性。

基于TTNT数据链多址接入协议的多机协同任务调度方法

为提高无人机蜂群作战中无人机信息交互、资源共享和任务协同的能力,文章基于TTNT数据链SPMA协议,设计高动态变化拓扑下的分层分簇无人机蜂群模型和与之匹配的层次资源与任务调度模型,并对其消息传输进行优化。通过OMNeT++仿真平台,以TTNT数据链中的数据传输标准对信息端到端时延和网络吞吐量进行不同机间传输距离下的对比仿真实验。其结果表明,该方法满足SPMA协议对于消息传输时延的要求,并且引入SPMA协议后可以有效减少网络数据传输冲突,提高了系统约18%的网络吞吐量,提升了无人机信息交互、资源共享和协同作战的能力,对实际无人机蜂群协同任务调度研究具有可参考性。

消纳弃风的风电混合储能供热系统容量配置优化

为解决“三北”地区冬季建筑能耗较高且弃风严重的问题,设计了由锂电池、固体蓄热装置和热泵设备组成的风电混合储能供热系统。首先基于BP神经网络预测了风电机组输出功率,采用k-means聚类分析得到了供热典型日负荷曲线;然后提出了一种基于粒子群优化算法的风电混合储能供热系统容量配置优化方法,以系统总成本最小和弃风量最低为约束条件构建了目标函数;最后比较了考虑和不考虑弃风条件下,风电混合储能供热系统的容量配置优化结果。研究表明,所提出的优化方法不但可以有效降低弃风率,场景适用性强,还能够满足严寒地区冬季清洁供热需求,为可再生能源高效利用提供参考。

基于人工鱼群的自适应密度峰值聚类算法

针对密度峰值聚类算法中截断距离d c和聚类中心缺乏选取依据,以及对簇中存在多密度峰值的数据无法准确聚类问题,提出一种基于人工鱼群的自适应密度峰值聚类算法(AFSADPC)。选择簇中心权值γ大于幂律分布上分位数的样本点作为聚类中心,根据两个相邻簇的簇间边界区域密度与簇平均密度构造簇间合并规则,利用人工鱼群算法寻找使改进轮廓系数指标达到最大值时的最优截断距离d_(c)。在合成数据集和真实数据集上的实验结果表明,AFSADPC算法具有较好的聚类效果。

基于时间分区和粒子群优化的非侵入式负荷分解研究

非侵入式负荷分解技术是智能电网技术体系的重要组成部分,针对现有分解技术对功率相近或小功率负荷辨识精度较低的问题,提出基于时间分区和V型粒子群优化的非侵入式负荷分解算法。文章通过具有噪声的基于密度的聚类算法对负荷的功率特征进行聚类分析,得到负荷的功率特征模板,并求解负荷典型工作时间区间,得到负荷的时间特征模板;综合考虑功率及时间两种特征,构建V型粒子群算法的目标函数,实现负荷分解;在AMPds2公开数据集上实现仿真,并与隐马尔可夫模型对比,验证了文章方法的有效性。