By Topic

Value of information exposed: Wireless networking solutions to the parking search problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Evangelia Kokolaki ; Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Athens, Greece ; Merkouris Karaliopoulos ; Ioannis Stavrakakis

Our work draws on a concrete parking space search application to explore fundamental tradeoffs of wireless networking solutions to the provision of real-life services. In particular, we consider a city area, wherein each vehicle (mobile user) moves towards a chosen destination and seeks vacant parking space in its vicinity. Three main approaches to the parking space search problem are investigated, each representing a distinct paradigm of how wireless networking communications can assist the information management process. In the first approach, the vehicles execute the currently common “blind” sequential search for parking space by wandering around the destination. In the second distributed approach, the vehicles, while moving around the area, opportunistically collect and share with each other information on the location and status of each parking spot they encounter. Finally, with the third approach, the allocation of parking spots is managed by a central server availing global knowledge about the parking space availability. We compare the three approaches with respect to the time and distance vehicles need to travel before they park as well as the proximity of the assigned parking spots to the travel destinations. Results obtained under two scenarios for the user travel preferences (uniformly distributed travel destinations vs. a single hotspot road), reveal that the relative performance of the three solutions can vary significantly and not always inline with intuition. In the hotspot scenario, the centralized system consistently yields the minimum times and distances at the expense of more distant parking spot assignments; whereas, when user travel destinations are uniformly distributed, the relative performance of all three schemes changes as the vehicle volume grows, with the centralized approach gradually becoming the worst solution. We discuss the way each approach modulates the information dissemination process in space and time and resolve- - s the emerging competition for the parking resources. We also outline models for getting analytical insights to the behavior of the centralized approach.

Published in:

Wireless On-Demand Network Systems and Services (WONS), 2011 Eighth International Conference on

Date of Conference:

26-28 Jan. 2011