基于K-最近邻基站的移动手机自组网路由协议

通过分析AODV算法及其存在的问题,结合节点的移动速度和方向等信息, 提出了一种基于K-最近邻基站的移动手机自组网混合路由协议。在新协议中, 当网络的本地基础设施发生故障时,每个本地节点首先生成并维护一个K-最近邻基站信息表,然后基于该K-最近邻基站信息表,利用改进的AODV协议来进行按需路由。理论分析与仿真结果表明, 新算法的性能要优于传统的按需路由协议AODV,因此,更适合移动手机自组网中的路由。     

高端路由器CIDR表非关键字索引的B-Tree机制

不分类的互联网协议(IP)地址方式无类别域间路由(CIDR)可以解决高端路由器中路由匹配延
迟问题. 通过对CIDR表深入分析,在参考数据库的非关键字索引方法和分割索引算法的基础
上,提出了一种满足CIDR表要求的非关键字索引的B Tree算法. 该算法首先对CIDR表的全
部前缀地址集合进行分割索引,分割后,CIDR表被改变成一种B Tree索引结构;然后按照I
P地址的非关键字对CIDR表进行快速查找. 仿真结果表明,本文算法更好地满足了快速查找I
P地址的需求.     

地理和交通信息感知的车载Ad Hoc路由

为提高数据包投递率和降低时延,提出了一种基于地理和交通信息的车载Ad Hoc网络(VANET
)路由算法. 该算法利用实时的道路交通信息和车辆移动位置预测进行数据转发,并采取暂存转发策略,同时能处理目的节点移动情况. 仿真结果表明,该算法比贪婪的周边无状态路由(GPSR)算法具有更高的数据包投递率和更低的时延.     

基于图论生成树的低压电力线通信路由方法

电力线信道的阻抗特性、信号衰减特性及噪声特性导致电力线通信的可靠性成为制约其广泛应用的重要因素。分析了低压配电网的物理拓扑结构和逻辑拓扑结构,结合我国低压集中抄表系统应用的工程特点,提出了一种基于图论生成树的电力线通信自动路由方法。该方法能够有效地建立起电力线通信网络路由,并根据信道变化动态地维护路由,保证了电力线网络的可靠性。实验测试表明了该路由方法的有效性、可靠性和实用性。     

无线Mesh网络中路由与信道联合分配研究

无线Mesh网络中路由器使用多射频接口并配备多信道传输能有效增加网络吞吐量及降低干扰。研究路由与信道分配问题的目的就是增加网络容量、减少延迟等。文中针对无线Mesh网络中多接口多信道的路由与信道分配问题做了统一考虑,根据路由约束、信道约束、干扰约束以及宽带约束建立了混合整数线性规划（MILP）模型,并提出了基于迭代搜索的启发式算法很好地解决了此问题。仿真结果表明该算法可以提高网络吞吐量,降低延迟。     

基于蚁群的Ad Hoc网络多路径路由的改进

在大规模的Ad Hoc网络中,带宽有限,并且节点移动会引起链路频繁中断,从而导致传输时延较大。针对这些缺点,文中提出了加入了链路失效预测的蚁群多路径路由算法LA-ACO （ Location Aided ACO）。通过蚁群算法的分布式计算来寻找多条路由,并利用多路径路由来进行数据包的负载平衡,同时进行链路失效的预测,利用蚁群的正反馈机制完成快速主动路由修复。在仿真得到的结果中可以发现,该算法有较好的寻优能力,并且适应于Ad Hoc网络的拓扑多变化的特性。     

A secure routing model based on distance vector routing algorithm

Distance vector routing protocols have been widely adopted as an efcient routing mechanism in current Internet,and many wireless networks.However,as is well-known,the existing distance vector routing protocols are insecure as it lacks of efective authorization mechanisms and routing updates aggregated from other routers.As a result,the network routing-based attacks become a critical issue which could lead to a more deteriorate performance than other general network attacks.To efciently address this issue,this paper,through analyzing the routing model and its security aspect,and presents a novel approach on guaranteeing the routing security.Based on the model,we present the security mechanism including the message exchange and update message security authentication mechanism.The suggested approach shows that the security mechanism can efectively verify the integrity and validate the freshness of routing update messages received from neighbor nodes.In comparison with exiting mechanisms(SDV,S-RIP etc),the proposed model provides enhanced security without introducing significant network overheads and complexity.     

Profile based routing in vehicular ad-hoc networks

One of the main problems in the VANET(vehicular ad-hoc network)routing algorithms is how to establish the stable routes.The link duration in these networks is often very short because of the frequent changes in the network topology.Short link duration reduce the network efficiency.Different speeds of the vehicles and choosing different directions by the vehicles in the junctions are the two reasons that lead to link breakage and a reduction in link duration.Several routing protocols have been proposed for VANET in order to improve the link duration,while none of them avoids the link breakages caused by the second reason.In this paper,a new method for routing algorithms is proposed based on the vehicles trips history.Here,each vehicle has a profile containing its movement patterns extracted from its trips history.The next direction which each vehicle may choose at the next junction is predicted using this profile and is sent to other vehicles.Afterward each vehicle selects a node the future direction of which is the same as its predicted direction.Our case study indicates that applying our proposed method to ROMSGP(receive on most stable group-path)routing protocol reduces the links breakages and increases the link duration time.     

基于SLA波长业务的ASON风险规避算法

为使智能光网络(ASON)在受灾时各等级协定(SLA)波长业务重获局向资源,研究了一种风险规避算法.首先通过构建动态损毁数学模型为不同SLA等级波长业务的连接分别设定稳定度阈值条件.然后借鉴启发式算法计算思想为受灾的各等级SLA波长业务分别制定自愈策略.再根据灾后通路资源需求变化设计带宽重置方案以保证灾后SLA业务的生存性.仿真表明,算法在稳健性、失效率、呼损率多指标中均有良好的优势.     

基于节点运动的机会网络路由算法

机会网络利用节点移动带来的接触机会传输数据,数据在节点运动过程中捎带转发,保证了节点独立性,但会给数据传输带来影响.以节点的运动特性为切入点,设计了基于运动的机会网络路由算法.综合考虑数据传输、数据内容以及应用需求等因素,设计了数据转发优先级评价模型,结合节点活动区间划分方案制定数据传输规则;设计了差异化副本传输策略,在数据传输效率和系统开销之间取得折衷;考虑了节点活动范围、中心度及能量水平,构建了运动自由度函数评估节点运动水平.在此基础上设计了效用函数,选择中继节点转发数据.仿真结果表明,该算法能够在满足传输要求的同时限制网络开销,提高分组投递率,降低传输时延.