一种基于可靠性的车载自组织网络路由算法

提出了一种改进的GPSR路由算法.该算法在选择转发节点过程中同时考虑位置和方向,进而提高转发节点选择的正确性来增加通信链路可靠性.用VanetMobisim交通仿真软件构建真实的VANETs网络城市场景,结合NS-2进行仿真研究,结果表明,和传统GPSR算法相比,改进的GPSR路由算法在端到端时延影响不大的条件下,能够有效地提高数据包传递率,降低数据丢包率.因此,改进的GPSR协议更适用于对实时性要求不高、而对可靠性要求较高的VANETs网络.     

Routing in Sparse Vehicular Ad Hoc Wireless Networks

A vehicular ad hoc network (VANET) may exhibit a bipolar behavior, i.e., the network can either be fully connected or sparsely connected depending on the time of day or on the market penetration rate of the wireless communication devices. In this paper, we use empirical vehicle traffic data measured on 1-80 freeway in California to develop a comprehensive analytical framework to study the disconnected network phenomenon and its network characteristics. These characteristics shed light on the key routing performance metrics of interest in disconnected VANETs, such as the average time taken to propagate a packet to disconnected nodes (i.e., the re-healing time). Our results show that, depending on the sparsity of vehicles or the market penetration rate of cars using Dedicated Short Range Communication (DSRC) technology, the network re-healing time can vary from a few seconds to several minutes. This suggests that, for vehicular safety applications, a new ad hoc routing protocol will be needed as the conventional ad hoc routing protocols such as Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) will not work with such long re-healing times. In addition, the developed analytical framework and its predictions provide valuable insights into the VANET routing performance in the disconnected network regime.     

一种基于竞争转发的城市场景车载 Ad Hoc网络路由算法

 论文提出了一种适用于城市场景下的基于竞争转发的车载Ad hoc网络路由算法,算法摒弃了HELLO消息的使用,利用分布式的竞争策略根据邻居节点所处的地理位置信息进行下一跳节点的选择.数据转发使用选定点路由同时利用了实时的道路交通信息和网络拓扑结构信息进行选定点选择.采取暂存转发策略处理网络分割现象.仿真结果表明该算法比其他类似算法具有更高的数据包递交率和较低的数据延迟.     

车载自组织网络中基于贪婪算法能地理位置路由

车载自组织网络（VANET）技术发展迅速,但由于其特殊的节点类型和信道特性,采用传统AdHoc网络路由协议无法取得满意的性能。实现高速可靠的数据传输速率,需要研究新兴的路由算法。基于贪婪算法的地理位置辅助路由是目前VANET路由的主流思路。文章认为基于这类思路的协议利用车载GPS装置、电子地图和下一代网络导航技术,能使路由发现和建立的时间大大缩短;结合已知的道路拓扑结构,选择多跳传输的最优路径,能避免路边建筑物的屏蔽效应,改善信道条件;动态评估道路上的车流密度,选择可靠性最高的传输路径,能很好地降低传输时延,提高网络吞吐能力。     

城市场景下基于速度信息的VANET路由协议的改进

车载自组网络(Vehicular Ad Hoc Networks,VANET)是指道路上由车辆搭载的无线通信装置构成的一种特殊的多跳无线移动自组织网络。VANET在实现多种智能交通方面应用的同时,还能满足用户在乘车时的娱乐等舒适性的需求,近些年来已成为无线自组网络研究的新热点。总结了近些年来出现的主要VANET路由协议的核心路由机制及其优缺点,并分析了各种技术对路由协议性能的影响。其后给出了一种基于速度信息的VANET路由协议改进方法,并通过实验验证了将改进方法与GPSR协议结合可以提高路由路径的稳定性,减少了端到端的平均时延,降低了VANET网络中拓扑的高动态性对路由协议性能的影响。     

ACAR: Adaptive Connectivity Aware Routing for Vehicular Ad Hoc Networks in City Scenarios

Multi-hop vehicle-to-vehicle communication is useful for supporting many vehicular applications that provide drivers with safety and convenience. Developing multi-hop communication in vehicular ad hoc networks (VANET) is a challenging problem due to the rapidly changing topology and frequent network disconnections, which cause failure or inefficiency in traditional ad hoc routing protocols. We propose an adaptive connectivity aware routing (ACAR) protocol that addresses these problems by adaptively selecting an optimal route with the best network transmission quality based on statistical and real-time density data that are gathered through an on-the-fly density collection process. The protocol consists of two parts: 1) select an optimal route, consisting of road segments, with the best estimated transmission quality, and 2) in each road segment of the chosen route, select the most efficient multi-hop path that will improve the delivery ratio and throughput. The optimal route is selected using our transmission quality model that takes into account vehicle densities and traffic light periods to estimate the probability of network connectivity and data delivery ratio for transmitting packets. Our simulation results show that the proposed ACAR protocol outperforms existing VANET routing protocols in terms of data delivery ratio, throughput and data packet delay. Since the proposed model is not constrained by network densities, the ACAR protocol is suitable for both daytime and nighttime city VANET scenarios.     

一种适用于战术条件下的自组织网路由协议

应用于战术条件下的自组织网络,其拓扑具有长期稳定而短期突变的特性;其流量具有不均衡性,中心节点的流量比重较大.针对战术无线网络的这种特性设计了一种混合式路由协议(HRP),协议为近端节点采用先应式协议维护路由而为远端节点采用反应式协议维护路由,对远端节点的路由请求采用OLSR协议的MPR思想,限制反应式协议的路由开销.并且,在近端拓扑变化频度超过门限值后,发起针对繁忙节点的路由发现请求,保持到繁忙节点的路由常新,从而提高了路由命中率.仿真结果表明,应用HRP协议后,无论其选路质量还是应用层业务的时延和吞吐量指标都优于DSR和ZRP协议.     

Beaconing Approaches in Vehicular Ad Hoc Networks: A Survey

A vehicular ad hoc network (VANET) is a type of wireless ad hoc network that facilitates ubiquitous connectivity between vehicles in the absence of fixed infrastructure. Beaconing approaches is an important research challenge in high mobility vehicular networks with enabling safety applications. In this article, we perform a survey and a comparative study of state-of-the-art adaptive beaconing approaches in VANET, that explores the main advantages and drawbacks behind their design. The survey part of the paper presents a review of existing adaptive beaconing approaches such as adaptive beacon transmission power, beacon rate adaptation, contention window size adjustment and Hybrid adaptation beaconing techniques. The comparative study of the paper compares the representatives of adaptive beaconing approaches in terms of their objective of study, summary of their study, the utilized simulator and the type of vehicular scenario. After implementing the representatives of beaconing approaches, we analysed the simulation results and discussed the strengths and weaknesses of these beaconing approaches with regard to their suitability to vehicular networks. Finally, we discussed the open issues and research directions related to VANET adaptive beaconing approaches.     

城市环境下车载Ad Hoc网络路由协议研究

考虑到城市环境中障碍物对网络性能的重要影响,在NS2(Network Simulator version 2)中加入了代表障碍物的概率穿透模型,使仿真环境更接近真实环境。针对AODV(Ad hoc On-Demand Distance Vector Routing)协议应用在城市场景下的缺陷,提出了一种改进的AODV协议——GE-AODV(Geocast Enhanced AODV)协议,该协议是基于位置信息的协议,并采用了多播方式来转发控制信息。仿真表明,GE-AODV降低了网络时延和控制开销,提高了网络可靠性。     

A Pairing-Free Certificateless Signcryption Scheme for Vehicular Ad Hoc Networks

Vehicular ad hoe networks (VANETs) cre-ate an vital platform for communication between vehicles,which can realize accident warning,auxiliary driving,road traffi...     

车载网络中的数据分发策略

通过车载网络(VAETNs)能够有效提高交通管理系统(TMS)的数据传输。然而,由于通信距离短以及车辆的移动,完成VANETs中的数据传输是一项挑战任务。为此,提出基于复杂网络指标的数据传输(MCDD)策略。MCDD策略依据二跳邻居的信息,并通过介数中心性和度中心性两项性能指标选择转发节点,进而降低开销和缩短传输时延。仿真结果表明,相比于基于区划分的全-分布式流量管理系统(FTMS),MCDD策略的交通拥塞时间缩短了约48.95%,平均行驶速度提高了约8%。     

Scalable Routing Protocol for Ad Hoc Networks

In this paper we present a scalable routing protocol for ad hoc networks. The protocol is based on a geographic location management strategy that keeps the overhead of routing packets relatively small. Nodes are assigned home regions and all nodes within a home region know the approximate location of the registered nodes. As nodes travel, they send location update messages to their home regions and this information is used to route data packets. In this paper, we derive theoretical performance results for the protocol and prove that the control packet overhead scales linearly with node speed and as N ^3/2 with increasing number of nodes. These results indicate that our protocol is well suited to relatively large ad hoc networks where nodes travel at high speed. Finally, we use simulations to validate our analytical model.     

一种无线自组织网络动态路由协议

介绍了一种基于稀疏树的无线自组织网络动态路由协议,该协议采用了稀疏树路径生成算法来减少路由更新的数据量并减少网络链路的冗余,采用增量更新来降低路由协议开销并降低对传输带宽的占用,支持单向信道,采用快速路径查找算法消除网络拓扑动态变化过程中的环路与无穷计数问题。仿真结果显示它具有收敛快,开销小等特性,能够较好地适应窄带无线通信环境的需要。     

Associativity-Based Routing for Ad Hoc Mobile Networks

This paper presents a new, simple and bandwidth-efficient distributed routing protocol to support mobile computing in a conference size ad-hoc mobile network environment. Unlike the conventional approaches such as link-state and distance-vector distributed routing algorithms, our protocol does not attempt to consistently maintain routing information in every node. In an ad-hoc mobile network where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs' movement, we employ an associativity-based routing scheme where a route is selected based on nodes having associativity states that imply periods of stability. In this manner, the routes selected are likely to be long-lived and hence there is no need to restart frequently, resulting in higher attainable throughput. Route requests are broadcast on a per need basis. The association property also allows the integration of ad-hoc routing into a BS-oriented Wireless LAN (WLAN) environment, providing the fault tolerance in times of base stations (BSs) failures. To discover shorter routes and to shorten the route recovery time when the association property is violated, the localised-query and quick-abort mechanisms are respectively incorporated into the protocol. To further increase cell capacity and lower transmission power requirements, a dynamic cell size adjustment scheme is introduced. The protocol is free from loops, deadlock and packet duplicates and has scalable memory requirements. Simulation results obtained reveal that shorter and better routes can be discovered during route re-constructions.     

Privacy Addressing-Based Anonymous Communication for Vehicular Ad Hoc Networks

Vehicle ad-hoc network (VANET) technology is a basic component of the future intelligent transportation system. With the advances in modern information society, privacy issues have become important considerations. However, most routing proposals for VANETs lack privacy support, namely anonymity or pseudonymity and unlinkability aspects. This paper presents a novel privacy addressing-based anonymous communication approach for VANETs, which prevents eavesdroppers from identifying a particular vehicle by its address. The proposed scheme is a kind of end-to-end solution, so it can potentially be extended to work with many traditional routing protocols. Finally, the simulation results show that the proposed scheme outperforms previous approaches with privacy support in terms of protocol overhead and packet latency.     

Analytical Model for Connectivity in Vehicular Ad Hoc Networks

We investigate connectivity in the ad hoc network formed between vehicles that move on a typical highway. We use a common model in vehicular traffic theory in which a fixed point on the highway sees cars passing it that are separated by times with an exponentially distributed duration. We obtain the distribution of the distances between the cars, which allows us to use techniques from queuing theory to study connectivity. We obtain the Laplace transform of the probability distribution of the connectivity distance, explicit expressions for the expected connectivity distance, and the probability distribution and expectation of the number of cars in a platoon. Then, we conduct extensive simulation studies to evaluate the obtained results. The analytical model that we present is able to describe the effects of various system parameters, including road traffic parameters (i.e., speed distribution and traffic flow) and the transmission range of vehicles, on the connectivity. To more precisely study the effect of speed on connectivity, we provide bounds obtained using stochastic ordering techniques. Our approach is based on the work of Miorandi and Altman, which transformed the problem of connectivity distance distribution into that of the distribution of the busy period of an equivalent infinite server queue. We use our analytical results, along with common road traffic statistical data, to understand connectivity in vehicular ad hoc networks.      

基于QoS的Ad Hoc路由协议综述

Ad Hoc网络是由一组带有无线收发装置的移动终端组成的一个多跳的临时性自治系统。随着人们对通信业务要求的不断提高，对带宽、时延、误码率等性能参数提出了不同程度的保障要求，因此要求Ad Hoc网络能够为某些业务提供服务质量（QoS）保障。但由于Ad Hoc网络无线链路的时变特性、网络拓扑结构的动态变化、移动终端设备电池容量受限等特点，使其相对于固定无线网络及有线网络提供有保证且稳定的QoS保障要困难得多，非常具有挑战性。本文对目前几种基于带宽和时延约束的QoS路由协议进行了介绍。     

Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.