共查询到20条相似文献,搜索用时 62 毫秒
1.
在改进的非支配排序遗传算法(NSGA-Ⅱ)的基础上,提出了一种基于生成树边集合编码求解多目标最小生成树问题的进化算法。通过快速非支配排序法,降低了算法的计算复杂度,引入保存精英策略,扩大采样空间。实验结果表明:对于多目标最小生成树问题,边集合编码具有较好的遗传性和局部性,而且基于边集合编码的进化算法在求解效率和解的质量方面都优于基于Pr(?)fer编码的进化算法。 相似文献
2.
3.
4.
本文提出一个获取连通网络是小生成树的算法。该算法采用一个优先队列组织各顶点集合,每次根据边的权值对队列头集合进行增长。由于对每个顶点的相关联边进行了按权值分级排序的预处理,算法获取具有。个预示e条边的无向连通网络的最小生成树的期望时间是O(e*loglogn)。 相似文献
5.
6.
基于EBS (Exclusion Basis Systems)的密钥管理协议,以安全性高、动态性和扩展性好,较适用于异构传感器网络,但却存在共谋问题。该文提出了一种基于MST (Minimum Spanning Tree)的密钥共谋问题优化方案。该方案利用Prim算法对由簇内感知节点所构成的无向连通图进行最小生成树求解,并对该树进行遍历,根据所得节点遍历顺序进行密钥的指派与分配,使得相邻节点间所含的密钥重叠程度增大,发生共谋的可能性得到降低。实验结果表明:同比于密钥随机分配方案与SHELL方案,所提方案有效提高了网络的抗捕获能力。 相似文献
7.
8.
9.
10.
11.
为减少分簇过程中的时延,基于最小生成树的单向比较优势提出簇首快速推举方法,并提出改进的分簇协作频谱感知算法,分析了算法的时间复杂度。算法首先基于最小划分对所有次用户节点进行分簇,簇内节点根据设置的评价条件进行性能比较,推举簇首。由簇首进行本地簇内频谱检测,并上传检测结果,最后融合中心在簇首间实现协作的频谱检测。在瑞利信道条件下,仿真显示在大信噪比时,融合中心应用AND规则,系统具有较小的虚警率,所提算法检测性能优;小信噪比时,应用OR规则能扩展系统的有效检测区间,所提算法在满足系统要求的前提下检测性能较差,但簇内信道效率提高了n-1倍。 相似文献
12.
电力线载波通信技术利用现有的电力传输网络进行数据传输,具有建设成本低,部署快速灵活等特点,被广泛用于局域网本地通信中。但当节点数过多或传输数据量过高时,如每个节点单独将数据传到调控中心,将会给整个通信系统带来巨大的数据量,同时降低通信效率,甚至造成通信拥塞。为降低传输数据量,节省通信传输资源,提升电力线载波接入网络的传输能力,本文提出了基于最小生成树传输路径的电力线载波通信数据融合算法。将所提算法与未使用融合算法带来的数据量进行对比,证明了所提算法的有效性。 相似文献
13.
基于MST聚类的遥感图像变化检测 总被引:2,自引:2,他引:0
为了获取图像信息较完好的差异图像以及得到更 好的变化检测结果,提出了 一种基于最小生成树(MST)聚类的遥感图像变化检测算法。先利用归一化邻域比值法得到两 幅遥 感图像的差异图像;然后根据灰度差异直方图将像素分成变化、非变化和未确定3类, 针对未确定像素,利用未确定像素的纹理特征结合MST算法进行聚类;最后通过最优 目标函数将未确定像素区分为变化类和非变化类,得到最终图像变化检测结果。采用 两组数据验证算法的有效性:墨西哥数据的检测精度为99.01%,运行 时间为8.49s,撒 丁岛数据的检测精度为98.62%,运行时间为3.45s。实验结果表明,本文算法具有更高的检测精度和较短的运行时间。 相似文献
14.
LiuXikui LiYan XuJin 《电子科学学刊(英文版)》2005,22(2):112-117
Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed. 相似文献
15.
Jianping Wang Chaoping Pan Huai Zhang Qiwu Wu Xianwei Zhou 《Photonic Network Communications》2011,21(1):28-33
In an optical network, the connections are generally bidirectional, but their QoS parameters in each direction may be not the same. In this paper, we propose an enhanced algorithm called Node Label Order First (NLOF), which can maintain asymmetrical information and guarantee availability of the compressed topology. Besides, a decoding algorithm to restore the compressed topology named Average Proportional point (AP) is also proposed, which not only retains the space complexity of the aggregation process but also improves the accuracy of the restored information. Simulation results show that combing NLOF with AP can balance the contradiction between space complexity of the aggregation algorithm and routing accuracy. 相似文献
16.
17.
18.
In order to improve the service quality of radio frequency identification (RFID) systems, multiple objectives should be comprehensively considered. An improved brain storm optimization algorithm GABSO, which incorporated adaptive learning operator and golden sine operator into the original brain storm optimization (BSO) algorithm, was proposed to solve the problem of RFID network planning (RNP). GABSO algorithm introduces learning operator and golden sine operator to achieve a balance between exploration and development. Based on GABSO algorithm, an optimization model is established to optimize the position of the reader. The GABSO algorithm was tested on the RFID model and dataset, and was compared with other methods. The GABSO algorithm's tag coverage was increased by 9.62% over the Cuckoo search (CS) algorithm, and 7.70% over BSO. The results show that the GABSO algorithm could be successfully applied to solve the problem of RNP. 相似文献
19.
20.
José Craveirinha João Clímaco Lúcia Martins Carlos G. da Silva Nuno Ferreira 《Telecommunication Systems》2013,52(1):203-215
The MPLS platform enables the implementation of advanced multipath and multicast routing schemes. This work develops and analyses the performance of a new bi-criteria minimum spanning tree model intended for routing broadcast messages in MPLS networks or constructing tree-based overlay networks. The aim of the model is to obtain spanning trees which are compromise solutions with respect to two important traffic engineering metrics: load balancing cost and average delay bound. An exact solution to the formulated bi-criteria optimization problem is presented, which is based on an algorithm that enables the computation of the set of supported non-dominated spanning trees. An application model and a set of experiments on randomly generated Internet type topologies will also be presented. Finally a network performance analysis of the model considering three network performance metrics will be shown. 相似文献