车载自组织网络中基于蚁群算法的簇路由协议

由于车辆的高速移动及拓扑动态变化,构建稳定的传输路径是车载自组织网络VANETs(Vehicular ad hoc Networks)应用的关键。而簇技术建立稳定传输路径的有效技术之一。为此,提出基于蚁群算法的簇路由ACCR(Ant Colony algorithm based cluster routing)协议。蚁群系统是典型的启发性算法,能够解决簇划分问题。据此,ACCR协议利用蚁群算法选择簇头,提高簇的稳定性和数据传输性能。仿真结果表明,与ACO-CR协议相比,提出的ACCR协议的簇头寿命提高了近20%,数据传输率提高了近45%。     

RIVER: A reliable inter-vehicular routing protocol for vehicular ad hoc networks

Vehicular Ad hoc NETworks (VANETs), an emerging technology, would allow vehicles on roads to form a self-organized network without the aid of a permanent infrastructure. As a prerequisite to communication in VANETs, an efficient route between communicating nodes in the network must be established, and the routing protocol must adapt to the rapidly changing topology of vehicles in motion. This is one of the goals of VANET routing protocols. In this paper, we present an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol. RIVER utilizes an undirected graph that represents the surrounding street layout where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street segments between those vertices. Unlike existing protocols, RIVER performs real-time, active traffic monitoring and uses these data and other data gathered through passive mechanisms to assign a reliability rating to each street edge. The protocol then uses these reliability ratings to select the most reliable route. Control messages are used to identify a node’s neighbors, determine the reliability of street edges, and to share street edge reliability information with other nodes.     

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

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

PassCAR: A passive clustering aided routing protocol for vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) are a promising architecture for vehicle-to-vehicle communications in the transportation field. However, the frequent topology changes in VANETs create many challenges to data delivery because the vehicle velocity varies with time. Thus, designing an efficient routing protocol for stable and reliable communication is essential. Existing studies show that clustering is an elegant approach to efficient routing in a mobile environment. In particular, the passive clustering (PC) mechanism has been validated as a more efficient approach compared to traditional clustering mechanisms. However, the PC mechanism was primarily designed for mobile ad hoc networks (MANETs), and may be unsuitable for constructing a cluster structure in VANETs because it does not account for vehicle behavior and link quality. In this paper, we propose a passive clustering aided routing protocol, named PassCAR, to enhance routing performance in the one-way multi-lane highway scenario. The main goal of PassCAR is to determine suitable participants for constructing a stable and reliable cluster structure during the route discovery phase. Each candidate node self-determines its own priority to compete for a participant using the proposed multi-metric election strategy based on metrics such as node degree, expected transmission count, and link lifetime. Simulation results show that, compared with the original PC mechanism, PassCAR not only increases the successful probability of route discovery, but also selects more suitable nodes to participate in the created cluster structure. This well-constructed cluster structure significantly improves the packet delivery ratio and achieves a higher network throughput due to its preference for reliable, stable, and durable routing paths.     

Detecting sybil attacks in vehicular ad hoc networks using fuzzy logic and arithmetic optimization algorithm

The Journal of Supercomputing - In vehicular ad hoc networks (VANETs), Sybil attacks are serious security problems that can seriously affect the operations of the VANETs by producing fake...     

Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks

A vehicular ad hoc network (VANET) is a subclass of mobile ad hoc networks, considered as one of the most important approach of intelligent transportation systems (ITS). It allows inter-vehicle communication in which their movement is restricted by a VANET mobility model and supported by some roadside base stations as fixed infrastructures. Multicasting provides different traffic information to a limited number of vehicle drivers by a parallel transmission. However, it represents a very important challenge in the application of vehicular ad hoc networks especially, in the case of the network scalability. In the applications of this sensitive field, it is very essential to transmit correct data anywhere and at any time. Consequently, the VANET routing protocols should be adapted appropriately and meet effectively the quality of service (QoS) requirements in an optimized multicast routing. In this paper, we propose a novel bee colony optimization algorithm called bees life algorithm (BLA) applied to solve the quality of service multicast routing problem (QoS-MRP) for vehicular ad hoc networks as NP-Complete problem with multiple constraints. It is considered as swarm-based algorithm which imitates closely the life of the colony. It follows the two important behaviors in the nature of bees which are the reproduction and the food foraging. BLA is applied to solve QoS-MRP with four objectives which are cost, delay, jitter, and bandwidth. It is also submitted to three constraints which are maximum allowed delay, maximum allowed jitter and minimum requested bandwidth. In order to evaluate the performance and the effectiveness of this realized proposal using C++ and integrated at the routing protocol level, a simulation study has been performed using the network simulator (NS2) based on a mobility model of VANET. The comparisons of the experimental results show that the proposed algorithm outperformed in an efficient way genetic algorithm (GA), bees algorithm (BA) and marriage in honey bees optimization (MBO) algorithm as state-of-the-art conventional metaheuristics applied to QoS-MRP problem with the same simulation parameters.     

城市环境中车载自组织网络路由算法

针对城市环境中,现有路由算法在选择路由时未能考虑网络的全局信息、历史信息等问题,提出了一种适合于城市环境的车载自组织网络路由算法（a Routing Protocol for Urban Vehicular ad hoc networks,RPUV）,该算法通过考虑路由中每个路段的实时信息、路段的历史信息,保证路由的实时性和稳定性;同时,通过选择下一个十字路口时考虑网络的全局信息,保证了路由的可靠性。与现有路由算法相比,RPUV算法具有实时性和可靠性的特点,通过仿真表明了RPUV在数据包投递率和传输时延上具有更大的优越性。     

A routing protocol for vehicular ad hoc networks using simulated annealing algorithm and neural networks

Vehicular ad hoc network (VANET) is special type of mobile ad hoc networks which establish communications between adjacent vehicles and also between vehicles and roadside units. Thanks to their dynamic and fast topology changes, inter-vehicular ad hoc networks are like dynamic networks without organizations. Hence, developing a reliable routing algorithm is regarded as a notable challenge in these networks. In this paper, a clustering-based reliable routing algorithm was proposed for VANETs with reliable applications. In this way, simulated annealing was used for appropriate clustering of nodes and the parameters of node degree, coverage and ability were considered in the proposed method. For selecting cluster head, radial basis function neural network was used and a suitable fitness function with velocity and free buffer size parameters was used. Each cluster has two gateway nodes which are used as the communication interface for transmitting data from one cluster to another cluster. The simulation results indicated the efficiency of the proposed method in terms of route discovery rate and packet delivery rate.     

基于车流信息的车载自组织网络路由协议*

车载自组织网络(VANET)具有高移动性和间歇连通性,而且拓扑变化频繁,特别是在事故或交通堵塞的时候,因此,采用了携带并转发的方式,即移动车辆携带数据直到遇见有可转发的车辆。与现有携带并转发的解决方法不同,本文采用分布式实时估计各路段延时的方法。基于对各路段延时的估计,车辆就能计算车低延时的路由路径,然后提出了分布式实时数据流统计辅助的路由协议(DRTAR)来转发数据。实验结果显示,提出的DRTAR协议性能优于其他算法。     

改进的基于地理位置的可靠车载网络路由协议

提出了一种新的基于地理位置信息的车载网络路由协议——GDGP。GDGP是一种包转发机制,在进行包转发时将贪婪转发与方向转发相结合,通过两个独立的消息交互机制,更新各个节点上存储的目的节点的位置信息,以确保各个节点上记录的目的节点的位置信息的一致性,进而保证路由算法的可靠性。利用NS-2仿真平台,采取接近现实车辆运动情况的节点运动模式进行实验,和已有的GPSR路由协议进行比较。仿真结果表明,改进的路由协议在城市场景中有较好的性能。     

Adaptive routing protocol for mobile ad hoc networks

Artificial immune systems (AIS) are used for solving complex optimization problems and can be applied to the detection of misbehaviors, such as a fault tolerant. We present novel techniques for the routing optimization from the perspective of the artificial immunology theory. We discussed the bioinspired protocol AntOR and analyze its new enhancements. This ACO protocol based on swarm intelligence takes into account the behavior of the ants at the time of obtaining the food. In the simulation results we compare it with the reactive protocol AODV observing how our proposal improves it according to Jitter, the delivered data packet ratio, throughput and overhead in number of packets metrics.     

Selfish node detection in ad hoc networks based on fuzzy logic

Neural Computing and Applications - Generally, the ad hoc networks work correctly only if all nodes cooperate in the routing and forwarding of the packets. However, in some cases, selfish nodes are...     

A location routing protocol based on smart antennas for ad hoc networks

Ad hoc networks are a type of mobile networks that function without any fixed infrastructure. One of the weaknesses of ad hoc networks is that route between a source and a destination is likely to break during communication. Location-based routing algorithms are promising in reducing routing overhead in ad hoc networks. Existing location-based routing algorithms employ the Global Positioning System (GPS) as their location information provider, and synchronize information network-wide. Nonetheless, these protocols have some limitations because the use of GPS is not realistic in certain circumstances. Since smart antenna is able to infer direction and ranging information between pairs of ad hoc node, the obtained local position information can be used to improve routing mechanism. This work proposes a novel Location-Enhanced On-Demand (LEOD) routing protocol which is based on smart antenna technique. The LEOD protocol utilizes local position instead of global position to discover routes and make routing decision for the ad hoc network. Theoretical computation and simulation results show that data packet loss rate decreased significantly compared to other methods well-documented in the literature. In addition, this protocol reduces the network control overheads and the power consumption. It also improves network average throughput.     

基于改进蚁群算法的Ad hoc路由算法

在基于蚁群优化算法(ACO)的Ad hoc路由算法的基础上提出了一种改进的基于蚂蚁算法的Ad hoc路由算法.该算法吸收了AODV的优点,并且在实现方面得到了改善.分析表明,该算法能大大提高系统的可靠性、鲁棒性,增强了通信网络的自适应能力.     

Gathering-based routing protocol in mobile ad hoc networks

A gathering-based routing protocol (GRP) for mobile ad hoc networks is presented. The idea is to rapidly collect network information at a source node at an expense of a small amount of control overheads. The source node can equip promising routes on the basis of the collected information, thereby continuously transmitting data packets even if the current route is disconnected. It results in achieving fast (packet) transfer delay without unduly compromising on (control) overhead performance.     

A collaborative protocol for anonymous reporting in vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) have emerged to leverage the power of modern communication technologies, applied to both vehicles and infrastructure. Allowing drivers to report traffic accidents and violations through the VANET may lead to substantial improvements in road safety. However, being able to do so anonymously in order to avoid personal and professional repercussions will undoubtedly translate into user acceptance. The main goal of this work is to propose a new collaborative protocol for enforcing anonymity in multi-hop VANETs, closely inspired by the well-known Crowds protocol. In a nutshell, our anonymous-reporting protocol depends on a forwarding probability that determines whether the next forwarding step in message routing is random, for better anonymity, or in accordance with the routing protocol on which our approach builds, for better quality of service (QoS). Different from Crowds, our protocol is specifically conceived for multi-hop lossy wireless networks. Simulations for residential and downtown areas support and quantify the usefulness of our collaborative strategy for better anonymity, when users are willing to pay an eminently reasonable price in QoS.     

传感器网络中基于蚁群优化的谣传协议*

谣传协议是传感器网络中基于数据查询的路由协议,它使用随机方式生成路由,形成的数据传输路径不是最优路径,并且可能存在回路。为此,提出一种基于蚁群优化的谣传协议。该协议将蚁群分成查询蚂蚁和事件蚂蚁两个种群。当两个种群的蚂蚁相遇时,则形成查询路径。该协议解决了谣传协议中的回路问题,算法收敛性好,建立完整查询路由的概率比谣传协议的要大,传输数据所需的能量消耗比谣传协议的要少,是一种能量高效的数据查询协议。     

An adaptive and opportunistic broadcast protocol for vehicular ad hoc networks

A primary goal of broadcasting in vehicular ad hoc network (VANET) is to improve the road safety by transmitting alert messages to all surrounding vehicles as soon as possible. In this paper, we adopt the concept of opportunistic routing and propose a multiple candidate relays opportunistic broadcast (MCROB) protocol for VANET. The MCROB protocol is a sender-driven broadcast scheme independent of node density. The packet delivery ratio (PDR) is derived and an expected transmission speed (ETS) for the MCROB is proposed. A priority rule for selecting a proper candidate relay and an adaptive algorithm for forwarding timers of candidate relays are also presented in this paper. Simulations show that MCROB is adaptive to the rapid changing of network conditions. It keeps a low communication overhead introduced by the broadcast and increases the average transmission speed by around 40%.     

无线自组网中一种高效的路由协议

无线自组网与传统的有线网不同,它由一些可移动的结点组成,这些结点的带宽、计算能力和能量都受到一定限制。针对这种网络,研究者们提出了按需路由协议,这些协议非常适合无线自组网这种拓扑结构,但是由于缺乏对全局拓扑和结点移动性的了解,可能达不到最优。因此提出了一种高效的路由协议ERNC,该协议基于已提出的SHORT路由协议[13],并对以前所提出的NAOR协议[14]进行了扩展,即利用网络编码技术来进一步提高路由协议的性能。最后,使用NS-2模拟器来评估ERNC的性能,结果显示ERNC在分组投递率和平均端到端时延等方面获得了比已有协议更好的性能。