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

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

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

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

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.      

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网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间逐渐成为衡量路由协议性能的重要指标.基于移动节点能量的不同级别,采取不同的转发策略,提出了一种基于能量感知的Ad Hoc网络路由协议--EARP.并与AODV协议进行了性能比较,仿真结果显示,EARP具有较低的能耗,较长的网络存活时间.     

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

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

一维车载Ad Hoc网络连接度分析

In this paper we analyze connectivity of one-dimensional Vehicular Ad Hoc Networks where vehicle gap distribution can be approximated by an exponential distribution. The probabilities of Vehicular Ad Hoc Network connectivity for difference cases are derived. Furthermore we proof that the nodes in a sub-interval [z1,z1 +Δz] of interval [0, z], z>0 where all the nodes are independently uniform distributed is a Poisson process and the relationship of Vehicle Ad hoc Networks and one-dimensional Ad Hoc networks ...     

一种稳健的城市场景车载Ad hoc路由策略

该文通过分析已有的适合城市场景的Ad hoc车载路由策略,发现其中的不足,提出一种新的稳健高效的路由策略,包括在交通岔口引入固定节点,采用二次选择路由方向,以及一系列有针对性的恢复机制。仿真结果表明,新的路由协议在城市场景中有较好的性能。     

SDR: A Stable Direction-Based Routing for Vehicular Ad Hoc Networks

A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.     

Inter Vehicle Distance Based Connectivity Aware Routing in Vehicular Adhoc Networks

Connectivity in vehicular traffic environment has witnessed significant attention due to the direct impact on the performance of most of the traffic safety applications of intelligent transport system. Various parameters such as density, speed, direction, link quality and inter vehicle distance (IVD) have been utilized for measuring connectivity. IVD has greater impact on connectivity and controls the impact of other parameters. Usage of real time IVD for measuring connectivity has not received sufficient attention in VANETs. This paper proposes IVD based connectivity aware routing (Ivd-CAR) for enhancing connectivity aware data dissemination. IVD calculation is robust and can effectively handle instantaneous GPS failure. Two localization techniques; namely, cooperative localization and Geometry based Localization are developed. Standard deviation of real time IVDs of a forwarding path is derived. Distribution of IVDs of a forwarding path is employed for estimating connectivity. Segment vehicle based next hop vehicle selection is utilized for incorporating network load, link quality and direction into consideration while selecting forwarding path. Simulations are carried out in ns2 to evaluate the performance of Ivd-CAR in realistic traffic environment. Comparative analysis of simulation results attests the superiority of Ivd-CAR to the state-of-the-art techniques: CSR and A-CAR.     

城市场景车载Ad Hoc网络竞争转发关键参数分析

 论文对城市场景下的基于竞争转发的车载Ad hoc网络路由算法进行了分析,该分析对于确定竞争转发策略中节点定时器的值具有重要的意义,是竞争转发路由策略的有益和重要的补充.论文给出了保证抑制策略以一定概率执行成功的条件下,节点定时器参数的下限值.仿真和分析结果的对比验证了本文分析的有效性.     

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

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

Transmission Power Control Aware Routing in Cognitive Radio Ad Hoc Networks

Abstract—Cognitive radio technology has drawn much attention since it is a promising candidate to efficiently utilize the scarce radio resources. However, cognitive radio introduces new challenges in the protocol stacks in wireless networks. This paper proposes a routing protocol for Cognitive Radio Ad Hoc Networks (CRAHNs), called Transmission Power Control aware AODV (TPC-AODV). TPC-AODV is based on Ad hoc On Demand Distance Vector (AODV) routing protocol. The main objectives of TPC-AODV are to avoid interruption of primary users’ communication and to support basic Quality of Service for secondary users. TPC-AODV takes inputs from both secondary users’ application requirements and the channel condition after spectrum sensing. These inputs enable secondary users’ communication with specific transmission power on the selected channel. Our simulation results show that TPC-AODV improves network performance in terms of throughput and delay compared to AODV in CRAHNs.     

Channel Adaptive Shortest Path Routing for Ad Hoc Networks

1　IntroductionAdhocnetworksareformedwithoutrequiringthepreexistinginfrastructureorcentralizedadminis tration ,incontrasttocellularnetworks.Asidefromtheoriginalmilitaryapplication ,ithasapplicationinpublicsafetyandcommercialareas,butadaptiveprotocolsarerequiredinorderforthemtodoso .Twoimportantcharacteristicsofacommunicationlinkinadhocnetworksareitsunreliabilityanditsvariability .Thelinksinsuchanetworkareunreli ablebecauseoffading ,interference,noise,andper hapsthefailureofthetransmittingorrec…     

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.     

SMART: Statistically Multiplexed Adaptive Routing Technique for Ad Hoc Networks

This paper develops a common solution to the problems of discovery, maintenance, and use of multiple routes in ad hoc networks. The performance criterion is the average time taken by a packet to reach its destination through multiple hops. A source node considers each of its neighbors (reachable by direct wireless transmission) as a next-hop for every possible destination. The effect of delay at a next-hop and beyond, until the packet reaches its destination, is approximately modeled as an equivalent M/M/1 queuing system. Available neighbors at every node provide multiple routes. Multiple routes are statistically multiplexed to distribute the load as well as to deal with changes in data rates and network configuration. The potential of each next-hop neighbor of a node in providing a viable route is estimated on-line and the proportions of traffic routed through these multiple neighbors are also updated adaptively.We study this approach and conduct extensive experiments over a network with two extreme cases of simulated traffic patterns, the Poisson, and the self-similar types. Even when the network topology is static, our algorithm responds to bursts in the traffic pattern and reduces buffer losses through the use of alternative, less congested routes. We also present simulation experiments and results to demonstrate the effectiveness of our algorithm in the presence of mobility, using self-similar traffic. Mobility is simulated by means of the random waypoint model in which nodes move with varying speeds. Results show that our simple unified approach handles the problems of mobility as well as network congestion very well.     

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

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

A-ADHOC: An Adaptive Real-time Distributed MAC Protocol for Vehicular Ad Hoc Networks

Vehicular Ad Hoc Networks (VANET) are the foundation of Intelligent Traffic System (ITS), and recently many MAC protocols for VANET are proposed, among which a reliable MAC protocol called ADHOC has aroused much attention. By investigating the details of ADHOC protocol, we have discovered several unsolved problems that might lead to network failure. In this paper, we provide a quantitative analysis of the success probability for contending nodes and prove that an adaptive frame length is quite necessary. We propose Adaptive-ADHOC (A-ADHOC) MAC protocol, which implements a robust mechanism supporting the adaptive frame length. Evaluation result shows that A-ADHOC can maintain a high contending success probability and obtain about 50% reduction of response time over original ADHOC protocol, while providing important enhancement on network scalability and robustness.