A parking space allocation algorithm based on distributed computing Online publication date: Tue, 01-Sep-2020
by Guanlin Chen; Huajian Pang; Huang Xu; Wujian Yang; Yong Chen
International Journal of Sensor Networks (IJSNET), Vol. 33, No. 4, 2020
Abstract: In order to make it easier for drivers to find a parking slot, optimise the resources of urban parking slots, and alleviate the problem of parking slot shortage, a distributed parking allocation algorithm was proposed. The algorithm collects the parking requests of user, this parking requests including the current position coordinate information of the users and destination coordinate information, the algorithm allocates parking spaces to users by analysing the available state of parking spaces, then return the parking route planning to the client. Compared with the traditional algorithm, the distributed parking algorithm has a higher ability to withstand pressure and global search capability, and it can ensure the real-time and validity of the parking information, so it can reduce the problem of the parking space shortage and unavailable parking space. The simulation results show that this algorithm can find the solution set more quickly and accurately under the circumstance of high demand. It also has application value and practicality.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook