Intelligent Information Dissemination Scheme for Urban Vehicular Ad Hoc Networks

Jinsheng Yang,Changqing Liu,Shih‐Lin Wu

doi:10.1155/2015/821608

Jinsheng Yang, Changqing Liu + Show 1 more

Open Access

https://doi.org/10.1155/2015/821608

Copy DOI

Abstract

In vehicular ad hoc networks (VANETs), a hotspot, such as a parking lot, is an information source and will receive inquiries from many vehicles for seeking any possible free parking space. According to the routing protocols in literature, each of the vehicles needs to flood its route discovery (RD) packets to discover a route to the hotspot before sending inquiring packets to the parking lot. As a result, the VANET nearby an urban area or city center may incur the problem ofbroadcast stormdue to so many flooding RD packets during rush hours. To avoid the broadcast storm problem, this paper presents ahotspot-enabledrouting-tree based data forwarding method, called the intelligent information dissemination scheme (IID). Our method can let the hotspot automatically decide when to build the routing-tree for proactive information transmissions under the condition that the number of vehicle routing discoveries during a given period exceeds a certain threshold which is calculated through our developed analytical packet delivery model. The routing information will be dynamically maintained by vehicles located at each intersection near the hotspot if the maintaining cost is less than that of allowing vehicles to discover routes themselves. Simulation results show that this method can minimize routing delays for vehicles with lower packets delivery overheads.

Highlights

Vehicular ad hoc networks (VANETs) have recently emerged as a promising research area for improving transportation safety and efficiency [1, 2]
To know how much performance information dissemination scheme (IID) can achieve, we evaluate the performance of IID by comparing with RBVT using the network simulator NS-2.35 [14]
The reasons are that, in IID, the impact of vehicle speed on packet delivery overhead is relatively small because the number of routing packets is reduced

Summary

Introduction

Vehicular ad hoc networks (VANETs) have recently emerged as a promising research area for improving transportation safety and efficiency [1, 2]. To reduce the overloading problem by beacon exchanges, [7] proposes another intersection-tointersection based routing protocol which designs a method for forwarding packets in an urban area that selects a relay vehicle at each road intersection based on distance to destination, signal strength, and direction of movement. This paper presents a data forwarding scheme by which a hotspot can automatically disseminate information to nearby vehicles to avoid the broadcast storm problem incurred by vehicles’ flooding RD packets. The other problem is how to use the broadcasting RB packets to build and maintain the routing-tree at intersections by passing vehicles. To solve this problem, we develop an algorithm that allows vehicles at each intersection to maintain the routing information for a period of time.

Problem Formulation

Packet Delivery Overhead Model

Performance Evaluation

Simulation Results

Conclusions