Research articleBinary search tree based hierarchical placement algorithm for IoT based smart parking applications
Introduction
The parking problem in big cities, has become one of the key causes of the city traffic congestion, driver frustration and air pollution [18]. In the future, it is expected to have an increase in the demand for the intelligent parking services because of the rapid growth in world population as well as the automotive industries. An effective solution to this service can be provided by many new technologies [5]. According to [8], people waste away liters of gas just trying to parking. On average 30% of traffic is caused while looking for an available parking spot. As discussed in [15], drivers waste 3.5–14 min on average to find a parking spot. In addition, it increases traffic congestion, accidents, fuel consumption and air pollution. Smart parking solutions can help to mitigate these problems. This study concentrates on placement algorithms which are used in smart parking applications. Another important factor to take into account is the cases where the location of alternative parking spots are evaluated, for example, a case where the distance to the free spot is not the optimum one available. As discussed in [7], an effective parking placement strategy makes the better use of parking spot resources possible. In this paper, we present a hierarchical placement approach with binary search tree(BST) based on nearest location. First, the nearest parking area is located. Once the optimum distance car park is found, it is used for the second stage of search to locate the available parking spot This hierarchical method with BST significantly improves the search process in terms of required search time and energy efficiency. Time is the most valuable metric in our project. By using a hierarchy in placement algorithm, we consume less time while finding nearest empty spot in car park. Saving time while parking a car means that we save energy, fuel, even less CO2 emission. As a summary, main objective of this project is saving time using hierarchical approach with BST in placement algorithm. The rest of this paper is organized as follows. Related works in the literature are discussed in Section 2. Section 3 presents and explains the proposed approach. In Section 4, simulation results are discussed and a comparison between the new approach and the non-hierarchical approach is performed. Section 5 concludes the study and gives recommendations about future directions.
Section snippets
Related works
It is possible to categorize the existing studies for smart parking applications as open and close area types. When existing studies are investigated, it can be seen that most of the solutions in the literature mainly focus on close area parking spaces [15]. It is easier to control close areas in terms of availability of parking spots by using sensors in entrance and exit points. In addition, the fragile nature of wireless sensors makes open area applications more challenging. Maintenance and
Hierarchical approach
In this section, the hierarchical placement approach is presented and explained. This approach includes two levels of hierarchy as shown in Fig. 1, to make placement process more efficient. First level is the identification of suitable car park. In the first level, algorithm only checks nearest car park. For example, the car park in our university Middle East Technical University Northern Cyprus Campus (METU NCC) has seven car parks which are culture convention center car park, academic
Simulation and results
In simulation, same scenarios are used to evaluate non-hierarchical, hierarchical and hierarchical with BST approaches. In addition, same uniformly and exponentially distributed car parks and parking spots are used. The only difference is how we store car parks and parking spots. In non-hierarchical one, they are stored as linked lists and there is no hierarchy. In hierarchical one data structure is again same, but the hierarchy is applied. In the hierarchical with BST approach, binary search
Conclusion and future work
The concept of IoT is rapidly becoming more and more popular with variety of application areas. IoT concept is going to become an important part of our daily life, and work life. It can be employed efficiently to create more comfortable environment and living spaces. On the other hand, our planet needs some green solutions because energy efficiency is a very important concept nowadays as we are running out of energy resources. This paper introduces an energy and time efficient approach which
References (26)
The evidence base for parking policiesa review
Transp. Policy
(2006)- et al.
Dynamic pricing for reservation-based parking system: a revenue management method
Transp. Policy
(2018) - et al.
A real-time parking prediction system for smart cities
J. Intell. Transp. Syst.
(2016) - V. W. S. Tang, Y. Zheng, J. Cao, An intelligent car park management system based on wireless sensor networks,...
- et al.
Design and implementation of a prototype smart parking (spark) system using wireless sensor networks
Proceedings of the 2009. WAINA’09. International Conference on Advanced Information Networking and Applications Workshops
(2009) - et al.
Smart parking: parking occupancy monitoring and visualization system for smart cities
SoutheastCon, 2016
(2016) - et al.
A comparative study of different sensors for smart car park management
IPC
(2007) - et al.
On-street and off-street parking availability prediction using multivariate spatiotemporal models
IEEE Trans. Intell. Transp. Syst.
(2015) - et al.
Park system: a review of smart parking system and its technology
Inf. Technol. J.
(2009) - et al.
An algorithm of parking planning for smart parking system
Proceedings of the Eleventh World Congress on Intelligent Control and Automation (WCICA)
(2014)