基于局部梯度场的VANET路由研究

车载自组织网络(VANET,Vehicular Ad hoc Network)近几年受到高度关注,同时多跳安全消息路由成为VANET应用的核心问题之一。试图借助梯度场的方法,研究VANET网络安全消息的定向、受限空间及拓扑动态变化条件的传播机制,以达到快速准确地传播安全消息的目的。提出了一种局部梯度场的路由协议(LGFR,Local Gradient Field Routing),并与城市场景下的贪婪边界无状态路由(GPSR,Greedy Perimeter Stateless Routing)和无线自组网按需平面距离矢量路由(AODV,Ad hoc On-DemandDistance Vector Routing)进行了对比。仿真结果表明,LGFR在数据包丢包率、数据包端到端平均时延和全局数据吞吐量方面具有较好的性能。     

一种新的Ad hoc网络中基于位置的路由协议

该文提出了一种新的恢复策略来替代基于位置的路由协议中的面遍历算法。结合贪婪的转发策略和新的恢复策略,形成一种新的基于位置的路由协议。通过NS仿真器对新的路由协议和贪婪的周边无状态路由协议(Greedy Perimeter Stateless Routing, GPSR)进行了评估。实验结果表明,新的路由协议在平均的端到端时延、吞吐量和包传送率方面优于GPSR。     

一种贪婪地理路由协议的改进算法

贪婪转发策略广泛应用于无线传感网络(WSNs)的地理路由协议中,但是,该协议存在数据包丢失严重以及在遭遇路由空洞时路由效率低下的不足。为此,提出一种贪婪地理路由协议的改进算法,记为GPSR-I算法。GPSR-I算法在选择下一跳转发节点时,利用节点离目的节点距离、方向以及节点密度信息计算度量值,然后依据该度量值决策下一跳转发节点。仿真数据表明,与GPSR相比,GPSR-I算法能够有效降低平均端到端传输时延、路由开销,并提高了数据包传输率。     

一种适用于无线网络的AODV-MPR协议研究

为了降低无线自组网按需平面距离矢量路由(AODV)协议在维护路由时广播参数中源地址和目的地址均为本节点地址的路由应答报文(HELLO消息)时的网络开销,提出了一种基于广播中继(MPR)的AODV路由协议改进方案,对AODV的HELLO消息机制进行了改进,并在NS2中对改进协议和原AODV协议进行了对比仿真。仿真结果证明:改进的AODV协议在网络吞吐量、端到端时延和丢包率方面均优于原AODV协议。     

基于DSR的改进型综合源路由协议

在无线Mesh网络中,动态源路由(Dynamic Source Routing,DSR)协议是一种广泛应用的协议,其路由的建立与维护都从源节点发起。然而,由于DSR协议在路由发现与建立的过程中存在局限性,因此仍需要进一步研究。基于DSR协议通过引入一种综合了路径负载率、时延和跳数的负载均衡机制,并加入能量状态监控和多径路由,提出了一种改进型综合源路由协议(Improved Comprehensive Multi-path Source Routing,ICMSR),能够更好地实现网络负载均衡,节约网络能源,提升网络性能。最后,使用Opnet仿真验证了算法的有效性。仿真结果表明,改进协议在网络生存时间、分组投递率、端到端时延和网络吞吐量等性能指标上,相较于现有DSR协议都有较大的提升。     

AODV、AOMDV和AODV-UU路由协议性能仿真与分析

使用NS-2(Network Simulator Version 2)仿真软件,选取分组投递率、端到端平均时延、归一化路由开销和路由发现频率4个指标对按需距离矢量路由(AODV,Ad hoc On-Demand Distance Vector Routing)、多径按需距离矢量路由(AOMDV,Ad Hoc On-Demand Multipath Distance Vector Routing)和乌普萨拉大学开发的按需距离矢量路由(AODV-UU,Ad Hoc On-Demand Distance Vector Routing developed by Uppsala University)进行了性能仿真,通过改变节点最大运动速度和业务源连接对数分析比较这些参数对3个协议性能的影响,研究结果表明了AODV-UU协议的优越性。并提出了对AODV-UU协议的改进。     

一种位置信息辅助的Ad Hoc网络按需距离矢量路由协议

 针对Ad Hoc网络中按需距离矢量路由协议路由开销大,以及位置路由中位置信息在获取方式上存在的缺点,提出一种位置信息辅助的按需距离矢量路由协议(LAODV),协议结合AODV以按需的方式获取网络节点的位置信息,并以泛洪、位置信息修正的贪婪转发和局部受限泛洪相结合方式进行路由发现,同时提出了路由维护策略和局部多径备份路由策略。仿真结果表明,LAODV能够获得较好的分组递交率、时延和路由开销性能。     

无线Ad hoc网络中基于拓扑的功率感知路由协议

无线Ad hoc网络中的节点通常是由电池提供能量,高效的节能策略在网络性能中具有非常重要的地位。为了降低网络能量的消耗,该文提出了一种TPR(Topology-based Power-aware Routing)协议。TPR协议主要利用无线传输中的多跳节能特性,通过建立节点的功率高效邻居集合,并用该集合去控制路由请求报文的转发过程,从而得以建立节能路由。计算机仿真验证表明,相比于现有的节能协议,TPR协议在获得较好节能效果的同时,并能在路由开销、路由发现时间、端到端时延等方面取得较好的均衡。     

基于HWMP的先应树状路由算法研究

无线网状网是一种新兴的宽带无线网络接入技术,支持不同应用场景的无线接入。IEEE802.11s标准定义了一种默认的路由选择算法,称为混合无线网状网协议(HWMP)。HWMP将把树状路由为基础的先应路由模式和按需路由模式相结合。对先应路由模式进行改进,以减小网络开销,增强网络性能。从仿真结果可以看出,改进后的算法在数据包到达率、平均端到端时延和吞吐量指标上达到了更佳的性能。     

面向船舶AIS自组织网络的地理位置路由算法

针对船舶自动识别系统（Automatic Identification System,AIS）的自组织网络路由算法设计问题,提出了一种基于优化的贪婪边界无状态路由（Greedy Perimeter Stateless Routing,GPSR）的技术方案。该方案利用AIS时分多址接入协议,为消息报文提供信道接入方法。首先,设计了位置报文的自适应转发策略,使船舶节点根据网络环境自主决策位置报文的转发行为;其次,通过缩小GPSR贪婪转发的选择范围,减少了因节点运动导致的边缘路由失败情况。仿真结果表明,所提方案实现了AIS船舶节点的有效组网。与现有转发策略相比,自适应转发策略降低92.7%的位置报文转发量,并降低了79.6%的时隙冲突率,可有效提高网络资源的利用率。      

Mitigation and Performance Analysis of Routing Protocols Under Black-Hole Attack in Vehicular Ad-hoc Network (VANET)

Vehicular Ad-hoc network (VANET) is a self-organized ad hoc network. VANET becomes a most challenging research area as it has several issues related to routing protocols, quality of service, security, etc. Vehicular communication is critically unsafe to several kinds of active and passive routing attacks. This paper analyzes the impact of a compromised node (vehicle) on zone routing protocol and ad-hoc on-demand distance vector, and recommends a suitable solution called secure vehicular on demand routing to find out and mitigate the black hole attack. The given study analyses the effect of vehicle density on the average throughput, packet delivery ratio, end-to-end delay, normalized routing load and average path length.     

Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.     

Efficient on-demand routing for mobile ad hoc wireless access networks

In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the gateway via their neighboring nodes over multihop paths. On-demand routing schemes are appealing because of their low routing overhead in bandwidth restricted mobile ad hoc networks, however, their routing control overhead increases exponentially with node density in a given geographic area. To control the overhead of on-demand routing without sacrificing performance, we present a novel extension of the ad hoc on-demand distance vector (AODV) routing protocol, called LB-AODV, which incorporates the concept of load-balancing (LB). Simulation results show that as traffic increases, our proposed LB-AODV routing protocol has a significantly higher packet delivery fraction, a lower end-to-end delay and a reduced routing overhead when compared with both AODV and gossip-based routing protocols.     

An average velocity-based routing protocol with low end-to-end delay for wireless sensor networks

To reduce energy consumption, in most MAC protocols for wireless sensor networks, listen-sleep cycles are adopted. However, even though it is a good solution for energy efficiency, it may introduce a large end-to-end delay due to sleep delay, since a node with a packet to transmit should wait until the next-hop node of the packet awakes. To resolve this issue, in this paper, we propose the Average Velocity-Based Routing (AVR) protocol for wireless sensor networks that aims at reducing the end-toend delay. The AVR protocol is a kind of a geographic routing protocol that considers both location of a node and waiting time of a packet at the MAC layer. When a node can use information of n-hop away neighbor nodes, it calculates the n-hop average velocity for each of its one-hop neighbor nodes and forwards a packet to the neighbor node that has the highest n-hop average velocity. Simulation results show that as the knowledge range, n, increases, the average end-to-end delay decreases.     

基于NS2的无线自组织网络路由协议仿真

在无线自组织网络中,由于节点移动,网络拓扑结构变化频繁,所以路由协议的选择一直都是关键问题。该文采用NS2软件对两种主要的协议：动态源路由协议（DSR）和自组网按需距离矢量路由协议（AODV）进行了仿真。并且通过端到端延时、路由开销和分组投递率三种参数在不同条件下的数据对两种协议进行了评估。实验结果表明没有一种协议能够完全适用于自组网,对于特殊环境选择不同协议以满足需要。     

Buffered fixed routing: a routing protocol for real-time transportin grid networks

We propose a new routing protocol called buffered fixed routing (BFR) for real-time applications on grid networks. While previous routing protocols for grid networks have been designed to improve network throughput, the BFR scheme is proposed to guarantee the end-to-end packet delay and sequencing without loss by using finite buffers at each node. Thus the proposed scheme can satisfy quality-of-service (QoS) requirements of real-time applications. The BFR scheme uses the token on the row ring to provide QoS guarantees. The performance of the BFR scheme is analyzed by using the Geom/Geom/1 queueing system under uniform traffic. In the simulation, the BFR scheme shows the zero-loss, high-throughput performance with the minimum delay variation compared to other routing protocols such as store and forward routing, deflection routing and vertical routing. In addition, it has shown the smallest average delay at intermediate and heavy loads     

A hotspot mitigation protocol for ad hoc networks

Hotspots represent transient but highly congested regions in wireless ad hoc networks that result in increased packet loss, end-to-end delay, and out-of-order packets delivery. We present a simple, effective, and scalable hotspot mitigation protocol (HMP) where mobile nodes independently monitor local buffer occupancy, packet loss, and MAC contention and delay conditions, and take local actions in response to the emergence of hotspots, such as, suppressing new route requests and rate controlling TCP flows. We use analysis, simulation, and experimental results from a wireless testbed to demonstrate the effectiveness of HMP in mobile ad hoc networks. HMP balances resource consumption among neighboring nodes, and improves end-to-end throughput, delay, and packet loss. Our results indicate that HMP can also improve the network connectivity preventing premature network partitions. We present analysis of hotspots, and the detailed design of HMP. We evaluate the protocol’s ability to effectively mitigate hotspots in mobile ad hoc networks that are based on on-demand and proactive routing protocols.     

Ad hoc网络两种按需路由协议性能分析

Ad hoc网络是一种无需依赖于事先布设的基础设施,而仅依靠网络内部节点之间的协作,就能够完成节点间通信的网络。比较了Ad hoc网络两种主流的按需路由协议：动态源路由协议,自组网按需距离矢量路由协议。使用基于ns-2的仿真模型进行仿真,并通过分组交付率、平均端到端时延、标准化路由负荷、对两种按需路由协议进行评估。实验结果表明即使DSR和AODV协议都是按需路由协议,但它们采取的路由机制的不同,导致它们的性能表现的巨大差异。     

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

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

Congestion Aware Geographic Routing Protocol for Wireless Ad Hoc and Sensor Networks

Geographic routing protocols forward packets according to the geographical locations of nodes. Thus, the criteria used to select a forwarding node impacts on the performance of the protocols such as energy efficiency and end-to-end transmission delay. In this paper, we propose a congestion aware forwarder selection (CAFS) method for a geographic routing protocol. To design CAFS, we devise a cost function by combining not only the forward progress made to a packet but also the amount of energy required for packet forwarding, forwarding direction, and congestion levels of potential forwarders. Among the potential forwarders, CAFS selects the next forwarder having the minimum cost. In our simulation studies, we compare the performance of CAFS with those of the maximum progress (MP) method and the cost over progress (CoP) method in various network conditions. The results show that compared with MP, the length of a routing path in terms of the number of hops becomes longer when CAFS is used. However, the shorter hop distance helps to avoid unnecessary retransmissions caused by packet loss in a wireless channel. In addition, since CAFS considers congestion levels of candidate forwarders, it reduces the queuing delay in each forwarder. Therefore, CAFS is superior to the MP and the CoP in terms of the energy consumption, end-to-end packet transfer delay, and the successful packet delivery rate.