Literature Database Entry


K. Pandit, D. Ghosal, H.M. Zhang and Chen-Nee Chuah, "Adaptive Traffic Signal Control With Vehicular Ad hoc Networks," IEEE Transactions on Vehicular Technology, vol. 62 (4), pp. 1459-1471, May 2013.


In this paper, we propose to use vehicular ad hoc networks (VANETs) to collect and speed, aggregate real-time and position information on individual vehicles to optimize signal control at traffic intersections. We first formulate the vehicular traffic signal control problem as a job scheduling problem on processors, with jobs corresponding to platoons of vehicles. Under the assumption that all jobs are of equal size, we give an online algorithm, referred to as the oldest job first (OJF) algorithm, to minimize the delay across the intersection. We prove that the OJF algorithm is 2-competitive, implying that the delay is less than or equal to twice the delay of an optimal offline schedule with perfect knowledge of the arrivals. We then show how a VANET can be used to group vehicles into approximately equal-sized platoons, which can then be scheduled using OJF. We call this the two-phase approach, where we first group the vehicular traffic into platoons and then apply the OJF algorithm, i.e., the oldest arrival first (OAF) algorithm. Our simulation results show that, under light and medium traffic loads, the OAF algorithm reduces the delays experienced by vehicles as they pass through the intersection, as compared with vehicle-actuated methods, Webster's method, and pretimed signal control methods. Under heavy vehicular traffic load, the OAF algorithm performs the same as the vehicle-actuated traffic method but still produces lower delays, as when compared with Webster's method and method., the pretimed signal control

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


K. Pandit
D. Ghosal
H.M. Zhang
Chen-Nee Chuah

BibTeX reference

    author = {Pandit, K. and Ghosal, D. and Zhang, H.M. and Chuah, Chen-Nee},
    title = {{Adaptive Traffic Signal Control With Vehicular Ad hoc Networks}},
    journal = {IEEE Transactions on Vehicular Technology},
    pages = {1459-1471},
    volume = {62},
    number = {4},
    keywords = {road traffic;vehicular ad hoc networks;2-competitive;OAF algorithm;OJF algorithm;VANET;Webster method;adaptive traffic signal control;delay minimization;equal-sized platoon;heavy vehicular traffic load;job scheduling problem;oldest arrival first algorithm;oldest job first algorithm;online algorithm;optimal offline schedule;position information;pretimed signal control method;processor;real-time speed;traffic intersection;two-phase approach;vehicle-actuated traffic method;vehicular ad hoc network;vehicular traffic signal control problem;Delay;Schedules;Scheduling;Scheduling algorithms;Vehicles;Vehicular ad hoc networks;Conflict graphs;Webster's algorithm;online job scheduling;traffic signal control;vehicle-actuated traffic signal control;vehicular ad hoc network (VANET) simulation},
    year = {2013},
    month = {May},
    publisher = {IEEE},
    issn = {0018-9545},
    doi = {10.1109/TVT.2013.2241460},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.