一种改进的多路径负载分配均衡算法

分析了实现均衡路由的功能模型和算法,重点研究了LDM(多路径负载分配)算法。为了充分利用候选路径的信道容量,提出了一种改进的LDM算法。改进后的算法在多个候选路径之间根据比例系数均衡分配通信流量。通过算法性能分析表明:改进后的算法和最初的LDM算法具有相同的复杂度,但对于给定的通信流量能够提升网络性能。     

A Layered Zone Routing Algorithm in Ad Hoc Network Based on Matrix of Adjacency Connection

The hybrid routing protocol has received more attention recently than the proactive and the reactive, especially for large-scale and highly dynamic connection, in mobile ad hoc network. A crucial reason is that zone-layered is being utilized in the complex systems. A hybrid routing algorithm which is layered zone based on adjacency connection（LZBAC） is put forward under the background of a few members in network with steady position and link. The algorithm modifies storage structure of nodes and improves routing mechanism. The theoretical analysis and simulation testing testify that the algorithm costs shorter time of route finding and less delay than others.     

一种新型多机系统互连网络的设计与控制算法

本文为MC-MT系统设计一种直接对称网SN,并且给出一种较为简易的寻径控制算法。文中证明这种网络的并行通讯时间≤(D+1),其中D为SN的直径。     

Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy (cf. Crainic and Toulouse (2001). In F. Glover and G. Kochenberger (eds.). State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers), i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.     

宽带卫星网微波副载波光调制系统方案

为简化星上光调制过程和星间光路由,基于宽带卫星网的特点,利用微波副载波对激光的直接调制,提出了一种新型星上光调制技术方案,建立了系统分析模型,给出了具体的相关实现技术。该方案引入了“目标卫星流”聚合、交换的技术和副载波频率重用的新概念,有效减轻了卫星的处理负荷,提高了系统在微波层和光层对频谱资源的利用效率。仿真结果表明,通过实施波长控制技术和增加光调制指数等措施,可以有效提高系统载噪比。     

An improved spatially aware routing algorithm for mobile ad hoc network in inter-vehicle communication

A new algorithm called spatially aware routing algorithm with enhanced learning (SAREL) is proposed to guarantee the rationality of route selecting in inter-vehicle communication scenario. Firstly, the traffic model is discussed and set up by using Poisson distribution. Then we analyze the process of traffic evaluation with enhanced learning, and exploit movement estimation to assist state memorization. The improvement of algorithm is provided at last compared with our previous work. Simulation results show that SAREL algorithm could achieve better performance in packet delivery ratio, especially when network connection ratio is average.     

Network synthesis under survivability constraints

Telecommunication networks are subject to link and equipment failures. Since failures cannot be entirely avoided, networks have to be designed so as to survive failure situations. In this paper, we are interested in designing low cost survivable networks. Given point-to-point traffic demands and a cost/capacity function for each link, we aim at finding the minimum cost capacities satisfying the given demands and survivability requirements. A survivability model that reroutes interrupted traffic using all the available capacities on the network is presented and studied. In the proposed model, capacity and flow assignments for each network operating state are jointly optimized. We prove the -hardness of the optimisation problem defined by dual constraints. Then, we propose a polynomial relaxation along with a fast heuristic to compute a feasible solution of the problem from its relaxed optimal solution. Our solution approaches are tested on a set of problem instances.Received: September 2002, Revised: July 2003, AMS classification: 90C05     

自管理机密网络的分布式匿名路由协议

针对数据传输时所需通信分析暴露通信者身份及相互关系的问题,采用混淆网络和洋葱路由来掩饰其真实通信,通过建立匿名路径来防止通信中的流分析,但所有路由器需要通过交换路由信息了解整个网络的拓扑结构.提出一种分布式匿名路由协议.该协议不需要任何节点收集和存储网络拓扑信息.模拟结果表明该协议具有较好的可扩展性.     

基于基站辅助定位的无线传感器网络通信协议

无线传感器网络受应用场合和节点结构的限制，要求算法具有低功耗和低复杂度等特点．为此提出了一种基于基站辅助定位的组网算法和路由协议，利用基站对抛撒区域扫描完成网络节点定位和分簇，节点只需接收基站发送的控制信息，节省了通信和计算开销，根据节点剩余能量和信号强度选举簇头、网关，形成以基站为根节点的路由树，减小了成员节点与簇头、簇头与簇头间的通讯耗能，路由协议中定义了源数据包和转发数据包两种数据格式，以实现数据从节点到基站的传输．在此基础上，研究了不同场景下网络的生存期和节点剩余能量、仿真结果表明提出的组网和路由协议能够均衡节点能耗，有效延长网络的生存期．     

A Genetic Algorithm for Delay-constrained Least-cost Multicast Routing

The delay-constrained least-cost multicast routing problem is introduced and then a related genetic algorithm is proposed. Finally, simulation results are shown to prove that the genetic algorithm is fast and effective.