大宁河补水工程环境地质条件与布置方案研究(Ⅱ)

针对丹江口水库远期补水需要,对大宁河补水工程的环境工程地质条件进行了全面研究,全面论述了东西线4个比选方案。研究认为：各方案深埋长隧洞为工程难点,但就国内外已建工程经验而言,暂未发现在经济条件许可的前提下存在不可克服的技术问题。对4个组合方案环境工程地质条件、重要非地质因素进行了比选研究,认为：西线优势方案“西线剪刀峡（檀木-茅草坡）方案”在二级泵站站址、控制性穿岭隧洞长度及其可实现最短施工长度、隧洞埋深、不稳定类岩体长度等方面优势明显;就重要非地质因素而言,该方案在抽水蓄能效益、带动当地经济发展、投资集约度与灵活度等方面优势明显,在调水保证度这一核心任务方面,西线具有突出优越性。     

Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors

Traditional ant colony optimization (ACO) algorithms have difficulty in addressing dynamic optimization problems (DOPs). This is because once the algorithm converges to a solution and a dynamic change occurs, it is difficult for the population to adapt to a new environment since high levels of pheromone will be generated to a single trail and force the ants to follow it even after a dynamic change. A good solution to address this problem is to increase the diversity via transferring knowledge from previous environments to the pheromone trails using immigrants schemes. In this paper, an ACO framework for dynamic environments is proposed where different immigrants schemes, including random immigrants, elitism-based immigrants, and memory-based immigrants, are integrated into ACO algorithms for solving DOPs. From this framework, three ACO algorithms, where immigrant ants are generated using the aforementioned immigrants schemes and replace existing ants in the current population, are proposed and investigated. Moreover, two novel types of dynamic travelling salesman problems (DTSPs) with traffic factors, i.e., under random and cyclic dynamic environments, are proposed for the experimental study. The experimental results based on different DTSP test cases show that each proposed algorithm performs well on different environmental cases and that the proposed algorithms outperform several other peer ACO algorithms.     

基于规范的移动Ad Hoc网络分布式入侵检测

移动ad hoc网络是移动节点自组织形成的网络,由于其动态拓扑、无线传输的特点,容易遭受各种网络攻击。传统的网络安全措施,如防火墙、加密、认证等技术,在移动ad hoc网络中难以应用,因此提出一种基于有限状态机分布式合作的入侵检测算法。首先,将整个网络分为子区域,每一区域随机选出簇头担任监视节点,负责本区域的入侵检测。其次,按照DSR路由协议构筑节点正常行为和入侵行为的有限状态机,监视节点收集其邻居节点的行为信息,利用有限状态机分析节点的行为,发现入侵者。本算法不需要事先进行数据训练并能够实时检测入侵行为。最后,通过模拟实验证实了算法的有效性。     

基于攻击效果的WSN路由安全评估模型

为提高无线传感器网络(Wireless Sensor Networks,WSN)的路由安全评估能力,提出了一种基于攻击效果的评估模型.根据路由攻击前后网络安全性能的变化,提出了"网络安全熵"的概念,选取并简化能客观真实地反映安全性的安全评估指标,分析了网络安全熵的计算方法.其次利用Monte Carlo方法进行统计,确定节点的安全度,对安全指标进行归一化处理,通过模型观察攻击效果,评估网络的安全性,并进行安全态势预测,从而提升了WSN网络安全评估的能力,且能够为制定反击敌方的恶意攻击的策略提供依据.经过应用实例的仿真计算与分析,表明该模型能够比较合理地评估网络安全.     

基于NS2的无线Ad Hoc网络路由协议仿真

运用NS2对Ad Hoc网络尤其是对Ad Hoc网络的路由协议研究成为网络研究者的一种重要手段。首先介绍Ad Hoc网络和NS2进行仿真的一般步骤,然后通过AODV路由协议的仿真实例分析,结论表明运用NS2研究Ad Hoc网络的可行性和有效性。     

Multicast routing in mobile ad hoc networks by using a multiagent system

Multicast routing in mobile ad hoc networks (MANETs) poses several challenges due to inherent characteristics of the network such as node mobility, reliability, scarce resources, etc. This paper proposes an Agent Based Multicast Routing Scheme (ABMRS) in MANETs, which uses a set of static and mobile agents. Five types of agents are used in the scheme: Route manager static agent, Network initiation mobile agent, Network management static agent, Multicast initiation mobile agent and Multicast management static agent. The scheme operates in the following steps: (1) to identify reliable nodes; (2) to connect reliable nodes through intermediate nodes; (3) to construct a backbone for multicasting using reliable nodes and intermediate nodes; (4) to join multicast group members to the backbone; (5) to perform backbone and group members management in case of mobility. The scheme has been simulated in various network scenarios to test operation effectiveness in terms of performance parameters such as packet delivery ratio, control overheads and group reliability. Also, a comparison of proposed scheme with MAODV (Multicast Ad hoc on-demand Distance Vector) protocol is presented. ABMRS performs better than MAODV as observed from the simulation. ABMRS offers flexible and adaptable multicast services and also supports component based software development.     

Path partitions of hypercubes

A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set of pairs of distinct vertices of the n-dimensional hypercube Qn, is there a path partition of Qn such that ai and bi are endvertices of Pi? Caha and Koubek showed that for 6m?n, such a path partition exists if and only if the set P is balanced in the sense that it contains the same number of vertices from both classes of bipartition of Qn.In this paper we show that this result holds even for 2m−e<n, where e is the number of pairs of P that form edges of Qn. Moreover, our bound is optimal in the sense that for every n?3, there is a balanced set P in Qn such that 2m−e=n, but no path partition with endvertices prescribed by P exists.     

Compact separator decompositions in dynamic trees and applications to labeling schemes

This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low message complexity. In particular, if the initial dynamic tree contains only the root, then the scheme incurs an O(log⁴ n) amortized message complexity per topology change, where n is the current number of vertices in the tree. As a separator decomposition is a fundamental decomposition of trees used extensively as a component in many static graph algorithms, our dynamic scheme for separator decomposition may be used for constructing dynamic versions to these algorithms. The paper then shows how to use our dynamic separator decomposition to construct efficient labeling schemes on dynamic trees, using the same message complexity as our dynamic separator scheme. Specifically, we construct efficient routing schemes on dynamic trees, for both the designer and the adversary port models, which maintain optimal labels, up to a multiplicative factor of O(log log n). In addition, it is shown how to use our dynamic separator decomposition scheme to construct dynamic labeling schemes supporting the ancestry and NCA relations using asymptotically optimal labels, as well as to extend a known result on dynamic distance labeling schemes. Supported in part at the Technion by an Aly Kaufman fellowship. Supported in part by a grant from the Israel Science Foundation.     

基于容量约束的WSANs路由算法的研究

在无线传感反应网络通过引入具有丰富资源、甚至可以移动的反应节点,极大地增强了现有的无线传感器网络的功能和应用范围.针对距离反应节点越近传感节点能量消耗越快的问题,研究了基于容量约束的最大跳数最小化的问题,并在此基础上提出了一种全局近似算法.仿真实验表明,该算法能通过设置节点的容量约束,限制节点每轮转发某个事件的最大报文数,以降低单个节点的最大能耗,达到延长网络生存时间的目的.