• DocumentCode
    2382875
  • Title

    Roadside infrastructure planning for vehicle trajectory collection

  • Author

    Yan, Tan ; Wang, Guiling

  • Author_Institution
    Dept. of Comput. Sci., New Jersey Inst. of Technol., Newark, NJ, USA
  • fYear
    2012
  • fDate
    21-22 May 2012
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Vehicle trajectories information can enable many promising applications, but obtaining the information is very challenging. Road-side infrastructure can collect trajectory data from vehicles in the area through wireless communication in addition to many other functionalities. In this paper, we suggest the deployment of roadside infrastructure for vehicle trajectory collection. More specifically, we select intersections to install access points for collecting moving trajectory of all the vehicles in the area, while at the same time minimize the number of selected intersections. We prove the intersection selection problem is NP-complete and propose a greedy heuristic to approximately address it. The performance, efficiency and practical issues such as broadcast intervals of the scheme are analyzed in this paper. The simulation shows that our greedy approach solves the intersection selection problem efficiently and effectively.
  • Keywords
    computational complexity; greedy algorithms; vehicular ad hoc networks; NP-complete problem; access points; greedy heuristic approach; intersection selection problem; roadside infrastructure planning; vehicle trajectory collection; wireless communication; Ad hoc networks; Approximation methods; Greedy algorithms; Roads; Trajectory; Vehicles; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sarnoff Symposium (SARNOFF), 2012 35th IEEE
  • Conference_Location
    Newark, NJ
  • Print_ISBN
    978-1-4673-1465-7
  • Type

    conf

  • DOI
    10.1109/SARNOF.2012.6222765
  • Filename
    6222765