A Parking Space Finding Method Based on VANETs

In some large cities, it is not easy to find a parking space due to the high traffic demand. With the assistance of wireless communications, many safety-related and no-safety related applications can be deployed in the vehicular ad hoc networks (VANETs). Parking port finding is one of the useful VANETs applications. In this paper, the authors discuss a parking space finding method based on VANETs. To send the free parking places information to the drivers efficiently, a clustering multi-hop routing method is proposed. Compared with the other routing methods, the simulation results prove that the developed method is effective.

• Record URL:
  • https://doi.org/10.1061/41186(421)150
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784411865
• Supplemental Notes:
  • Copyright © 2011 ASCE
• Corporate Authors:

  American Society of Civil Engineers

  1801 Alexander Bell Drive
  Reston, VA  United States  20191-4400
• Authors:
  • Tian, Daxin
  • Wang, Yunpeng
  • Lu, Guangquan
  • Yu, Guizhen
  • Duan, Xuting
  • Liu, He
• Conference:
  • 11th International Conference of Chinese Transportation Professionals (ICCTP)
  • Location: Nanjing , China
  • Date: 2011-8-14 to 2011-8-17
• Publication Date: 2011

Language

• English

Media Info

• Media Type: Digital/other
• Features: References;
• Pagination: pp 1511-1520
• Monograph Title: ICCTP 2011: Towards Sustainable Transportation Systems

Subject/Index Terms

• TRT Terms: Information processing; Parking; Parking demand; Parking facilities; Parking garages; Routing; Wireless communication systems
• Subject Areas: Highways; Terminals and Facilities; I21: Planning of Transport Infrastructure;

Filing Info

• Accession Number: 01450214
• Record Type: Publication
• ISBN: 9780784411865
• Files: TRIS, ASCE
• Created Date: Oct 25 2012 9:19AM