车载自组织网中基于车辆密度的可靠性路由协议

为了降低转发节点在转发范围内直接寻找一个最优或次优节点的复杂度、减少平均跳数和提高链路的可靠性,提出一种车载自组织网络中基于车辆密度的可靠性路由协议,转发节点首先根据道路车辆密度设置最优块的大小,并将转发范围分割成若干大小相等的块,然后选择其中一个距离转发节点最远的块,最后在被选中的块里根据可靠性原则选择连接时间最长的邻居节点作为中继节点进行转发。仿真结果表明,与EG-RAODV 相比,所提路由协议的平均跳数较少,平均每跳前进距离较大,能够使数据分组快速到达目的节点。     

基于深度强化学习的无人机可信地理位置路由协议

针对无人机(UAV)通信过程中存在的高移动性和节点异常问题,该文提出一种基于深度强化学习的无人机可信地理位置路由协议(DTGR)。引入可信第三方提供节点的信任度,使用理论与真实的时延偏差和丢包率作为信任度的评估因子,将路由选择建模为马尔可夫决策过程(MDP),基于节点信任度、地理位置和邻居拓扑信息构建状态空间,然后通过深度Q网络(DQN)输出路由决策。在奖励函数中结合信任度调整动作的价值,引导节点选择最优下一跳。仿真结果表明,在包含异常节点的无人机自组网(UANET)中,DTGR与现有方案相比具有更低的平均端到端时延和更高的包递交率。当异常节点数量或者比例变化时,DTGR能感知环境并高效智能地完成路由决策,保障网络性能。     

3D-VANET中基于模糊逻辑和Q学习的拓扑感知路由协议

城市三维车载自组网（Three-Dimensional Vehicular Ad-hoc Network,3D-VANET）中往往存在多种道路形式,每种道路网络拓扑变化特点各异,平面路由协议不能根据道路特点动态调整选路策略,不宜直接用于3D-VANET,为此设计了一种基于模糊逻辑和Q学习的拓扑感知路由协议。该协议通过模糊逻辑方法感知网络拓扑变化与网络负载情况动态调整信标间隔,以平衡邻节点信息准确性与控制开销成本。在此基础上,采用Q学习算法对网络建模,根据链路质量以及链路质量变化调整Q学习算法参数,以灵活选择下一跳转发节点,更好适应网络拓扑的频繁变化。仿真结果表明,与对比协议相比,该协议有利于降低控制开销,同时提高包投递率和减少平均端到端时延。     

基于路段连通性和方向转发策略的机会路由协议

文章针对车载自组织网络中由于道路拓扑的限制以及障碍物的存在导致车辆节点互相隐藏,造成的网络频繁连接中断的问题,综合考虑车辆位置、方向和速度、车辆密度信息,利用十字路口路段连通性和方向转发策略选择下一跳,提出了基于路段连通性和方向转发策略的车载机会路由协议。由仿真结果可知,在城市场景中,尤其当车辆节点比较稀疏时,本协议相比GPSR和GPCR协议具有更高的包投递率和较低的平均端到端传输时延。     

车载自组织网络中基于十字路口的地理感知路由协议

为了解决城市道路多十字路口,对单个车辆节点运动感知不敏感所带来的通信性能下降问题,提出一种车载自组织网络中基于十字路口的地理感知路由(IGPR)协议,通过网络网关选择道路十字路口,形成骨干路由,在保证高连通概率的同时满足时延和误比特率要求.在双向道路模型的基础上分析获得平均时延和平均跳数的数学计算式.仿真结果表明,IGPR协议与FRGR协议、VRR协议相比,传输时延小,跳数少,通信性能好.     

车载通信中增强型多跳广播算法研究

提出了一种高速公路场景下基于邻居信息的增强型多跳广播协议(enhanced neighbor information-based muti-hop broadcast protocol,ENIMBP),提出的协议利用车辆的邻居信息同时结合车辆的位置、行驶速度和方向来确定转发等待时间,以选择最优的转发车辆。根据车辆的位置,ENIMBP可以初步确定与广播车辆距离不同的车辆的转发等待时间。而在与广播车辆距离相同的情况下,ENIMBP则利用车辆速度和方向来区分转发等待时间。ENIMBP很好地解决了高速公路场景下的网络分割问题以及隐藏/暴露节点问题。仿真结果表明,在不同的车辆密度场景下,ENIMBP能显著地降低端到端时延,同时保持较好的分组到达率。     

车联网中基于动态传输距离的多跳稳定路由

数据传输是车联网(VANETs)实现交通安全的基础。然而,车辆的移动、信号传输的衰减以及彼此间的干扰对链路的可靠性均有影响。为此,提出基于动态传输距离的多跳稳定(DTMS)路由。DTMS路由在选择下一跳转发节点时,考虑到因衰减而导致的传输距离的变小,先估计车辆动态传输距离,再依据动态传输距离估计链路的连通时间以及距离因素,然后,计算邻居节点的权重,最后,基于节点权重值设置定时器,进而竞争产生下一跳转发节点。仿真结果表明,提出的DTMS路由有效地提高了数据包传输成功率。     

MANET中基于AODV的跨层多度量路由协议

针对无线自组网按需平面距离向量路由协议(AODV)路由度量的单一化而引起的节点能耗枯竭,形成的网络区域化以及路径拥塞问题,提出一种多度量路径选择机制的路由协议――M-AODV。以AODV路由协议为基础,在路由发现阶段,根据设定的能量阈值和接收信号强度阈值选择能量较高和信号强度较强的节点作为路由节点;在路径选择阶段,首先根据物理层的接收信号强度、拥塞度和跳数计算每段链路稳定值,其次将每段路径稳定值进行累加得到整条路径的稳定值,最后选择稳定值最大的路径作为最优路径。使用NS2.35仿真软件仿真,结果表明：改进后的协议与AODV相比在端到端延时缩短了近30%,在数据包传输率、吞吐量和节点存活率方面优于AODV和I-AODV-SE路由算法。     

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

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

基于智能加湿器的多跳路由寻址技术

在智能加湿器的设计中,运用到了多跳路由寻址技术,针对最短跳优先路由协议传输率低,以及链路质量决策因子太过单一导致高能耗等的问题,文章提出了一种基于链路质量的多跳路由寻址技术,链路质量指标主要由包接收率、传输延时决定,充分考虑了多方面影响,并用卡尔曼滤波对链路指标进行预测,实现路径的最优化选择,仿真表明,新算法提高了数据传输率及网络的生命周期。     

DIR: diagonal-intersection-based routing protocol for vehicular ad hoc networks

In this paper, we present a diagonal-intersection-based routing (DIR) protocol for vehicular ad hoc networks. The DIR protocol constructs a series of diagonal intersections between the source and destination vehicles. The DIR protocol is a geographic routing protocol. Based on the geographic routing protocol, source vehicle geographically forwards data packet toward the first diagonal intersection, second diagonal intersection, and so on, until the last diagonal intersection, and finally geographically reach to the destination vehicle. For given a pair of neighboring diagonal intersections, two or more disjoint sub-paths exist between them. The novel property of DIR protocol is the auto-adjustability, while the auto-adjustability is achieved that one sub-path with low data packet delay, between two neighboring diagonal intersections, is dynamically selected to forward data packets. To reduce the data packet delay, the route is automatically re-routed by the selected sub-path with lowest delay. The proposed DIR protocol allows the mobile source and destination vehicles in the urban VANETs. Experimental results show that the DIR protocol outperforms existing solutions in terms of packet delivery ratio, data packet delay, and throughput.     

RVCloud: a routing protocol for vehicular ad hoc network in city environment using cloud computing

Routing in Vehicular Ad hoc Network (VANET) is a challenging task due to high mobility of vehicles. In this paper, a RVCloud routing protocol is proposed for VANET to send the data efficiently to the destination vehicle using cloud computing technology. In this protocol, vehicle beacon information is send to the cloud storage through the Road Side Unit (RSU). As vehicles have less storage and computing facility, the information of all the vehicles moving in the city is maintained by the cloud. Source vehicle sends the data to the destination by sending the data to the nearby RSU. After receiving the data, RSU sends a request to the cloud for an optimal RSU information, that takes minimum packet forwarding delay to send the data to the destination. Cloud provides location service by providing destination location and optimal RSU information. Then RSU sends the data to the optimal RSU using internet. By using the internet facility, packet forwarding delay and link disruption problem are reduced. Simulation results show that, RVCloud performs better than VehiCloud, P-GEDIR, GyTAR, A-STAR, and GSR routing protocols.     

A delay‐bounded routing protocol for vehicular ad hoc networks with traffic lights

In vehicular ad hoc networks, vehicles may use a routing protocol to inform emergent events, for example, car accidents or traffic jams. Hence, many of the researchers are focused on minimizing the end‐to‐end delay of the routing protocol. However, some applications, for example, email or ftp, are not time critical, and radio spectrum is a limited resource. Hence, delay‐bounded routing protocol, whose goal is to deliver messages to the destination within user‐defined delay and minimize the usage of radio, has become an important issue. The delay‐bounded routing protocols deliver message to the destination by the hybrid of data muling (carried by the vehicle) and forwarding (transmitted through radio). When the available time is enough, the message will be delivered by muling; otherwise, it will be delivered by forwarding. However, in an urban area, there are many traffic lights, which may greatly affect the performance of the delay‐bounded routing protocols. Existing works do not consider the effect of traffic lights, and hence, it may adopt an improper delivery strategy and thus wastes much available time. To improve previous works, we propose a novel delay‐bounded routing protocol, which has considered the effect of traffic lights. Whenever a vehicle passes an intersection, it will gather the information of the traffic light and traffic load of the next road section, and thus, it can make a more accurate prediction and adopt a more proper strategy to deliver message. Simulation results show that the proposed protocol can make a better usage of the available time and uses less radio resource to deliver the message in time. Copyright © 2013 John Wiley & Sons, Ltd.     

基于路径时延模型的车联网数据分发方案

针对车联网的容迟特性造成通信资源受限的问题,提出了满足副本抑制要求的数据分发方案.方案利用马尔可夫链,通过交通网络的车辆概率分布建立路段的期望传输时延,并结合车辆的轨迹与目标位置的匹配度确定车辆的转发优先级.车辆为转发的每个数据包插入转发参数字段并通过同步反馈机制确定最终的转发车辆,确保由优先级最高的车辆完成转发.考虑到链路的稳定性,还推导了当前丢包率前提下,车辆接收数据包与发送次数之比,避免不必要的发送尝试产生大量副本.实验结果显示,提出的方案与基于轨迹预测的算法相比,有效提高了网络吞吐量和时延性能.     

A path selection based routing protocol for urban vehicular ad hoc network (UVAN) environment

Routing in urban environment is a challenging task due to high mobility of vehicles in the network. Many existing routing protocols only consider density, link connectivity, delay, and shortest path information to send the data to the destination. In this paper, a routing protocol is proposed which uses the urban road network information such as multi-lane and flyover to send the data to the destination with a minimum packet forwarding delay. The next path for data forwarding is selected based on a path value calculated by the Road Side Unit for each path connected to a junction. This protocol uses Ground Vehicle to Ground Vehicle (GV2GV) communication, Flyover Vehicle to Flyover Vehicle (FV2FV) communication, and Flyover Vehicle to Ground Vehicle/Ground Vehicle to Flyover Vehicle (FV2GV/GV2FV) communication to enhance the routing performance. Simulation results show that proposed protocol performs better than P-GEDIR, GyTAR, A-STAR, and GSR routing protocols in terms of end-to-end delay, number of network gaps, and number of hops.     

GMCAR: Grid-based multipath with congestion avoidance routing protocol in wireless sensor networks

Recently, the interest in wireless sensor networks has been magnetized in the delay sensitive applications such as real-time applications. These time critical applications crave certain QoS requirements as though end-to-end delay guarantee and network bandwidth reservation. However, the severe resource constraints of the wireless sensor networks pose great challenges that hinder supporting these requirements. In this paper, we propose a Grid-based Multipath with Congestion Avoidance Routing protocol (GMCAR) as an efficient QoS routing protocol that is suited for grided sensor networks. We employ the idea of dividing the sensor network field into grids. Inside each grid, one of the sensor nodes is selected as a master node which is responsible for delivering the data generated by any node in that grid and for routing the data received from other master nodes in the neighbor grids. For each master node, multiple diagonal paths that connect the master node to the sink are stored as routing entries in the routing table of that node. The novelty of the proposed protocol lies behind the idea of incorporating the grids densities along with the hop count into the routing decisions. A congestion control mechanism is proposed in order to relieve the congested areas in case of congestion occurrence. Simulation results show that our proposed protocol has the potential to achieve up to 19.5% energy saving, 24.7% reduction in the delay and up to 8.5% enhancement in the network throughput when compared to another QoS routing protocol. However, when compared to the basic grid-based coordinated routing protocol, it achieves 23% energy saving. In addition, the proposed protocol shows its superiority in achieving better utilization to the available storage.     

A Connectivity-Based Multi-Lane Routing Optimization Algorithm in Vehicular Communication

This paper proposed a connectivity-based multi-lane geographic routing protocol (CGRP) for vehicular ad hoc networks. The proposed CGRP is based on an effective selection of road intersections through which a package must pass from source to destination. The cooperative connectivity probability and delay are taken into consideration when choosing the most suitable path for delay-sensitive safety traffic. Analytical expressions for cooperative connectivity probability is derived based on a three-lanes path model. Geographical forwarding is used to transfer packets between any two intersections on the path, reducing the path sensitivity to individual node movements. Furthermore, forwarding packets between two adjacent intersections also depend on geographic location information. Neighbor nodes’ priority are assigned according to position, speed, direction and other factors. Node with the highest priority will be selected as the next hop. Numerical and simulation results show that the proposed algorithm outperforms the exsiting routing protocols in terms of the end-to-end delay and the number of hops with a little cost of routing overhead in city environments.     

Intersection-Based Routing Protocol for VANETs

Vehicular ad hoc network (VANET) is an emerging wireless communications technology that is capable of enhancing driving safety and velocity by exchanging real-time transportation information. In VANETs, the carry-and-forward strategy has been adopted to overcome uneven distribution of vehicles. If the next vehicle located is in transmission range, then the vehicle forwards the packets; if not, then it carries the packets until meeting. The carry mostly occurs on sparsely populated road segments, with long carry distances having long end-to-end packet delays. Similarly, the dense condition could have long delays, due to queuing delays. The proposed intersection-based routing protocol finds a minimum delay routing path in various vehicle densities. Moreover, vehicles reroute each packet according to real-time road conditions in each intersection, and the packet routing at the intersections is dependent on the moving direction of the next vehicle. Finally, the simulation results show that the proposed Intersection-Based Routing (IBR) protocol has less end-to-end delay compared to vehicle-assisted data delivery (VADD) and greedy traffic aware routing protocol (GyTAR) protcols.     

无线传感器网络路由协议的设计与实现

针对传统路由协议端到端时延长、丢包率过高的现实问题,提出了一种基于贪婪转发的能量感知多路径路由协议(Greedy Forward Energy-aware Multipath Routing Protocol,GFEMRP)。GFEMRP从传感器起始结点出发,如果遇到网络黑洞则选择周边转发方式,否则将选择吞吐量大、且更接近于目的结点的结点作为下一跳结点。利用了OMNET++5.0和INET框架对包括无线自组网按需平面距离向量路由协议(Ad hoc on-demand distance vector routing protocol,AODV),动态按需无线自组织网络(Dynamic MANET On-demand,DYMO),贪婪周边无状态路由无线网络(Greedy Perimeter Stateless Routing for Wireless Networks,GPSR)和GFEMRP协议在内的四种路由协议进行了仿真和比较,实验结果表明GFEMRP协议具有良好的端到端时延、丢包率等性能。