A Cloud-Based Smart-Parking System Based on Internet-of-Things Technologies

 A Cloud-Based Smart-Parking System Based

         on Internet-of-Things Technologies

Abstract:

 This paper introduces a novel algorithm that increases the efficiency of the current cloud-based smart-parking system and develops a network architecture based on the Internet-of-Things technology. This paper proposed a system that helps users automatically find a free parking space at the least cost based on new performance metrics to calculate the user parking cost by considering the distance and the total number of free places in each car park. This cost will be used to offer a solution of finding an available parking space

upon a request by the user and a solution of suggesting a new car park if the current car park is full. The simulation results show that the algorithm helps improve the probability of successful parking and minimizes the user waiting time. We also successfully implemented the proposed system in the real world.

 In the development of traffic management systems, an intelligent

parking system was created to reduce the cost of hiring people and for optimal use of resources for car-park owners. Currently, the common method of finding a parking space is manual where the driver usually finds a space in the street through luck and experience. This process takes

time and effort and may lead to the worst case of failing to find any parking space if the driver is driving in a city with high vehicle density. The alternative is to find a predefined car park with high capacity. However, this is not an optimal solution because the car park could usually be far away from the user destination. In recent years, research has used vehicle-to-vehicle   and vehicle-to infrastructure  interaction with the support of various wireless network technologies such as radio frequency identification (RFID), Zig bee, wireless mess network , and the Internet. This study aimed to provide information about nearby parking spaces for the driver and to make a reservation minutes earlier using supported devices such as smart phones or tablet PCs. Furthermore, the services use the ID of each vehicle in booking a parking space

Existing System

The current intelligent parking system does not provide an overall optimal solution in finding an available parking space, does not solve the problem of load balancing, does not provide economic benefit, and does not plan for vehicle-refusal service

.Proposed System

      To resolve the aforementioned problems and take advantage of the significant development in technology, the Internet-of-Things technology (IoT) has created a revolution in many fields in life as well as in smart-parking system (SPS) technology . The present study proposes and develops

an effective cloud-based SPS solution based on the Internet of Things. Our system constructs each car park as an IoT network, distance between car parking areas and number of free slots in car park areas will be transferred to the data center.

                            The data center serves as a cloud server to calculate the costs

of a parking request, and these costs are frequently updated and are accessible any time by the vehicles in the network. The SPS is based on several innovative technologies and can automatically monitor and manage car parks. Furthermore, in the proposed system, each car park can function independently as a traditional car park.

Algorithm:

Algorithm for updating the status of the car park:

We build the mathematical models of our proposed system based on the results in  and . We create a   strategy. We let P denote the set of all vehicles with parking queries in the queue. We let S denote the total of all available car parks. We let W denote the set of wij, where wij is the cost between vehicle pi (pi 2 P) and car park Sj (Sj 2 S).

We can achieve W by calculating the distance from the vehicle to the car park and the number of free spaces in car park Sj. We let M and N be the size of P and S ,respectively. Therefore, the size of W is. By assuming that vehicles are jobs and parking places are servers, W ij is the cost for server Sj to do job Pi. We save the solution in X, where  xij  2 X, i.e.,

We let C be the total cost for all vehicles in P to go to the

parking places assigned to them by the SPS, i.e.,

         

In our study, we use F(_, _) as the cost; thus, we have a

new total cost.

         

Module Description

    In User Module

1.                Login / Register

2.                View Over All Parking Status

3.                Book for Parking

4.                View Booked Status

5.                View Parked details list

       In Admin Module

6.                Login

7.                View  and process booked details

8.                Detailed reports

9.                Delete leaving vehicle details

In User Module

1.    Login / Register

                  This Application  will provide a secure user-id/password based secured login mechanism to access its services.  The Registration  details will be stored in the server

2.     View Over All Parking Status

The system is derived from the idea of IoT . The system uses the WSN consisting of RFID technology to monitor car parks. An RFID reader counts the percentage of free parking spaces in each car park. The use of RFID

facilitates implementation of a large-scale system at low cost. The system provides a mechanism to prevent disputes in the car park and helps minimize wasted time in looking for a parking space. After logging into the system, the user can choose a suitable parking space. Information on the selected

parking location will be confirmed to the user via notification. Then, the system updates the status of the parking space to ``pending'' during which time the system will not allow other users to reserve it. If after a certain period of pending time the system determines that no car is parked in that space, then it changes the status to ``available.'' The system will update the status from the WSN node (the status of car park spaces) when a new car joins in the system. Therefore, the status of the overall parking system is always updated in real time. The system will help plot the parking time for each parking space in real time and can support the business with hourly parking charges.

  

3.       Book for Parking

                     After  Viewing the available parking space wit minimal cost the user can book their parking slot . The status of the booking will remain as  pending until admin accept the request.

 View Booked Status

1.     View Booked Status

2.     

3.     Therefore, the status of the overall parking system is always updated in real time. The system will help plot the parking time for each parking space in real time and can support the business with hourly parking charges.

4.      

The status of the booking will remain as  pending until admin accept the request. So the user need to check the booking status, The status will be remain as pending until the booking accepted by the admin, After the admin accepted the status will be change as Booked

5.    View Parked details list

                                     User have the permission to see the parked vehicles details from all the parking slots,  This will help to find their  vehicles from a detailed vehicles report  .

                In Admin Module

6.      Login

Only authorized admin have the  permission to allow in the system. So login is used to find the authorized Admin.

7.     View  and process booked details

       The user requested booking details can be view to the admin, Admin is the authority to accept the booking request, The parking status will be remain as pending until the admin accepted by the request.

8.     Detailed reports

           Admin will provide a detailed report for further references, it will include date wise report of parked vehicles in the parking space. This will be used for further references.

Conclusion

      This study has proposed a parking system that improves performance by reducing the number of users that fail to find a parking space and minimizes the costs of moving to the parking space. Our proposed architecture and system has been successfully simulated and implemented in a real situation. The results show that our algorithm significantly reduces the average waiting time of users for parking. Our results closely agree with those of our proposed mathematical models. The simulation of our system achieved the optimal solution when most of the vehicles successfully found a free parking space. The average waiting time of each car park for service becomes minimal, and the total time of each vehicle in each car park is reduced. In our future study, we will consider the security aspects of our system as well as implement our proposed system in large scales in the real world.