基于位置信息的移动P2P路由发现策略

由于EDSR路由协议在路由选择时采取向邻居节点全部转发路由信息的策略,在路由请求时,容易引起转发次数过多而导致网络瘫痪。提出了借助LAR协议利用目的节点的位置信息设置路由的期望域,从而构建路由选择区域,提高发起路由请求时预知目的节点位置的几率。提出了增强性LAR路由协议。当位置辅助路由协议发现路由失败时避免采用全网洪泛机制,采用基于距离的位置路由改进算法,设置距离更新门限来达到节点位置信息实时性与更新负载的平衡,通过路由选择权重值Qpath使路由选择达到最优。     

基于位置信息的移动P2P路由发现策略

由于EDSR路由协议在路由选择是采取向邻居节点全部转发路由信息的策略,在路由请求时,容易引起转发次数过多而导致网络瘫痪。本文提出借助LAR协议利用目的节点的位置信息设置路由的期望域,从而构建路由选择区域,提高发起路由请求时预知目的节点位置的几率,提出增强性LAR路由协议。当位置辅助路由协议发现路由失败时避免采用全网洪泛机制,采用基于距离的位置路由改进算法,设置距离更新门限来达到节点位置信息实时性与更新负载的平衡,通过路由选择权重值Qpath使路由选择达到最优。     

无线Mesh网络路由协议研究

无线网状网络(WMN)的路由算法是Mesh领域的研究重点,采用何种路由协议使无线Mesh网络在需要的环境中性能达到最优,是目前WMN路由协议应用的实际问题.文中提出了设计无线网状网路由协议时需具备的特点,对目前提出WMN路由协议进行了分析研究,并比较了WMN路由协议优缺点,对WMN路由协议的选择提供了依据.     

典型航空自组网路由协议仿真与性能评估

航空自组网是自组网在航空领域的典型应用.航空自组网的关键技术在于路由协议的选取和设计.基于场景用NS2软件仿真研究了3种适用于航空自组网的路由协议及其网络性能,并定义了4个性能评估准则.仿真结果表明,单跳距离一定时,3种路由协议的网络性能随着节点密度的增加而总体变差.同等条件下,AODV路由协议路由开销高于DSVD和GRID路由协议,端到端平均延时低于DSVD和GRID路由协议,而GRID协议分组投递率和平均跳数保持最高.     

Windows NT网络中软件路由功能的实现

介绍了RIP路由协议,讨论了在网络中实现路由功能的可能途径,给出了在Windows NT网络中实现软件路由的具体方法.     

多跳无线Ad hoc网络路由协议的模拟和性能比较

文中采用随机场景的模拟方法对3种多跳无线Ad hoc网络路由协议的性能做了定量性的分析.对网络模拟器NS-2做了更进一步的拓展:增加SASR路由协议、增加AODV的MAC层虚拟HELLO机制,在此基础上对路由协议AODV,DSR和SASR进行了模拟.模拟结果显示:3种路由协议都能适应网络的拓扑结构变化,但是SASR和AODV路由协议在多跳无线Ad Hoc网络仍然具有相对的优越性.     

基于定位的移动Adhoc网络路由技术

路由协议是移动Ad hoc网络(MANET)研究的一个热点.传统的MANET的路由协议都是基于图形学建模的,只能获知各个节点之间的连通关系,而不能获知节点之间地理位置的关系.本文将要介绍基于定位的MANET路由协议,这些协议利用定位信息,从各方面改善MANET路由协议的性能.     

互联网BGP路由可视及安全检测技术架构与实践

边界网关协议（border gateway protocol,BGP）是支撑互联网50年来快速发展的核心协议,因早期设计考虑不足一直存在路由劫持、路由泄露等路由安全威胁漏洞。随着互联网应用日益深入,BGP 路由安全问题逐渐引起业界重视,边界网络安全防护意义重大。提出了一种BGP路由安全检测架构,通过推理构建全球BGP路由知识库实现互联网全局路由可视性,并基于此实现路由劫持、路由泄露等路由安全事件的准实时检测。通过在杭州交换中心部署实践,证明本系统可构造较完整的互联网全局路由知识库、实现较准确和实时的BGP路由安全事件检测。     

一种改进的无线自组网DSR路由协议

DSR路由协议中很多相邻节点的"路由应答"无法到达源节点,因此向这些节点广播"路由请求"产生了不必要的耗费.如果选择相对于源节点移动性较弱的相邻节点进行"路由请求",则可比较稳定地获得"路由应答".仿真结果显示,改进后的DSR(M-DSR)路由协议在路由发现时间、路由长度、路由错误、传播路由请求、路由应答等方面的性能较DSR路由协议有明显的改进.     

GDSR：一种基于车载自组网的分组路由协议

针对DSR路由协议因节点频繁移动,路由发现和路由维护过程频繁发生,导致数据传输的时延增加和丢包率增加的问题.在DSR路由协议基础上,提出一种带有分组的DSR路由协议（GDSR）.该协议通过K-medoids聚类算法合理地选择组头,使得分组路由协议更加适合车载自组网的多变的拓扑结构.仿真结果表明,带有分组的GDSR路由协议能够降低数据传输的端到端的时延和丢包率.     

一种改进的LAR方向路由算法

针对LAR算法因请求区域过小而漏选最佳路由的情况,提出改进型方向路由算法IM_LAR,通过增加很小的路由请求负载以确保选择到最佳路由.仿真结果表明,IM_LAR算法应用于节能路由算法时,具有很好的节能性能.     

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

Vehicular ad hoc networks is an integral component of intelligent transportation systems and it is an important requisite for smarter cities. Network formation and deformation among the vehicles are very frequent because of the variation in speed. Furthermore, for safety applications, messages should not face any kind of delay or collision. Therefore, establishing communication between the vehicles becomes even more challenging. Position‐based routing protocols work productively in vehicular ad hoc networks. Only finding an efficient routing protocol does not solve our purport. We need to carefully examine the effect of media access control layer parameters additionally. In the event of collisions, a large number of nodes would be re‐transmitting rather than sending fresh packets. A node busy in sending the retransmitted packet is called a backlog node. With an increase in the number of collisions, number of backlog nodes also increases, which affects the delay and throughput. In this article, we present the mathematical modeling of delay and throughput with IEEE 802.11 distributed coordination function (at media access control layer) for directional‐location aided routing (D‐LAR) position based routing protocol. For performance evaluation, simulation has been done in realistic environment created with SUMO (traffic simulator) and NS‐2 (network simulator). Simulation results show the comparison between D‐LAR and location aided routing (LAR) on various metrics in terms of delay, packet delivery ratio, routing overhead, throughput, and collision probability. To validate the mathematical model, analytical results has been compared with simulation results. The results confirm that performance of D‐LAR is better than LAR in terms of increasing the throughput and reduction in routing overhead and delay.     

一种实现LAR协议的路由器架构设计

LAR （Location-Aided Routing）协议是一种适用于无线移动自组网的路由协议.介绍了当前传统的路由器架构,实现LAR协议路由器的需求,并提出了一种实现LAR协议的、基于Linux架构的路由器架构设计.     

LAKER: learning from past actions to guide future behaviors in ad hoc routing

In this paper, we present a location aided knowledge extraction routing (LAKER) protocol for mobile ad hoc networks (MANETs). The novelty of LAKER is that it learns from past actions to guide future behaviors. In particular, LAKER can gradually discover current topological characteristics of the network, such as population density distribution, residual battery map, and traffic load status. This knowledge can be organized in the form of a set of guiding routes, each of which consists of a chain of guiding positions between a pair of source and destination locations. The guiding route information is learned by individual nodes during route discovery phase, and it can be used to guide future route discovery processes in a more efficient manner. LAKER is especially suitable for mobility models where nodes are not uniformly distributed. LAKER can exploit topological characteristics in these models and limit the search space in route discovery processes in a more refined granularity than location aided routing (LAR) protocol. Simulation results show that LAKER outperforms LAR and DSR in term of routing overhead, saving up to 30–45% broadcast routing messages compared to LAR approach. Copyright © 2006 John Wiley & Sons, Ltd.     

Sociological orbit aware location approximation and routing (SOLAR) in MANET

Mobility affects routing protocol performance in a Mobile Ad Hoc NETwork (MANET). This paper introduces a novel concept of “macro-mobility” information obtained from the sociological movement pattern of MANET users, and proposes a routing protocol that can take advantage of the macro-mobility information. This macro-mobility information is extracted from our observation that the movement of a mobile user exhibits a partially repetitive “orbital” pattern involving a set of “hubs”. This partially deterministic movement pattern is not only practical, but also useful for locating nodes without the need for constant tracking and for routing packets to them without flooding.More specifically, this paper makes the following two contributions. First, it proposes an ORBIT mobility framework to achieve this macro-level abstraction of orbital movement. Second, to take advantage of this hub-based orbital pattern, it proposes a Sociological Orbit aware Location Approximation and Routing (SOLAR) protocol. Extensive performance analysis shows that SOLAR significantly outperforms conventional routing protocols like Dynamic Source Routing (DSR) and Location Aided Routing (LAR) in terms of higher data throughput, lower control overhead, and lower end-to-end delay.     

基于空间位置和场景的Ad Hoc路由协议

在移动Ad Hoc网络中,基于拓扑的路由易发生链路断开,基于地理位置的路由易产生拓扑洞,这都会大大降质路由算法的性能,甚至会出现路由失败的问题.为此文中提出了基于空间位置和场景的Ad Hoc路由协议.该协议算法采用构建空间模型,将场景知识引入路由过程的方法,通过在路由前规避拓扑洞来改善和提高路由性能.仿真结果表明在网络连通度适当的条件下,新的路由协议算法可行和有效的.     

OLSR路由协议的功率补偿机制研究

针对物联网无线传感器监测系统,研究了适合稀疏分布传感器节点下的无线路由OLSR协议,并对传统OLSR路由协议进行改进。在网络高可靠性要求和节点分布不均的情况下,引入了功率补偿机制和自主切换机制,并对改进后的协议通过NS2进行了仿真实验。实验结果表明,该协议在可靠性和时延方面均有所提高,达到了提高稀疏节点无线路由网络系统性能的目的。     

多速率移动Ad hoc网络路由策略研究

在多速率Ad hoc网络中，要充分利用多速率的优势，提高网络的整体性能，妊须设计一种适合网络特点以及满足用户需要的多速率路由策略。文中简要分析了多速率路由策略对网络性能的影响，重点介绍了现有的多速率路由策略。论文还给出了后续的工作——对在多频段和多模式的无线网络中采用改进的多速率路由算法的研究。