Abstract
Nowadays, many studies demonstrate that one of the main causes of traffic congestion is the search for available parking lots. In this paper, we want to exploit the VANETs potentialities in order to overcome this problem, with the aim of improving the traffic conditions, by helping drivers to easily identify free parking lots in a urban area. The challenge is try to use information exchange between vehicles, in order to communicate parking information. To this goal, we analyze the well known distance geometry problem (DGP), by adapting it to our situation. This problem cares about how, starting from a graph, we can locate its nodes according to the known distances between some pairs of them. In our situation, the idea is to deal with the DGP, by using an inverse procedure: we start from a network where each vehicle is located by a global positioning system (GPS), and then we want to obtain a corresponding graph which contains useful information about parking lots in a certain area. For this purpose, we divide a huge urban area in some smaller clusters, by exploiting road side units (RSUs) and we separate vehicles in three groups corresponding to three possible states they can assume within a cluster, associating a different color to each of them in the corresponding graph. We make clear this model by means of logic programming, which offers compactness and intuitively, allowing us abstracting from concrete structures and variables concerning a procedural language and to explain the features of this framework in an elegant way. To this end, we provide a Prolog algorithm for the graph configuration and evolution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mucherino, A., Lavor, C., Liberti, L.: The discretizable distance geometry problem. Optimization Letters, 1–16 (2012)
Lavor, C., Lee, J., John, A.L.S., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optimization Letters 6(4), 783–796 (2012)
Lavor, C., Liberti, L., Mucherino, A., Maculan, N.: On a discretizable subclass of instances of the molecular distance geometry problem. In: Proceedings of the 2009 ACM Symposium on Applied Computing, pp. 804–805 (2009)
Morè, J.J., Wu, Z.: Distance geometry optimization for protein structures. J. Global Optim. 15(3), 219–234 (1999)
Lavor, C., Liberti, L., Mucherino, A.: The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances. J. Global Optim. 1–17 (2013)
Panayappan, R., Trivedi, J.M., Studer, A., Perrig, A.: VANET-based approach for parking space availability. In: Proceedings of the Fourth ACM International Workshop on Vehicular Ad Hoc Networks, pp. 75–76 (2007)
Caliskan, M., Graupner, D., Mauve, M.: Decentralized discovery of free parking places. In: Proceedings of the 3rd International Workshop on Vehicular Ad Hoc Networks, pp. 30–39 (2006)
Caliskan, M., Barthels, A., Scheuermann, B., Mauve, M.: Predicting parking lot occupancy in vehicular ad hoc networks. In: IEEE 65th Vehicular Technology Conference, VTC2007-Spring, pp. 277–281 (2007)
Shoup, D.C.: Cruising for parking. Transp. Policy 13(6), 479–486 (2006)
Shoup, D., Campbell, H.: Gone parkin’. The New York Times, 29 (2007)
Dowling, C., Fiez, T., Ratliff, L., Zhang, B.: How much urban traffic is searching for parking?. arXiv preprint arXiv:1702.06156 (2017)
Szczurek, P., Xu, B., Wolfson, O., Lin, J., Rishe, N.: Learning the relevance of parking information in VANETs. In: Proceedings of the Seventh ACM International Workshop on VehiculAr InterNETworking, pp. 81–82 (2010)
Amato, F., Moscato, F.: Exploiting cloud and workflow patterns for the analysis of composite cloud services. Future Gener. Comput. Syst. 67, 255–265 (2017)
Amato, F., Moscato, F.: Pattern-based orchestration and automatic verification of composite cloud services. Comput. Electr. Eng. 56, 842–853 (2016)
Amato, F., De Pietro, G., Esposito, M., Mazzocca, N.: An integrated framework for securing semi-structured health records. Knowl.-Based Syst. 79, 99–117 (2015)
Amato, F., Moscato, F.: Model transformations of MapReduce design patterns for automatic development and verification. J. Parallel Distrib. Comput. (2016)
Bruni, R., Montanari, U.: Models of computation. Springer International Publishing, Switzerland (2017)
Balzano, W., Del Sorbo, M.R., Stranieri, S.: A logic framework for C2C network management. In: 2016 30th International Conference Advanced Information Networking and Applications Workshops (WAINA), pp. 52–57 (2016)
Balzano, W., Del Sorbo, M.R., Murano, A., Stranieri, S.: A logic-based clustering approach for cooperative traffic control systems. In: International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 737–746 (2016)
Balzano, W., Murano, A., Stranieri, S.: Logic-based clustering approach for management and improvement of VANETs. J. High Speed Netw. 23(3), 225–236 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Balzano, W., Stranieri, S. (2018). LoDGP: A Framework for Support Traffic Information Systems Based on Logic Paradigm. In: Xhafa, F., Caballé, S., Barolli, L. (eds) Advances on P2P, Parallel, Grid, Cloud and Internet Computing. 3PGCIC 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 13. Springer, Cham. https://doi.org/10.1007/978-3-319-69835-9_66
Download citation
DOI: https://doi.org/10.1007/978-3-319-69835-9_66
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69834-2
Online ISBN: 978-3-319-69835-9
eBook Packages: EngineeringEngineering (R0)