Decentralized discovery of free parking places
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
VANET-based approach for parking space availability
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
Dynamic parking negotiation and guidance using an agent-based platform
Expert Systems with Applications: An International Journal
Estimating the Relevance of Information in Inter-Vehicle Ad Hoc Networks
MDMW '08 Proceedings of the 2008 Ninth International Conference on Mobile Data Management Workshops
Learning the relevance of parking information in VANETs
Proceedings of the seventh ACM international workshop on VehiculAr InterNETworking
Event sharing in vehicular networks using geographic vectors and maps
Mobile Information Systems
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Management of urban parking: an agent-based approach
AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
Online Localized Resource Allocation Application to Urban Parking Management
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Probabilistic parking queries using aging functions
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Sharing with caution: Managing parking spaces in vehicular networks
Mobile Information Systems
Hi-index | 0.00 |
By exchanging events in a vehicular ad hoc network, drivers can receive interesting information while driving. For example, they can be informed of available parking spaces in their vicinity. Obviously, a suitable protocol is needed to disseminate the events efficiently within the area where they are relevant. Moreover, in such a competitive context where each vehicle may be interested in the resource, it is crucial not to broadcast that resource to each driver in the vicinity. Otherwise, those drivers would waste time trying to reach a parking space and only one of them would be satisfied, which would lead to a poor satisfaction in the system. To solve this problem, we detail in this paper a reservation protocol that efficiently allocates parking spaces in vehicular ad hoc networks and avoids the competition among the vehicles. We have integrated our protocol within VESPA, a system designed for vehicles to share information in VANETs.