基于IPv6的低压电力线载波树型路由控制机制

将电力线载波通信网络应用于智能电网中,有效延长通信距离是亟待突破的技术难题。为此,提出一种基于IPv6的低压电力线载波树型路由机制,子网节点通过支持IPv6地址自动分配的分布式地址分配策略来构建载波网络层次转发树模型。中继节点以MAC头中的目的地址进行下一跳路由转发,并结合IPv6适配层中的Mesh头实现多跳路由寻址。在层次转发树中,中继节点只需存储与其子节点数相当的信息项即可实现子网内路由信息的快速生成。搭建了电力载波通信配电网树型拓扑结构测试平台,测试结果表明,该树型路由控制机制能够以较小的时延进行IPv6数据包的多跳转发,并有效延长了电力线载波通信距离。     

一种分布式路由表簇内广播传感器网络路由算法

通过分析现有无线传感器网络路由算法,结合大规模无线传感器网络的特点,提出了一种基于簇的分布式路由表簇内广播路由算法。详细介绍了簇间路由发现过程中簇内各节点间RREQ、RREP分组交互过程以及簇间路由算法,估计了簇间路由成本、路由表规模以及分组路由转发延迟。通过试验仿真验证,在增大网络规模的情况下,其路由表建立速度和路由规模上限均较传统算法具有明显的优势。     

交通信息采集传感器网络基于强化学习的路由

针对道路交通信息采集传感器网络网内数据的有效转发和汇聚问题,以节点剩余能量和通信链路的路径损耗作为路由选择的综合评价指标,基于Q学习算法实现了一种传感器网络自适应路由方法,通过Q表的查询实现了网内数据的路径选择和数据转发。仿真结果表明,各网络节点能够找到优化路径将数据转发至汇聚节点;同时能够有效的降低网络节点的平均能耗和减少数据包传输的平均跳数。在道路交通信息采集传感器网络中,基于Q学习的路由方法是可行的。     

基于路由树的分布式自适应动态多跳分簇路由协议

针对已有的分簇路由算法中存在的簇间路由路径选择不合理等问题,提出了基于路由树的分布式自适应动态多跳分簇路由协议DADMC。分簇阶段通过设置不同剩余能量的节点不同的延迟时间来让能量高的节点优先成为簇首。簇间路由路径的选择为以sink节点为根节点的动态路由树,每个节点从父节点中选择使得自己路由权值最小的节点作为下一跳。仿真实验结果表明,与已有的分簇路由算法相比,提出的算法可以更好地实现能耗均衡并延长网络生存时间。     

基于并行遗传蚁群算法的组播路由调度算法

组播是将信息从源节点同时发送到网络中多个目的节点的通信方式,这是网络规模日益增大,信息流量增大的必然结果.组播路由是用一点到多点的方式传送信息,组播路由问题已被证明是NP-Complete问题.文中结合遗传算法GA和蚁群算法ACA的优点,提出了一种并行的遗传蚁群算法GACA,并把该算法应用到求解组播路由问题中.GACA算法利用遗传算法的快速性、随机性、全局收敛性产生求解问题的初始信息素分布,通过选择,交叉,变异等遗传操作产生一组新的个体,然后再利用蚂蚁算法群体并行性、正反馈性、求解效率高的特点,实现组播路由优化选择.仿真实验结果表明,该算法不但实现了组播路由的全局优化,而且在时间效率上优于现有的组播路由算法.     

一种改进的应用层组播树构建和维护算法

针对传统的应用层组播算法存在的转发延时高、组播树重构的修复时间长等不足,提出了一种改进的应用层组播树构建和维护算法.在建立组播树的过程中,综合考虑了度数限制、延时和带宽要求等因素,通过启发式规则和度数计算,为各个节点从其候选父节点中选择综合性能最佳的节点进行连接;在树的维护中,针对节点的异常退出情况,进行了故障检测,最...     

分布式光伏发电系统监控网络路由重建方法

无线监控技术可为分布式光伏发电系统构建灵活可靠的监控网络。提出了基于分级扩散协议的监控网络的路由构建方法,针对监控网络中失效传感器节点（简称节点）造成的数据传输丢失问题,提出了基于二进制粒子群算法的监控网络路由重建方法,通过更换少量数目的节点,重建最多数目的路由路径。仿真结果表明,提出的方法有效地减少了监控网络数据传输的丢失,能提高监控网络运行的可靠性。     

免疫遗传算法在最优路径问题中的应用研究

针对多组播路由问题,应用免疫遗传算法的基本思想,提出了一种求解满足带宽-时延约束多组播路径问题的遗传算法.在算法中设计了一种基于节点连接路径的具有树状结构的染色体表示方法及可以实现树状染色体交叉和变异的算子.数值实验结果表明,提出的算法可以有效找到多组播路由问题的优化解.     

计算机网络组播路由算法的改进策略

高性能网络组播路由算法是目前计算机技术研究的重点和难点问题,本文介绍了组播路由算法的相关概念以及几种算法类型,探讨了计算机网络组播路由算法的改进策略。     

因特网路由选择算法分析

因特网的互联网协议层主要功能之一是路由选择,为适应链路业务流量的均衡和带宽的升级,它在算法上逐步更新,现已运行链路状态算法。在给出链路选择算法的相关概念之后,重点介绍距离向量路由选择算法的不足和链路状态选择算法的构思、实现方法及其主要特点。最后对移动主机、广播和组播路由选择算法的思路也予以简介。     

New dynamic routing algorithm based on MANET in the LEO/MEO satellite network

The features of low earth orbit/medium earth orbit (LEO/MEO) satellite networks routing algorithm based on inter-satellite link are analyzed and the similarities between satellite networks and mobile Ad Hoc network (MANET) are pointed out. The similar parts in MANET routing protocol are used in the satellite network for reference. A new dynamic routing algorithm based on MANET in LEO/MEO satellite networks, which fits for the LEO/MEO satellite communication system, is proposed. At the same time, the model of the algorithm is simulated and features are analyzed. It is shown that the algorithm has strong adaptability. It can give the network high autonomy, perfect function, low system overhead and great compatibility. __________ Translated from Journal on communications, 2005, 26(5): 50–62 (in Chinese)     

Contact modeling and prediction-based routing in sparse mobile networks

Mobile ad-hoc networks (MANETs) provide highly robust and self-configuring network capacity required in many critical applications, such as battlefields, disaster relief, and wild life tracking. In this paper, we focus on efficient message forwarding in sparse MANETs, which suffers from frequent and long-duration partitions. Asynchronous contacts become the basic way of communication in such kind of network instead of data links in traditional ad-hoc networks. Current approaches are primarily based on estimation with pure probability calculation. Stochastic forwarding decisions from statistic results can lead to disastrous routing performance when wrong choices are made. This paper introduces a new routing protocol, based on contact modeling and contact prediction, to address the problem. Our contact model focuses on the periodic contact pattern of nodes with actual inter-contact time involved, in order to get an accurate realization of network cooperation and connectivity status. The corresponding contact prediction algorithm makes use of both statistic and time sequence information of contacts and allows choosing the relay that has the earliest contact to the destination, which results in low average latency. Simulation is used to compare the routing performance of our algorithm with three other categories of forwarding algorithm proposed already. The results demonstrate that our scheme is more efficient in both data delivery and energy consumption than previously proposed schemes.     

Adaptive routing algorithm for network load balancing

This paper introduces a routing algorithm which distributes the network traffic for each feasible route based on the reinforcement learning scheme. The aim of this algorithm is to reduce the transfer delay caused by congestion of the network. Most routing algorithms based on the reinforcement learning scheme could not avoid forwarding traffic toward the source of data packets. This property creates transfer loops and a lot of packet loss. In particular, the transfer loop may cause change in the order of packets, and also retransmit on the TCP connection. Thus, we employ a method that estimates the lower boundary of the probability for valid route to the destination, and this lower boundary can be used to reject the routes which cause the transfer loop. © 2011 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

一种有效的具有负载意识的按需路由协议

移动Ad hoc网络是由一组无线移动终端构成的临时性网络,不依赖于固定的基站或现有的有线骨干网。由于网络拓扑结构动态变化的特性和网络资源的有限性,开发一种性能优越的Ad hoc网络路由协议是一项具有挑战意义的工作。在本论文中,提出了一种有效的具有负载意识的按需驱动路由方案。该方案将网络负载信息作为路由选路的主要标准。对提出的方案作了仿真,并且和Dynamic Source Routing（DSR）协议进行了比较。结果表明网络负载在总体上得到了平衡,包传递率和平均端到端时延的性能也得到了有效的改善。     

软件定义网络的流量调度算法研究

目前,NOX、FloodLight等SDN控制器均提供了类似于传统路由器OSPF协议的最短路径转发算法,这些算法通过SDN控制器收集全局交换机静态参数从而进行路径计算,但并没有利用SDN系统的优势即获得运行时的动态信息来优化算法性能,在流量过大时传统算法容易导致网络拥堵。对SDN的路由算法进行研究,应用粒子群算法并利用SDN技术的特点对网络的负载均衡问题进行相关的优化。仿真实验表明与ECMP算法相比,提出的算法可以在一定程度提升网络的整体利用率,降低网络的时延和拥塞。     

无线传感器网络GPSR路由协议研究

随着定位技术的发展,基于地理位置的路由协议受到广泛的关注与研究。分析了无线传感器网络中地理位置路由协议GPSR的特性,详细阐述了GPSR协议中的贪婪转发及信标发送机制,遇到路由空洞时的局部优化问题,边界转发中所使用的右手法则和平面拓扑图的构造以及边界转发的实现等问题。     

Application layer multicast routing solution based on genetic algorithms

Application layer multicast routing is a multiobjective optimization problem. Three routing constraints, tree’s cost, tree’s balance and network layer load distribution are analyzed in this paper. The three fitness functions are used to evaluate a multicast tree on the three indexes respectively and one general fitness function is generated. A novel approach based on genetic algorithms is proposed. Numerical simulations show that, compared with geometrical routing rules, the proposed algorithm improve all three indexes, especially on cost and network layer load distribution indexes. __________ Translated from Control and Decision, 2006, 21(4): 381–384 [译自:控制与决策]