Fuzzy Fruit Fly Optimized Node Quality-Based Clustering Algorithm for Network Load Balancing

Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.

Performance Analysis of Malicious Node Detection and Elimination Using Clustering Approach on MANET

Mobile Ad hoc Network (MANET) is a significant concept of wireless networks which comprises of thousands of nodes that are mobile as well as autonomous and they do not requires any existing network infrastructure. The autonomous nodes can freely and randomly move within the network which can create temporary dynamic network and these networks can change their topology frequently. The security is the primary issue in MANET which degrades the network performance significantly. In this paper, cluster based malicious node detection methodology is proposed to detect and remove the malicious nodes. Each node within the cluster gets the cluster key from the cluster head and this key is used for the data transaction between cluster head and node. The cluster head checks this key for every data transaction from node and match with their cluster table. If match is valid, and then only it will recognize that this node is belongs to this cluster, otherwise it is decided as malicious node. This paper also discusses the detection of link failure due to the presence of malicious node by determining the gain of each link in the network. The performance of the proposed method is analyzed using packet delivery ratio, network life time, and throughput and energy consumption. The proposed malicious node detection system is compared with the conventional techniques as OEERP (Optimized energy efficient routing protocol), LEACH (Low energy adaptive clustering hierarchy), DRINA (Data routing for In-network aggregation) and BCDCP (Base station controlled dynamic clustering protocol).

A Cooperative Security Monitoring Mechanism Aided by Optimal Multiple Slave Cluster Heads for UASNs

As each cluster head(CH)sensor node is used to aggregate,fuse,and forward data from different sensor nodes in an underwater acoustic sensor network(UASN),guaranteeing the data security in a CH is very critical.In this paper,a cooperative security monitoring mechanism aided by multiple slave cluster heads(SCHs)is proposed to keep track of the data security of a CH.By designing a low complexity“equilateral triangle algorithm(ETA)”,the optimal SCHs(named as ETA-based multiple SCHs)are selected from the candidate SCHs so as to improve the dispersion and coverage of SCHs and achieve largescale data security monitoring.In addition,by analyzing the entire monitoring process,the close form expression of the probability of the failure attack identification for the SCHs with respect to the probability of attack launched by ordinary nodes is deduced.The simulation results show that the proposed optimal ETA-based multiple SCH cooperation scheme has lower probability of the failure attack identification than that of the existing schemes.In addition,the numerical simulation results are consistent with the theoretical analysis results,thus verifying the effectiveness of the proposed scheme.

Research on Dynamic Clustering Routing Considering Node Load for Wireless Sensor Networks

Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called DCRCL (Dynamic Clustering Routing Considering Load). This algorithm is comprised of three phases including cluster head (CH) selection, cluster setup and inter-cluster routing. First, the CHs are selected based on residual energy and node load. Then the non-CH nodes choose a cluster by comparing the cost function of its neighbor CHs. At last, each CH communicates with base station by using multi-hop communication. The simulation results show that comparing with the existing one, the techniques life cycle and date volume of the network are increased by 30.7 percent and 29.8 percent respectively by using the proposed algorithm DCRCL.

Malicious Nodes Detection in MANET Using Back-Off Clustering Approach

Mobile Ad hoc Networks (MANET) are infrastructure less networks which provide multi-hop wireless links between nodes. The main applications of MANET in real time environment are military and emergency areas where the fixed infrastructure is not required. It is a temporary communication infrastructure network for quick communication with minimal configuration settings among the group of nodes. The security is one of the primary concerns in MANET. The malicious nodes in MANET environment degrade the performance of the network. In this paper, the nodes in MANET are grouped using back-off duration technique and further the malicious nodes are detected using this algorithm. The proposed clustering based malicious nodes detection in MANET achieves higher performance in terms of packet delivery ratio, latency and energy consumption. The proposed method achieves 89.35% of packet delivery ratio, 36.2 ms latency and 26.91 mJ of energy consumption.

Dynamic Clustering with Relay Nodes (DCRN): A Clustering Technique to Maximize Stability in Wireless Sensor Networks with Relay Nodes

With the growing popularity of wireless sensor networks, network stability has become a key area of current research. Different applications of wireless sensor networks demand stable sensing, coverage, and connectivity throughout their operational periods. In some cases, the death of just a single sensor node might disrupt the stability of the entire network. Therefore, a number of techniques have been proposed to improve the network stability. Clustering is one of the most commonly used techniques in this regard. Most clustering techniques assume the presence of high power sensor nodes called relay nodes and implicitly assume that these relay nodes serve as cluster heads in the network. This assumption may lead to faulty network behavior when any of the relay nodes becomes unavailable to its followers. Moreover, relay node based clustering techniques do not address the heterogeneity of sensor nodes in terms of their residual energies, which frequently occur during the operation of a network. To address these two issues, we present a novel clustering technique, Dynamic Clustering with Relay Nodes (DCRN), by considering the heterogeneity in residual battery capacity and by removing the assumption that relay nodes always serve as cluster-heads. We use an essence of the underlying mechanism of LEACH (Low-Energy Adaptive Clustering Hierarchy), which is one of the most popular clustering solutions for wireless sensor networks. In our work, we present four heuristics to increase network stability periods in terms of the time elapsed before the death of the first node in the network. Based on the proposed heuristics, we devise an algorithm for DCRN and formulate a mathematical model for its long-term rate of energy consumption. Further, we calculate the optimal percentage of relay nodes from our mathematical model. Finally, we verify the efficiency of DCRN and correctness of the mathematical model by exhaustive simulation results. Our simulation results reveal that DCRN enhances the network stability period by a significant margin in comparison to LEACH and its best-known variant.

基于密度峰值的标签传播算法

随着智能技术应用的推广,高质量社区的检测已成为社会网络研究的热点之一。由于具有线性时间复杂度,且无需预定义目标函数和社团数,标签传播算法(LPA)已得到广泛关注。然而,在标签传播过程中,LPA具有不确定性和随机性,进而影响检测社区结果的准确性和稳定性。为此,提出一种基于密度峰值的标签传播社区检测方法(DPC-RWL)。首先,采用密度峰值聚类算法查找出社区的核心节点集合,计算节点与核心节点集之间的权重,选取最大值为该节点赋予权值。最后,使用基于标签传播算法的归属度函数进行传播。真实网络和LFR人工基准网络的对比实验表明,所提算法能准确高效地识别出社区结构。

基于遗传算法和蚁群算法的LEACH改进协议

针对无线传感器网络低功耗自适应集簇分层(Low Energy Adaptive Clustering Hierarchy,LEACH)路由协议因能耗不均衡导致节点过早死亡的问题,提出了一种基于遗传算法和蚁群算法改进的LEACH路由协议。在分簇阶段,通过遗传算法选举合理的簇头节点并根据节点的分布划分簇群;在数据传输阶段,通过蚁群算法使簇头节点尽可能选择能量充足且距离较短的路径进行数据传输。仿真结果表明,与传统的分簇路由协议LEACH和LEACH-C相比,改进算法可以使网络的能量消耗更加均衡,并延长网络的生命周期。

基于ELK的日志系统性能优化

在IT的运维与安全工作中,健全日志是帮助技术人员快速定位问题、分析故障原因以及优化系统的一个重要手段。在业务量大和并发量高的项目中,单节点的ELK会带来数据丢失、查询慢等问题。文章提出使用Elasticsearch集群和多节点logstash的解决方案,实现中大型系统的日志性能优化。

中国省会航空节点城市复杂时空系统协调度变化及空间特征分析

航空运输业提升了城市系统的吸引力并激发新的交通需求,引导城市经济和空间结构快速演进。本文构建了包含经济、规模、外贸、科技、社会、环境、航空等要素在内的城市复杂时空系统指标体系,对中国省会航空节点城市及其构成的7个空管区的复杂时空系统发展的协调程度变化情况及时空聚类特征、空间溢出效应进行了分析。研究发现:2001—2019年,中国31个省会(首府、直辖市)航空节点城市在复杂时空系统发展过程中呈现了或分散、或集中的趋势特征,南方城市在研究末期的协调程度表现更好。7个空管区中,华北区协调度最高,新疆区、西北区、华东区、中南区的协调度水平发展增速较快,航空系统的平均协调度最高。各航空节点城市复杂时空系统协调度的时空聚类模式存在空间分异特征与聚类特征,航空系统在空管区的聚类优势最为突出,经济系统在空管区聚类辐射范围最大。航空、规模、科技与环境系统均表现了正向直接空间溢出效应,经济与科技系统表现了正向间接空间溢出效应。通过全面分析航空节点城市及空管区的复杂时空系统协调度变化,精准判定了航空节点城市多指标系统在区域发展过程中的影响程度及时空分布异质性,对拓展航空地理研究及促进航空节点城市高质量综合发展提供理论依据。

集中式电力市场下基于谱聚类与图注意力网络的电力枢纽节点设计方法研究

电力枢纽节点是现货市场上可以进行统一交易的聚合节点,也是电力金融市场发展与稳定运行的基石,对构建统一电力市场体系、完善市场功能具有十分重要的意义。从一般属性、节点选择、权重设计、时间性的角度分析了枢纽节点的设计方式,并针对性地提出了基于谱聚类的枢纽区域划分方法与基于图注意力网络的权重计算方法。基于双尺度度量的谱聚类分区策略,其核心是建立以关键线路功率传输分布因子、多时段节点电价和节点邻接性为度量的双尺度耦合矩阵,优先保证枢纽区域的地理特性、区内的无阻塞特性和节点连通性。基于图注意力网络建立了定价节点聚合权重的分配模型,通过自注意力机制来对邻域节点进行聚合,实现不同时段节点电价下节点权重的自适应匹配。最后通过IEEE118节点算例对所提出的设计方法进行验证,通过横向对比,证明了所提方法的合理性与有效性,可为实际市场中枢纽节点设定提供理论支撑。

基于模糊评判的无线传感器网络簇间数据转发算法

由于无线传感器网络在簇间数据转发过程中消耗能量较大、转发效率低,导致数据在转发过程中容易失效。为此,提出基于模糊评判的无线传感器网络簇间数据转发算法。建立无线传感器网络模型和通信模型,明确节点的运行方式和转发数据所消耗的能量,构建模糊综合评判模型,选取梯形隶属度函数计算传感器节点的相似度和活跃度,找出最佳转发节点,完成数据转发任务。仿真结果表明,所提算法的第一个节点死亡轮数和网络失效轮数最高为167和178,在仿真轮数达到1000轮时,该算法剩余的网络能量和节点平均能量分别为4 J和0.01 J,证明所提算法在数据转发过程中可消耗最少的能量,高效率地完成数据转发任务。

基于互信息最大化和聚类感知的节点表示学习

节点表示学习是研究各类图结构数据的基础.图结构数据具有复杂的结构关系和丰富的节点信息,因此如何融合图结构和节点信息学习高质量的节点表示仍是一个挑战性问题.为此,提出一种基于互信息最大化和聚类感知的节点表示学习模型.首先,对原始图使用图扩散方法构造扩散图;然后,使用图卷积网络编码两个图到低维特征空间获得节点表示和全局表示;最后,基于互信息最大化原理,最大化一个图的节点表示和另一个图的全局表示间的一致性,反之亦然.同时,将语义相似的节点聚类到同一个簇,并最大化两个图的节点表示间的聚类一致性.在两个引文数据集上的节点分类和节点聚类的实验结果表明,该模型的性能在多项指标上都优于基线方法.以Cora数据集为例,在节点分类任务上,该模型对比基线方法在准确率和F1值指标上分别提高了2.7和0.6个百分点.

基于领域概念图的航天新闻自动摘要模型

互联网海量的航天新闻中隐含着大量航天情报信息,对其进行理解与压缩是提高后续情报分析效率的基础。然而通用的自动摘要算法往往会忽略很多航天领域关键信息,且有监督自动摘要算法需要对领域文本进行大量的数据标注,费时费力。因此,提出一种基于领域概念图的无监督自动摘要(DCG-TextRank)模型,利用领域术语辅助引导图排序,提高模型对领域文本的理解力。该模型分3个模块:领域概念图生成、图权重初始化、图排序及语义筛选。根据句向量相似度和领域术语库,将文本转换为包含句子节点和领域术语节点的领域概念图;根据航天新闻文本特征初始化领域概念图权值;采用TextRank模型对句子进行排序,并在语义筛选模块通过图节点聚类及设置摘要语义保留度的方法改进TextRank的输出,充分保留文本的多语义信息并降低冗余。所提模型具有领域可移植性,且实验结果表明:在航天新闻数据集中,所提模型相比传统TextRank模型性能提升了14.97%,相比有监督抽取式文本摘要模型BertSum和MatchSum性能提升了4.37%~12.97%。

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

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

无人机自组网快速稳定加权分簇算法

在无人机自组网中,网络规模增大会使节点间平均跳数增加,网络管理和路由协议运行更艰难。分簇结构可用来优化网络管理,提高网络的可拓展性。针对无人机高移动造成的簇结构不稳定以及分簇结构鲁棒性差的问题,提出了一种快速稳定加权分簇算法。该算法对比现有的加权分簇算法,对链路保持率、节点度和相对速度三个指标的选取进行改进。针对战场和应急场景下簇头节点掉线带来的簇振荡,提出了一种高效的簇维护机制。最后通过仿真验证该算法的性能,结果表明,与现有改进型加权分簇算法相比,该算法可以有效降低成簇的时间,同时在簇头节点掉线的情况下快速恢复,更适用于复杂环境下的网络部署。

基于Node.js的高性能站群系统设计与实现

站群系统是统一数据、标准和管理的建站模式,可以轻松建立多个站点,并在各站点间共享信息,从而显著减少信息孤岛现象。Node.js是javascript语言在服务器端的实现,采用V8高性能引擎,结合语言本身独特的异步特性,可以构建高性能网站。提出一种基于Node.js的网站架构,采用MVC、Widgets和SOA进行解耦,增加并行性,提高系统性能。在此架构上,设计和实现一套高性能站群系统,该系统结构清晰简单,可扩展性好,稳定性高,性能优越,适合高校使用。

ZigBee传感网络Cluster-Tree改进路由算法研究

ZigBee技术的无线传感器网络是基于分布式地址分配的一种支持拓扑变化、节点移动的新型无线传感网络,拥有强大的自组网能力。针对ZigBee网络的Cluster-Tree算法对簇首能量要求高及节点间非最佳路由的问题,结合节点能量分析提出新的簇首产生办法,并结合AODVjr算法的思路来寻求节点间的最佳路由。仿真结果表明,改进的算法能够有效地提高数据发送成功率,降低网络中的死亡节点数,减小端到端的报文传输时延,提高网络的使用价值。

多马尔可夫链协同的航班客舱保障过程预测

为感知航班客舱保障过程各节点的动态演化机理,提出一种多马尔可夫链协同(synergy of multi-Markov chains, SMMC)的航班客舱保障过程预测方法。根据航班客舱保障的实际流程及相互约束关系,构建一种客舱保障过程节点协同的马尔可夫模型;基于历史数据作为样本并改进DBSCAN(density-based spatial clustering of applications with noise)聚类算法,设计面向客舱保障过程的DBSCAN-SMMC预测方法。选取国内某大型机场航班运行保障过程的实际运行数据开展仿真验证。研究结果表明,所提方法实现了各节点发生时刻的动态精准预测,其平均绝对误差的均值为0.606 min,均方根误差的均值为1.133 min,与其它方法相比平均绝对百分误差最少降低2%,拟合优度最大提升0.14,能够为机场运行精细化管理提供决策依据。

含高渗透率光伏配电网的集群划分电压控制策略

分布式光伏大规模分散接入导致配电网电压越限问题频繁出现,针对集中控制无法快速响应分布式光伏随机性、就地控制难以实现整体协调的问题,该文提出了一种改进社区算法的分布式光伏集群协同优化电压控制策略。首先,通过改进社区算法,实现了综合考虑功率平衡和节点耦合程度的无功、有功集群划分;然后,充分利用光伏逆变器功率控制能力,提出集群协调电压控制策略;最后,提出电压调节能力的评价指标,对集群内节点调节能力进行评估并选取关键节点,有效减少了控制节点的数目。通过对改进的IEEE 69配电网进行仿真分析可知,所提的电压控制策略能缓解高渗透率分布式光伏接入配网的电压越限问题,提高了光伏的消纳能力。