VANET BASED TRAFFIC MANAGEMENT SYSTEM

INTRODUCTION
VANET based information system for traffic management Efficient low cost vehicular communication system Based on wireless technology all nodes are one level topology and can communicate directly with each other No need of centralized nodes

Introduction to VANET ?
Ad hoc network composed of vehicles Individual nodes different from traditional wireless nodes No power constraint Nodes mostly mobile Complements existing infrastructure Extends existing infrastructure

Problem Statement
Do existing MANET routing protocols work well in VANET? Are current VANET forwarding protocols enough or can they be optimized for VANET characteristics? VANETs were selected for this study because, among the vehicular networks, the ad hoc o configuration has the greater potential of widespread use It is scalable compared to cellular communication success is dependent on whether VANET routing protocols are able to satisfy the throughput and delay requirements of applications deployed on these networks To enhance main characteristics of VANETs that influence routing

Applications
Traffic control Automatic speed limit enforcement Rerouting in traffic congestion Safety Notification of accident up ahead Decentralized 911 service Prioritized over non-safety applications Extended communication

Application Scenario

OBJECTIVE
Enabling accurate and efficient evaluation VANET applications Evaluate the feasibility and performance limitations of VANET Simulates movement of vehicles on streets Inform vehicles about traffic status To increase the range of communication Make system available in low cost

SCOPE
Automation in vehicle driving system Up to 118% increase on the number of vehicles reaching the destination Up to 36:2% reduction on travel time Up to 56:1% reduction on delay time. Work Zone Warning & Automatic parking zones

ALGORITHM: DB-DIPC
(Delay-Bounded Dynamic Interactive Power Control Algorithm)

STAGE: Probing while stage == probe; do if no Probe or Probe_Ack message received then power powerStep * 2step; elseif one Probe/Data message received then power powerLevel in Probe/Data; turning_point step; stage stable; elseif multiple Probe/Data message received then power minimum powerLevel in Probe/Data turning_point log2( power ); stage adjust; elseif one Probe_Ack message received then power min (powerLevel in Probe_Ack, power_) turning_point step; stage stable. elseif multiple Probe_Ack received then power power - powerStep*22* turning_point step-1 turning_point power ; stage adjust. elseif one or multiple unsolicited Probe_Ack received then power minimum powerLevel in Probe_Ack turning_point power ; stage adjust. end Send Probe/Probe_Ack based on power; step ++ end STAGE: adjustment while stage == adjustment; do if no Probe or Probe_Ack message received then power power + powerStep * 22 * turning_point - step 1 elseif one Probe/Data message received then power min (powerLevel in Probe/Data, power_) stage stable. elseif multiple Probe/Data message received then power min (powerLevel in Probe/Data, power_) elseif one Probe_Ack message received then power min (powerLevel in Probe_Ack, power_) stage stable. elseif multiple Probe_Ack received then power power - powerStep * 22 * turning_point - step-1 elseif one or multiple unsolicited Probe_Ack received then power power + powerStep * 22 * turning_point step 1 end

Send Probe/Probe_Ack based on power; step ++ end

STAGE: stable while stage == stable; do if no Probe/Probe_Ack from neighbor for n cycles then step power power powerStep * 2step ; stage probe // If getting unassociated, return to probe stage elseif multiple Probe/Probe_Ack/Data received then temp_power max (power in Probe/_Ack/Data, power_) step power ; turning_point step power powerStep * 2step ; stage adjust //send probe_ack for lowering power & adjust own power else keep original association with same power end Send Probe/Probe_Ack with power (or send temp_power if received multiple messages); step ++ end

ANALYSIS
DB-DIPC algorithm is distributed, asynchronous, fast converging, and capable of interactive learning and calibrating over multiple iterations. With DB-DIPC, the transmission powers of VANET nodes are verified iteratively and interactively by the neighbor vehicles at run-time. For communications between immediate neighbor vehicles ensures that the 1-hop neighbor connectivity at run-time to adapt the high VANET dynamics promptly.