Adaptive Traffic

Congestion
Control using
VANET
Major Project
What is a VANET?
Vehicular Ad Hoc Network
Applying principles of MANETs to
domain of vehicles
Mobile Ad Hoc Networks : self-
configuring, infrastructure-less network
of mobile devices connected wirelessly
Highly dynamic network
 Applications of VANET
Safety - Avoiding accidents
through alerts
Traffic congestion control
- optimizing flow of
vehicles, reducing
congestion
Comfort and infotainment
applications
IEEE 802.11p
Why a whole new standard for VANETs :

High Mobility, dynamic network topology

High Speed vehicles changing position continuously

Links between nodes connect and disconnect very often

Very large scale - covering entire road networks

IEEE 802.11p
Enhancements to IEEE 802.11 (WiFi) standard required to support ITS
Supports data exchange between high-speed vehicles and between vehicles and
roadside infrastructure in licensed ITS band of 5.85-5.925 GHz
Stations start transmitting as soon as they arrive, no need for generating BSS
No need to wait for authentication and association procedures
Current Usage : In Porto (Portuguese) it is used to exchange data between vehicles
and wifi for passengers
Overview of our system
Vehicles constantly transmitting data packets containing their VehicleID, location
and speed parameters
RSU is constantly receiving packets and knows the whole configuration
Divide vehicles into platoons using platooning algorithm
Then apply OAF algorithm which selects n number of non-conflicting traffic
movements in the intersection minimizing the total delay
Allow platoons on chosen paths to move
Advantages over other traffic systems
SCOOT and SCAT systems : require loop detectors to be placed beneath roads, fails
when queue lengths are large
VANET : more information, more flexible
Other systems have high costs of implementation : Cameras, loop detectors etc
VANET : Less cost, only a small OBU with small processing power is required
VANET has many other applications as well, eg : Road Safety
Platooning Algorithm
Why platooning? : OAF requires jobs to be of the same size
Assuming 1 vehicle = 1 platoon -> Too inefficient, high delays
We need to :

Select the platoon size that minimizes the difference in times required to service
platoons of vehicles
Maximize the size of platoons

Perform Exhaustive search over each platoon configuration C

Over each lane K
OAF Algorithm
Based on OJF online scheduling algorithm
OJF is 2-competitive
Requires vehicles to be divided into platoons
require equal green times - accomplished by
Platooning algorithm, discussed later
1-8 show traffic movements on a typical road
Intersection
Conflict Graph
Used by traffic engineers to build
safe traffic signal control plans
We build conflict graph for our
intersection
OJF requires graph to be bipartite
So, convert conflict graph into a
bipartite graph
Sample Run
The table shows arriving times of platoons
on various nodes :
Simulation of Urban MObility (SUMO)
SUMO
omnet++
Wireless Network
Simulator
Every vehicle in SUMO
is mapped to a mobile
node in omnet++
Supports IEEE 802.11p
technology
Omnet++ and SUMO
are connected using
TRACI interface
Running simulation
 Simulation Results

Equal arrival rates,

Medium Traffic
 Simulation Results
Varying arrival rates,
medium traffic
 Simulation Results
Vehicle arrival
following a
distribution, heavy
traffic
Thank you!