Parking Space Discovery System in Vehicular Ad hoc Networks
碩士 === 國立中央大學 === 資訊工程研究所 === 97 === Looking for parking spaces is usually a serious problem in urban cities. In order to reduce the time for seeking parking spaces and save the fuel, the parking spaces finding schemes become an important research issue in vehicular ad hoc networks (VANETs). Using t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/00216684303812716694 |
| Summary: | 碩士 === 國立中央大學 === 資訊工程研究所 === 97 === Looking for parking spaces is usually a serious problem in urban cities. In order to reduce the time for seeking parking spaces and save the fuel, the parking spaces finding schemes become an important research issue in vehicular ad hoc networks (VANETs). Using the embedded wireless devices on parking meters and vehicles, the parking spaces information can be spread in the VANETs. With the help of this information, drivers will not have to waste a lot of time for finding parking spaces. In this article, we propose a distributed scheme to discover the parking spaces efficiently. Our scheme is based on a hierarchical structure to transmit parking spaces information to other parking meters in the VANETs. According to the characteristic that drivers are interested in detail parking spaces information nearby the destination but just have to know rough information about parking spaces in a distant place. We use discrete cosine transform to convert parking spaces information to a rough spatial distribution and have less data size to be able to transfer in VANETs and cost less overhead. The simulation results show that the availability and accuracy of parking spaces information is high in nearby region and slightly lower in distant place. The communication overhead of our scheme is lower than previous work.
|
|---|