基于能量强度的簇区分路由方法研究

传感器节点体积微小,通常携带能量十分有限的电池。由于传感器节点个数多,成本要求低廉,分布区域广,而且部署区域环境复杂,有些区域甚至是人员不能到达的,所以传感器节点通过更换电池的方式来补充能量是不现实的。如何高效使用能量来最大化网路的生命周期是无线传感器网络面临的首要挑战。为了提高网络的寿命,目前人们已经提出了很多基于网络层的路由协议。比较研究了传感器网络现有的路由协议,参考LEACH分簇算法和MTP协议,提出了一种在MTP协议基础上将LEACH分簇思想引入进来的改进方法,即在基于能量强度将网络节点分层后,再在各层上进行簇区分,均衡各传感器节点的能量来提高网络的寿命。实验表明该路由算法可提高网络寿命。     

基于语义的网售护肤品消费者调查算法

本文针对电子商务网售护肤品消费者调查困难的问题,结合语义路由的思想,在物联网环境下提出基于语义的网售护肤品消费者调查算法,可统计消费者对商品的喜爱程度和使用习惯。仿真结果表明,算法具有冗余数据少、能耗小、响应快速、实现简单等特点。     

基于Ad Hoc的虫洞攻击与防御研究综述

本文在分析无线Ad Hoc网络路由协议研究现状的基础上,指出无线Ad Hoc网络路由协议存在的脆弱性及针对协议漏洞所发起的几种主要攻击形式。重点分析虫洞攻击的基本原理及其当前的防御方法和不足,为今后更进一步研究安全路由协议打下基础。     

Routing with multiple quality-of-services constraints: An approximation perspective

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.     

A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation.     

A preliminary study of a diagonal channel-routing model

The layout of two-terminal nets in a VLSI channel is realized in a new diagonal channel-routing model (DCRM), where the tracks are segments respectively displayed at +45 ° and –45 ° on the two layers of the channel. A new definition of channel density is introduced, and a lower bound to the channel width is derived by the application of an algorithm, whose complexity is evaluated as a function of the channel density, and other parameters of the problem.A simple linear-time algorithm is proposed, which produces an optimal layout (i.e., it requires a channel of minimum width) if the length of the longest net equals the lower bound for the channel width. In any case, the number of vias is at most one for each net. Some particular solutions are proposed for problems with long nets.Specific problems are much easier in DCRM than in the classical Manhattan model. For example, any shift-by-i can be realized in DCRM in a channel of widthi.This work has been supported by Consiglio Nazionale delle Ricerche of Italy under a research grant.     

基于并行遗传算法的配送路线求解

遗传算法(Genetic Algorithm)是一类借鉴生物界的进化规律演化而来的随机化搜索方法,已经成功运用在很多大规模的组合优化问题中。利用如今流行的并行计算机系统,对遗传算法进行并行化,可解决标准遗传算法的速度瓶颈问题。本文在MPI并行环境下,用C++语言实现了粗粒度模型的并行遗传算法。结合并行遗传算法的特点,提出了解决物流配送路线优化的策略以及给出相应的算法过程,并进行了有效验证。通过研究结果表明,与传统遗传算法相比,并行遗传算法提高了运算速度,降低了平均开销时间并且最小总路径值更理想。     

提升细节捕捉能力的非下采样轮廓波变换

针对传统NSCT(非下采样轮廓波变换)算法中NSP(多尺度分解方法)对细节信息捕捉能力较差及利用其进行图像融合得到的融合图像出现细节丢失问题,提出改进的NSCT算法。不同于传统NSCT算法,该算法首先采用细节捕捉能力较强的非下采样形态学小波分解替代NSP分解,实现对源图像的多尺度分解,将源图像分解成水平高频、垂直高频、对角高频和低频4部分;然后利用NDFB(非下采样的方向性滤波器)对高频部分进行多方向分解得到一系列高频信息,实现改进型NSCT分解。实验结果表明,该算法的细节捕捉能力较传统算法好,在相同融合规则下其图像融合效果更好,各项融合指标值均有所提高,其中平均梯度提高了10%,且易于实现,可广泛用于多分辨率图像融合,是一种有效的融合图像算法。     

保持边缘特征和增强对比度的图像缩放算法

图像的边缘信息和对比度是影响人体视觉的最主要因素。提出一种能够同时保持边缘特征和增强对比度的图像缩放新方法。通过边缘检测算法、边缘梯度增强以及梯度图的低通滤波算法,得到新的梯度图,再通过求解泊松方程得到重建的图像。由于对图像边缘作了特殊处理,从而避免在图像缩放过程中丢失边缘信息。该方法可以同时保持特征以及增加图像的对比度,从而更好地展现图像的细节。实验结果表明,本文方法能应用于一般图像和医学图像的缩放和增强等应用中。     

3维图像中边界曲面的分类追踪及抽取

3维图像分析中,边界曲面的检测与重构是一个非常重要的问题。已有的连续隐边界曲面的抽取及逼近计算技术存在着把某些零交叉曲面片错误地识别为边界曲面片的缺陷。为此,提出一个新的边界曲面的追踪及抽取的方法。该方法首先将包含边界曲面的全部立方体分为两类:包含一个连通零交叉曲面片的立方体叫第1类边缘立方体,包含两个及其以上不连通零交叉曲面片的立方体叫第2类边缘立方体;然后根据边界曲面的连续性连通性,便可追踪出两类边缘立方体;对于追踪出的第1类边缘立方体直接提取边界曲面片,对于追踪出的第2类边缘立方体的边界曲面片通过其相邻的第1类边缘立方体来提取。实验结果表明本文方法是可行有效的,而且可以有效地克服已有技术的缺陷。