VANET中一种链路稳定度的计算方法

在车用自组织网络VANET中,由于移动节点运动速度快且移动受道路拓扑约束等影响,导致链路容易断裂。路由选择是实现VANET的关键技术之一,没有高效的路由选择算法,VANET就无法工作,链路稳定度是衡量路由算法性能的重要因素。基于概率思想提出一种链路稳定度的计算方法来衡量链路的健壮性及可靠性。实验结果表明,所提出的链路稳定度计算方法是一种适合VANET场景的计算方法。     

车载网中一种利用静态节点辅助的路由方法

车载自组织网络(Vehicular Ad Hoc Network,VANET)越来越引起人们的广泛关注,虽然该网络与传统的自组织网络有类似的地方,比如网络中的节点可以自组织和自管理。但是它有自己重要特征:网络中的节点具有很快的移动速度,由于这种高速的移动,造成车载网络拓扑结构频繁的变化,导致网络中多跳路由的频繁断开,进而对路由的可靠性和数据传输的质量带来很大的挑战。路由选择是实现VANET的关键。我们提出一种利用静态节点辅助的路由方法(Static-Node Assisted Routing,SNAR)来提高数据包的传输效率。模拟实验显示,SNAR在端到端延时等方面要优于其它的多跳路由方法。     

方向和位置泛洪的车联网区域路由协议

为提高车载自组网路由发现、数据传输效率,对区域路由协议进行改进。考虑到车载自组网（VANET）通信环境（道路布局、方向、位置等）多样性,通过判断节点间位置关系缩小泛洪区域,下一跳优先选择该区域内与源或目的节点移动方向相同的节点,进一步减少转发节点数目,以此精细化限制泛洪。为适应 VANET 拓扑频繁变化链路脆弱特性,目的节点优先选择相同移动方向节点数最多,且平均邻居节点数最多的链路,保证数据可靠传输。仿真结果显示：改进方案较好地克服了原协议全向洪泛引起的网络开销大、单一跳数路由选择导致的丢包率、重传率较高等缺点,能够较好地适应 VANET 网络通信。     

移动边缘计算环境下基于改进GPSR的VANET路由算法

针对车辆自组织网络(VANET,vehicular ad-hoc network)中现有路由协议存在的路由选择错误、丢包率较高、服务质量低等问题,提出了移动边缘计算环境下,结合改进贪婪周边无状态路由(GPSR,greedy perimeter stateless routing)和自适应链路质量评估的VANET路由算法;首先,结合边缘计算构建了VANET通信模型,对其车辆位置和速度进行系统的理论分析;将边缘计算架构应用于VANET能够有效缓解计算量大、与车辆有限且不均的资源分布之间的矛盾;然后,提出了基于节点移动速度和节点间距离的改进GPSR协议,通过自适应链路稳定性和链路传递速率评估来选择合适的中继节点,动态更新链路;通过SUMO仿真平台对路由算法的性能进行评估,实验结果表明,相对于其他算法,所提算法受车辆密度、交通流以及车辆相对速度的影响较小,且提高了分组传送率(车辆数为300时传送率达到92%),减少端到端延迟(交通流为5时延迟降低到1.5 s),从而降低了通信开销。     

基于模糊神经网络的稳定AODV协议改进方案

车载自组网的重要特征之一是节点的高移动性。针对节点的自由移动导致链路频繁断裂这一问题,在路由协议中选择稳定链路进行数据传输尤为重要。提出了一种具有链路稳定性的按需距离矢量路由协议（AODV）改进方案,即GF-AODV（AODV with GASA FNN）。该方案在路由发起和选择阶段,使用模糊神经网络对节点信息进行计算,得到节点稳定度以评估链路质量,并均衡考虑链路稳定性与跳数,选出稳定且跳数较小的路径。在路由维护阶段,针对实际环境使用遗传模拟退火算法对模糊神经网络的参数进行实时优化,以确保计算出的节点稳定度符合实际情况。实验表明,GF-AODV相对于AODV在平均时延、包投递率、路由开销等方面均有所改善。     

城市环境下跨层VANET路由协议研究

车载自组织网络(VANET)单一分层结构路由协议考虑因素较少,导致分组投递率低、端到端时延较高。为此,考虑车辆位置、速度、路口密度、无线链路质量、MAC层误帧率等影响因素,提出一种应用于城市环境的基于位置信息的VANET跨层路由协议(MCLPR)。设计路口车辆节点选择算法提取无线链路质量和MAC层误帧率的跨层信息,采用层次分析法计算各影响因素的权重值,确定最佳转发路径。仿真结果表明,与AODV,DSDV等路由协议相比,MCLPR路由协议具有较高的分组投递率及较低的端到端时延,保证了数据传输的可靠性与高效性,适用于网络密度与负载较大、车辆移动速度较快的城市环境。     

基于双转发机制的车载自组织网络路由算法

在车载自组织网络(VANET)中,节点高速移动性与动态拓扑快速变化会引起控制开销大、链路不稳定等问题.利用节点的位置、运动速度等信息,提出一种基于双转发机制的VANET路由算法.在路由寻路阶段,运用方向转发、动态概率转发限制路由请求(RREQ)包的洪泛广播.在路由回溯阶段,运用链路预测机制,选择路径失效时间最大的路径作为传输路径.在路由维护阶段,设置定时器,在路径断裂前触发新的路由寻路,寻找新路径替换即将断裂的旧路径.实验结果表明,与链路时间预测-按需路由算法以及无线自组织网络按需距离向量路由算法相比,该算法在转发的RREQ包数量、平均端到端延迟、传输吞吐率及报文投递率方面的性能较好.     

基于通信链路质量的无线HART图路由算法实现

图路由是无线HART提出的路由机制,目前对图路由算法的研究较少.提出了一种基于通信链路质量的无线HART图路由算法,引入路径稳定度作为判断链路质量的机制.采用基于路径稳定度的分层算法,保证跳数最少和通信可靠性;依据层间节点的路径稳定度选择层间路由,保证层间路由冗余性和可靠性,实现了无线HART的图路由算法,并应用到无线HART网络管理者中.     

一种改进的移动无线自组织网络路由算法

在节点高速移动或节点密度较大的移动无线自组织网络中,传统AODV算法在路由请求使用洪泛广播RREQ,选择路由跳数最少的链路,并没有考虑到网络拓扑的频繁变化导致的链路中断,在节点数量较多时其洪泛所导致的广播风暴将对网络性能产生影响。针对上述情形,提出了一种基于GPS信息和Q学习相结合的AODV改进算法,GQ-AODV算法同时考虑了节点位置和节点速度,通过节点位置计算偏差角度和前程值,节点与下一跳节点的相对速度来确定链路稳定度,采取下一跳节点与其邻居节点的平均相对速度、Q学习训练的下一跳节点与其邻居节点的历史平均相对速度,来避免下一跳选取陷入局部最优。NS3仿真表明,GQ-AODV算法能够选择较好的下一跳,降低了路由开销、时延和抖动,提高了分组投递率和吞吐量,在节点数目较多的场景下更具优势。     

高速移动网络中AODV路由协议的改进

在节点高速移动的网络环境中,网络拓扑结构变化频繁,易导致路由中断。传统的AODV路由协议选择跳数最少的路径作为路由,而不考虑链路的稳定情况,并且只在路由中断后才开始路由修复,因此,无法适应节点高速移动的网络环境。针对上面存在的问题,提出一种对AODV进行改进的协议。该协议在选择路由时,考虑节点接收信号功率、路由跳数和节点剩余能量等因素,在路由维护阶段引入链路状态预测机制,使路由在失效前启动局部路由修复。仿真结果表明,相对于传统AODV协议,该改进协议提高了数据包的投递率,缩短了端到端的传输时延,能更好地适应节点高速移动的网络环境。     

Optimal phase searching of PTS using modified genetic algorithm for PAPR reduction in OFDM systems

In this paper,a novel genetic algorithm assisted partial transmit sequence(NGA-PTS)is proposed to reduce the peak-to-average power ratio(PAPR)of orthogonal frequency division multiplexing(OFDM).However,the search complexity of the optimum PTS(OPTS)scheme is too large for the typical number of sub-blocks.Therefore,some artificial intelligence methods,such as genetic algorithm technique,and particle swarm optimization,are introduced to reduce the complexity.As traditional GA-PTS(TGA-PTS)technique risks finding a suboptimal solution,how to avoid this disadvantage of TGA-PTS is an interest topic.In order to obtain a better suboptimal solution,a phase factor optimal pair technique and an abandon/introduction new chromosome technique are proposed in GA here.Simulation results show that the proposed scheme achieves a significant improvement over the TGA-PTS scheme in PAPR.Furthermore,by use of the inherent diversity of constellation for each OFDM candidate,in the receiver part,the proposed scheme enables data recovery without any side information.Simulation results show the efficiency of the proposed scheme.     

一种基于AODV改进的城市车载自组网路由协议研究

针对城市环境下车载自组网的特点及AODV协议广播式路由探测的不足,采用贪婪转发的单播式路由探测和经典AODV协议的广播式路由探测相结合的路由探测方式,并且单播路由探测在选择下一跳转发节点时同时考虑贪婪转发和链路稳定两个因素,减少了广播帧的发送,提高了路由的稳定性。仿真实验表明,改进后AODV协议比经典AODV协议更加适合城市车载自组网。     

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

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

An energy-efficient geographic routing protocol design in vehicular ad-hoc network

The combination of vehicles and wireless communication has resulted in a promising future for vehicular ad hoc networks (VANETs). The VANET is a kind of network that can be built randomly, quickly and temporarily without any infrastructure. The routing of data in a VANET is a challenging task due to the high dynamics, unstable connection environments and transfer direction limit (real road planning) involved. However, it has been discussed that radio obstacles, as found in urban areas, have a significant negative impact on the performance of location based routing. Therefore, the design of a suitable routing protocol for VANETs is an important issue, especially in regard to inter-vehicle communication applications. This paper proposes a energy-efficient geographic routing algorithm that uses the direction, density and distance between nodes in the crossroad routing strategy, to improve the link stability. We compare the novel scheme, ad hoc on-demand distance vector, and dynamic source routing (DSR) for packet loss rate and average end-to-end delay in VANETs to reduce the power consumptions. The simulation results are obtained which demonstrate the power effectiveness of our proposed routing strategy.     

Fuzzy-Based Secure Clustering with Routing Technique for VANETs

Due to the advanced developments in communication technologies, Internet of vehicles and vehicular adhoc networks (VANET) offers numerous opportunities for effectively managing transportation problems. On the other, the cloud environment needs to disseminate the emergency message to the vehicles which are consistently distributed on the roadway so that every vehicle gets the messages from closer vehicles in a straightforward way. To resolve this issue, clustering and routing techniques can be designed using computational intelligence approaches. With this motivation, this paper presents a new type-2 fuzzy sets based clustering with metaheuristic optimization based routing (T2FSC-MOR) technique for secure communication in VANET. The T2FSC-MOR technique aims to elect CHs and optimal routes for secure intercluster data transmission in VANET. The proposed model involves T2FSC technique for the selection of CHs and construction of clusters. The T2FSC technique uses different parameters namely traveling speed (TS), link quality (LQ), trust factor (TF), inter-vehicle distance (IVD), and neighboring node count (NCC). The inclusion of trust factor helps to select the proper cluster heads (CHs) for secure data dissemination process. Moreover, trust aware seagull optimization based routing (TASGOR) approach was derived for the optimal selection of routes in VANET. In order to validate the enhanced performance of proposed technique, the set of simulations take place and the outcomes are examined interms of different measures. The experimental outcomes highlighted the improved performance of the proposed model over the other state of art techniques with a higher throughput of 98%.     

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.