Information dissemination in VANETs based upon a tree topology

In this work, we focus on vehicular ad hoc networks, also called VANETs, which are communication networks that devices (in this case vehicles) use to exchange messages in a decentralized fashion, i.e., using no preexisting infrastructure. We first assess the feasibility of relying on a tree-based topology management structure for mobile ad hoc networks and in particular for VANETs. Next, we enhance DAGRS, an existing decentralized model for enabling distributed tree management and build BODYF on it, an efficient broadcast algorithm. Several broadcasting algorithms of the state of the art are implemented in order to compare the performance of BODYF. The approach is validated by simulation through three realistic scenarios located in Luxembourg city: the city center for both pedestrian and vehicles, and a highway environment. The comparison is made in terms of the coverage achieved by the broadcasting process as well as the complexity of the messages. DAGRS/BODYF approach outperforms other existing protocols in terms of both the number of devices reached and the network use.     

Routing protocol development for quality of service optimization of video‐on‐demand system over mobile ad hoc networks

A video‐on‐demand (VoD) application system over mobile ad hoc networks typically requires particular quality of service (QoS) parameters to be achieved. In this paper, we have proposed a novel QoS‐based routing protocol called as mobile VoD protocol. This protocol has been developed for improving the QoS of the mobile VoD system (normal Mobi_VoD approach). The protocol uses customer caching scheme for storing the first fragment of the entire video in the mobile customers and thereafter broadcast them when the new mobile customers missed the portion of the already transmitted first fragment for reducing the service delay of the customer, consequently optimizing QoS parameters. Various scenarios have been studied, and the efficacy of simulation results proves that the proposed system architecture in which the mobile customers use an ad hoc network caching scheme (mobile VoD protocol) is more efficient and performs better than the existing system (ad hoc on‐demand distance vector protocol) when compared in terms of QoS parameters such as the end‐to‐end delay, energy consumption, packet delivery ratio, throughput, and overhead.     

Broadcast storm mitigation techniques in vehicular ad hoc networks

Several multihop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or propagate useful traffic information to other vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collisions at the link layer due to an excessive number of broadcast packets. While this is a well-known problem in mobile ad hoc wireless networks, only a few studies have addressed this issue in the VANET context, where mobile hosts move along the roads in a certain limited set of directions as opposed to randomly moving in arbitrary directions within a bounded area. Unlike other existing works, we quantify the impact of broadcast storms in VANETs in terms of message delay and packet loss rate in addition to conventional metrics such as message reachability and overhead. Given that VANET applications are currently confined to using the DSRC protocol at the data link layer, we propose three probabilistic and timer-based broadcast suppression techniques: weighted p-persistence, slotted 1-persistence, and slotted p-persistence schemes, to be used at the network layer. Our simulation results show that the proposed schemes can significantly reduce contention at the MAC layer by achieving up to 70 percent reduction in packet loss rate while keeping end-to-end delay at acceptable levels for most VANET applications.     

VANETs路由协议的研究进展

车辆自组织网络是传统自组织网络派生出的一个分支,其与应用场景高度相关.传统路由协议不能有效的适用于车辆自组织网络,因此,针对车辆自组织网络提出了许多新的路由协议.首先在总结车辆自组织网络的特性后,分别介绍了单播路由、广播路由和地域性多播路由的概念,然后着重分析和总结了近年来具有代表性的路由协议的核心路由机制及其优缺点,...     

An Efficient Multi-hop Broadcast Protocol for Emergency Messages Dissemination in VANETs

Black-burst based multi-hop broadcast protocols are effective means to disseminate Emergency messages (EMs) in Vehicular ad hoc networks (VANETs). However, Clear to broadcast (CTB) collision will happen and reduce propagation speed. Aiming at this problem, we propose a Black-burst and multi-channel based multi-hop broadcast (BMMB) protocol. Vehicles with multiple antennas can transmit and sense black-burst at different channels simultaneously based on multi-channel technol-ogy. Compared with existing black-burst based methods, BMMB shortens the iterative procedure to find out the optimal segment. Only one relay vehicle can be rapidly se-lected within the optimal segment without CTB collision. BMMB enables alternative broadcast methods, i.e., uni-directional broadcast and multi-directional broadcast for straight roads and intersections respectively. Theoretical analysis is done for performance evaluation of BMMB, and simulation results demonstrate that BMMB performs better in terms of average one-hop delay and propagation speed.     

采用TDMA和CSMA混合MAC协议的时隙调整算法

由于车联网(VANET)拓扑动态变化,车辆高速移动以及不同服务质量要求,制定媒体接入控制(MAC)协议面临巨大挑战。在控制信道间隔内采用基于TDMA和CSMA的混合接入协议是最有效的MAC协议之一。基于TDMA和CSMA的混合MAC协议(T-C-MAC)能够依据车辆环境调整TDMA帧长度,并能有效地传输非安全消息。为了提高T-C-MAC协议的性能,提出了一种基于三跳邻居信息的时隙调整(THSA) 算法。通过有效地调整车辆传输时隙,基于THSA的MAC（THSA-MAC）协议能够有效地实施广播服务,提高了安全消息传输率。实验数据表明,THSA-MAC有效地提高了安全消息传递率。     

Road Aware Geographical Routing Protocol Coupled with Distance,Direction and Traffic Density Metrics for Urban Vehicular Ad Hoc Networks

The new information and communication technologies have changed the trend of communication in all fields. The transportation sector is one of the emerging field, where vehicles are communicating with each other or with infrastructure for different safety and comfort applications in the network. Vehicular ad hoc networks is one of the emerging multi-hop communication type of intelligent transportation field to deal with high mobility and dynamic vehicular traffic to deliver data packets in the network. The high mobility and dynamic topologies make the communication links unreliable and leads to frequent disconnectivity, delay and packet dropping issues in the network. To address these issues, we proposed a road aware geographical routing protocol for urban vehicular ad hoc networks. The proposed routing protocol uses distance, direction and traffic density routing metrics to forward the data towards the destination. The simulation results explore the better performance of proposed protocol in terms of data delivery, network delay and compared it with existing geographical routing protocols.

     

Performance modeling and analysis of the ADHOC MAC protocol for vehicular networks

The ADHOC MAC protocol is a classical MAC protocol for supporting reliable broadcast services in vehicular ad hoc networks (VANETs). This paper develops an analytical model for analyzing the access performance of the ADHOC MAC protocol. A Markov chain is first constructed to describe the number of vehicles which have acquired a timeslot successfully at the end of a frame when using the ADHOC MAC protocol. Based on the Markov model, an analytical model is then derived to describe the relationship between the frame length and the channel utilization. Based on the derived analytical model, an optimal frame length that maximizes the channel utilization is further obtained. Simulation experiments are conducted to verify the effectiveness of the analytical model.     

ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) have emerged as fast growing networks with aims to provide safety, and comfort to the onboard passengers. But, in this environment reliable data dissemination to the destination nodes is one of the biggest challenges as there may be a congestion in the network due to blind flooding of messages to their final destination, called as broadcast storm which may lead to the performance degradation with respect to the metric such as-message delivery, reliability and response time. To address this issue, in this paper, we propose a reliability-aware intelligent data dissemination protocol for broadcast storm problem in VANETs. We have solved the above specified problem using game theory concepts in which players, strategy space and decisions with respect to the current state of the system. To reduce the message overhead with respect to the communication cost among the players of the game, in the proposed scheme, messages are routed to the next destination by selecting the most reliable path in an intelligent manner. A coalition game is formulated among the vehicles by considering vehicles as the players in the game. Each player in the game has an initial payoff value based upon the parameters such as-communication range, storage requirements, and computation power. Based upon the payoff value of the players in the game, different coalitions/clusters are formulated among the players in the proposed scheme. Then, the players send the messages to the other vehicles/players within the same coalition which increases the reliability of transmission. In the proposed scheme, messages are unicasted to their final destination in an intelligent manner. Different algorithms are designed for coalition formation, maintenance, and reliability-aware data dissemination. The performance of the proposed scheme is evaluated using various evaluation metrics such as-service time, packet delivery ration, and throughput. The results obtained prove the effectiveness of the proposed scheme as compared to the other state-of-the-art existing schemes.     

A multi‐channel cooperative clustering‐based MAC protocol for V2V communications

The Internet of vehicles (IoV) is an emerging networking technology, which can support information sharing and interactions among users, vehicles, and infrastructures. Various applications can be provided by IoVs, and they have very different quality‐of‐service (QoS) requirements. It is a great challenge to design an efficient MAC protocol to meet the different QoS demands of various applications in IoVs, because of unreliable links and high vehicle mobility. On the other hand, cooperative communication is effective in mitigating wireless channel impairments by utilizing the broadcast nature of wireless channels. In this paper, a multi‐channel cooperative clustering‐based MAC (MCC‐MAC) protocol, under the Dedicated Short Range Communication (DSRC) multi‐channel architecture, is presented to improve the transmission reliability of safety messages and provision QoS for different applications in IoVs. Further, we analyze the performance of MCC‐MAC, in terms of average transmission delay. In addition, extensive simulations with ns‐2 are conducted to demonstrate the performance of the proposed MCC‐MAC. Copyright © 2016 John Wiley & Sons, Ltd.     

Efficient routing for wireless mesh networks using a backup path

Wireless mesh networks (WMNs) have a proven record in providing viable solutions for some of the fundamental issues in wireless networks such as capacity and range limitations. WMN infrastructure includes clusters of mobile ad‐hoc networks connected through a fixed backbone of mesh routers. The mesh network can be constrained severely because of various reasons, which could result in performance degradation such as a drop in throughput or long delays. Solutions to this problem often focus on multipath or multichannel extensions to the existing ad‐hoc routing protocols. In this paper, we propose a novel solution by introducing an alternative path to the mesh backbone that traverses the mobile ad‐hoc networks part of the WMN. The new routing solution allows the mobile nodes (MNs) to establish direct communication among peers without going through the backbone. The proposed alternative ad‐hoc path is used only when the mesh backbone is severely constrained. We also propose, for the first time in WMNs, using MNs with two interfaces, one used in the mesh backbone communication and the other engaged in the ad‐hoc network. A scheme is presented for making the MN aware of link quality measures by providing throughput values to the ad‐hoc on‐demand distance vector protocol. We use piggybacking on route reply messages in ad‐hoc on‐demand distance vector to avoid incurring additional costs. We implemented our solution in an OPNET simulator and evaluated its performance under a variety of conditions. Simulation results show that the alternative ad‐hoc path provides higher throughput and lower delays. Delay analysis show that the throughput improvement does not impose additional costs. Copyright © 2012 John Wiley & Sons, Ltd.     

Variable power broadcast using local information in ad hoc networks

Network wide broadcast is a frequently used operation in ad hoc networks. Developing energy efficient protocols to reduce the overall energy expenditure in network wide broadcast can contribute toward increasing the longevity of ad hoc networks. Most of the existing work in energy efficient broadcast protocols use either a fixed transmission power model or assume global knowledge of the entire network at each node. Variable power broadcast with local knowledge has recently been proposed as a promising alternative approach for network wide broadcast in ad hoc networks.

In this paper, we present a novel approach, called INOP, for network wide broadcast. INOP is a variable power broadcast approach that uses local (two-hop neighborhood) information. INOP utilizes a novel technique for determining the transmission power level at each transmitting node. We also propose two alternative methods to cover the nodes that are not covered by the transmission of the source or a retransmitting node.

Our simulation based evaluations show that, compared to other approaches, INOP achieves better results in terms of energy efficiency, and competes with and exceeds other approaches in terms of a number of other performance metrics including traffic overhead, coverage, and convergence time. Based on these results, we can conclude that INOP improves the current state-of-the-art approaches for energy efficient broadcast in ad hoc networks.     

Routing protocols for vehicular Ad Hoc networks in rural areas

Research on vehicular ad hoc networks has focused mainly on efficient routing protocol design under conditions where there are relatively large numbers of closely spaced vehicles. These routing protocols are designed principally for urban areas with high node density and fully connected networks and are not suitable for packet delivery in a sparse, partially connected VANET. In this article, we examine the challenges of VANETs in sparse network conditions, review alternatives including epidemic routing, and propose a border node-based routing protocol for partially connected VANETs. The BBR protocol can tolerate network partition due to low node density and high node mobility. The performance of epidemic routing and BBR are evaluated with a geographic and traffic information- based mobility model that captures typical highway conditions. The simulation results show that under rural network conditions, a limited flooding protocol such as BBR performs well and offers the advantage of not relying on a location service required by other protocols proposed for VANETs.     

A Street Broadcast Reduction Scheme (SBR) to Mitigate the Broadcast Storm Problem in VANETs

In urban vehicular wireless environments, several vehicles can send warning messages and so every vehicle within the transmission range will receive the broadcast transmission, possibly rebroadcasting these messages to other vehicles. This increases the number of vehicles receiving the traffic warning messages. Hence, redundancy, contention, and packet collisions due to simultaneous forwarding (usually known as the broadcast storm problem), can occur. In the past, several approaches have been proposed to solve the broadcast storm problem in wireless networks such as Mobile ad hoc Networks MANETs. In this paper, we present Street Broadcast Reduction SBR, a novel scheme that mitigates the broadcast storm problem in VANETs. SBR also reduces the warning message notification time and increases the number of vehicles that are informed about the alert.     

Delay constraint multipath routing for wireless multimedia ad hoc networks

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd.     

移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.     

RPB-MD: Providing robust message dissemination for vehicular ad hoc networks

To improve traffic safety and efficiency, it is vital to reliably send traffic-related messages to vehicles in the targeted region in vehicular ad hoc networks (VANETs). In this paper, we propose a novel scheme, relative position based message dissemination (RPB-MD), to reliably and efficiently disseminate messages to the vehicles in the zone-of-relevance. Firstly, the relative position based (RPB) addressing model is proposed to effectively define the intended receivers in the zone-of-relevance. To ensure high message delivery ratio and low delivery delay, directional greedy broadcast routing (DGBR) is introduced to make a group of candidate nodes hold the message for high reliability. Moreover, to guarantee efficiency, the protocol time parameters are designed adaptively according to the message attributes and local vehicular traffic density. The protocol feasibility is analyzed to illustrate the robustness and reliability of RPB-MD. Simulation results show that RPB-MD, compared with representative existing schemes, achieves high delivery ratio, limited overhead, reasonable delay and high network reachability under different vehicular traffic density and data sending rate.     

LTE efficiency when used in traffic information systems: A stable interest aware clustering

Long‐term evolution (LTE) technology is critical for the envisioned usage scenarios in the Internet of Vehicles. An important usage scenario is traffic information systems (TIS) for vehicular ad hoc networks (VANETs) that depend on LTE for the delivery of non‐safety information to vehicles. TISs are centralized data warehouses that collect and process traffic information and subsequently allow vehicles to receive such information before and during a road trip. Considering the extensive deployment of VANETs, the LTE demand for TIS is expected to increase. Therefore, we explore and quantify the inefficiency of LTE when used in TIS. By envisioning basic test case scenarios, we establish the trends of data usage while commuting and providing insights into how LTE usage in TIS may lead to the inefficient use of the available wireless spectrum during road trips. To reduce identified inefficiency in LTE usage and cluster instability due to the high speed of the vehicles, we proposed a novel stable interest‐aware clustering (SIAC) mechanism. SIAC consider VANETs mobility constraint, LTE link quality, and exploit interest of the vehicles, in cluster formation phase. Resulting in the reduction in the data demand of the vehicles and frequency of link failures among the vehicles and provides transmission path stability. SIAC performs well as compared with the existing approaches shows more cluster stability and reduces the LTE usage for driving assistance and route planning applications.     

A Scalable CSMA and Self-Organizing TDMA MAC for IEEE 802.11 p/1609.x in VANETs

vehicular ad hoc networks (VANETs) have been a key topic for research community and industry alike. The wireless access in vehicular environment standard employs the IEEE 802.11p/1609.4 for the Medium Access Control (MAC) layer implementation for VANETs. However, the carrier sense multiple access (CSMA) based mechanism cannot provide reliable broadcast services, and the multi-channel operation defined in IEEE 1609.4 divides the available access time into fixed alternating control channel intervals (CCH) and service channel (SCH) intervals, which may lead to the low utilization of the scarce resources. In this paper, a novel multichannel MAC protocol called CS-TDMA considering the channel access scheduling and channel switching concurrently is proposed. The protocol combines CSMA with the time division multiple access (TDMA) to improve the broadcast performance in VANETs. Meanwhile, the dwelling ratio between CCH and SCH changes dynamically according to the traffic density, resulting in the improvement of resource utilization efficiency. Simulation results are presented to verify the effectiveness of our mechanism and comparisons are made with three existing MAC protocols, IEEE MAC, SOFT MAC and VeMAC. The simulation results demonstrate the superiority of CS-TDMA in the reduction of transmission delay and packet collision rate and improvement of network throughput.     

A Mobicast Routing Protocol in Vehicular Ad-Hoc Networks

In this paper, we present a “spatiotemporal multicast”, called a “mobicast”, protocol for supporting applications which require spatiotemporal coordination in vehicular ad hoc networks (VANETs). The spatiotemporal character of a mobicast is to forward a mobicast message to vehicles located in some geographic zone at time t, where the geographic zone is denoted as zone of relevance (ZOR). Vehicles located in ZOR at the time t must keep the connectivity to maintain the real-time data communication between all vehicles in ZOR. The connectivity is kept of all vehicles in ZOR through the vehicular ad hoc networks (VANETs). The connectivity of ZOR is lost if any vehicle in ZOR suddenly accelerates or decelerates its velocity. The temporal network fragmentation problem is occurred such that vehicle in ZOR cannot successfully receive the mobicast messages. To solve the problem, a new mobicast protocol is presented in this work to successfully disseminate mobicast messages to all vehicles in ZOR via a special geographic zone, called as zone of forwarding (ZOF). The main contribution of this work is to develop a new mobicast routing protocol to dynamically estimate the accurate ZOF to successfully disseminate mobicast messages to all vehicles in ZOR. To illustrate the performance achievement, simulation results are examined in terms of dissemination successful rate, packet overhead multiplication, packet delivery delay, and throughput.