Abstract
Dynamic ride sharing is a service that enables shared vehicle rides in real time and on short notice. It can be an effective solution to counter the problem of increasing traffic jams at peak hours in cities. The growing use and popularity of smart phones and GPS-enabled devices provides us with tools required to efficiently implement ride sharing and significantly enhance carpooling. However, privacy and safety concerns are the main obstacles faced when encouraging people to use such a service. In this work, we present “Match Maker,” a negotiation-based model that hides exact location information data for system participants while implementing privacy preserving ride sharing. We use the concept of imprecision (not being precise about location of the user out of set of n locations) and follow the idea of obfuscation, which equates a higher degree of imprecision with a higher degree of privacy. We identify two attack types that could circumvent privacy preserving ride sharing. We compare the Match Maker model with the standard central trusted server model collecting precise location data, which we term eBay model. We provide the first comprehensive approach that integrates privacy, safety and trust in a single model. We present a recursive ellipse-based algorithm to compute an optimal driver path as well as three negotiation strategies for drivers and passengers. We conduct extensive experiments on real road networks and compare the strategies for privacy and effectiveness of ride sharing in terms of traffic load and vehicle km reduction. We show that ride sharing saves between 9% and 21% (on average 12%) of vehicle km if drivers are only prepared to accept slight detours of their usual trips. In the city of Melbourne, with 11.6 million trips a weekday and an average trip length of 10.2 km, this would save 14.2 million km per weekday.
- Niels Agatz, Alan Erera, Martin Savelsbergh, and Xing Wang. 2012. Optimization for dynamic ride-sharing: A review. Eur. J. Operat. Res. 223, 2 (2012), 295--303.Google ScholarCross Ref
- Andrew Amey. 2011. Proposed methodology for estimating rideshare viability within an organization: Application to the MIT community. In Proceedings of the Transportation Research Board 90th Annual Meeting.Google Scholar
- Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, and Gilbert Laporte. 2004. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30, 3 (2004), 377--87.Google ScholarDigital Library
- Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar Dasgupta, and Jie Lin. 2011. Parking slot assignment games. In Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, New York, NY, 299--308.Google ScholarDigital Library
- John W. Baugh Jr, Gopala Krishna Reddy Kakivaya, and John R. Stone. 1998. Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng. Optimiz. 30, 2 (1998), 91--123.Google ScholarCross Ref
- Gerardo Berbeglia, Jean-François Cordeau, and Gilbert Laporte. 2012. A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS J. Comput. 24, 3 (2012), 343--355.Google ScholarDigital Library
- Bureau of Public Roads. 1964. Traffic assignment manual. US Department of Commerce (1964).Google Scholar
- Pablo Samuel Castro, Daqing Zhang, Chao Chen, Shijian Li, and Gang Pan. 2013. From taxi GPS traces to social and community dynamics: A survey. ACM Comput. Surv. (CSUR) 46, 2 (2013), 17.Google ScholarDigital Library
- Vineeta Chaube, Andrea L. Kavanaugh, and Manuel A. Perez-Quinones. 2010. Leveraging social networks to embed trust in rideshare programs. In Proceedings of the 43rd Hawaii International Conference on System Sciences (HICSS). 1--8.Google Scholar
- Chi-Yin Chow and Mohamed F. Mokbel. 2011. Trajectory privacy in location-based services and data publication. SIGKDD Explor. Newslett. 13, 1 (Aug. 2011), 19--29.Google ScholarDigital Library
- Cross-Tab Marketing Services. 2010. Location based services usage and perceptions survey. Retrieved from http://www.microsoft.com/downloads/en/details.aspx?FamilyID=0e52758c-3ab8-49b6-9d84-20cc53c2c308.Google Scholar
- George Danezis, Stephen Lewis, and Ross Anderson. 2005. How much is location privacy worth? In Proceedings of the 4th Workshop on the Economics of Information Security.Google Scholar
- Ugur Demiryurek, Farnoush Banaei-Kashani, Cyrus Shahabi, and Anand Ranganathan. 2011. Online computation of fastest path in time-dependent spatial networks. In Advances in Spatial and Temporal Databases, Dieter Pfoser, Yufei Tao, Kyriakos Mouratidis, Mario A. Nascimento, Mohamed Mokbel, Shashi Shekhar, and Yan Huang (Eds.). Lecture Notes in Computer Science, Vol. 6849. Springer, Berlin, 92--111.Google Scholar
- Bolin Ding, Jeffrey Xu Yu, and Lu Qin. 2008. Finding time-dependent shortest paths over large graphs. In Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology (EDBT’08). ACM, New York, NY, 205--216.Google ScholarDigital Library
- Matt Duckham and Lars Kulik. 2005. A formal model of obfuscation and negotiation for location privacy. In Pervasive Computing, Hans-W. Gellersen, Roy Want, and Albrecht Schmidt (Eds.). Lecture Notes in Computer Science, Vol. 3468. Springer, Berlin, 152--170.Google Scholar
- Matt Duckham and Lars Kulik. 2006. Location privacy and location-aware computing. In Dynamic & Mobile GIS: Investigating Change in Space and Time, J. Drummond, R. Billen, D. Forrest, and E. Joao (Eds.). CRC Press, Boca Raton, FL, 34--51.Google Scholar
- Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, and Andreas Züfle. 2012. Indexing uncertain spatio-temporal data. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM’12). ACM, New York, NY, 395--404.Google ScholarDigital Library
- Masabumi Furuhata, Maged Dessouky, Fernando Ordóñez, Marc-Etienne Brunet, Xiaoqing Wang, and Sven Koenig. 2013. Ridesharing: The state-of-the-art and future directions. Transport. Res. B: Method. 57 (2013), 28--46.Google ScholarCross Ref
- Gyozo Gidofalvi, Torben Bach Pedersen, Tore Risch, and Erik Zeitler. 2008. Highly scalable trip grouping for large-scale collective transportation systems. In Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology (EDBT’08). 678--689.Google ScholarDigital Library
- Hector Gonzalez, Jiawei Han, Xiaolei Li, Margaret Myslinska, and John Paul Sondag. 2007. Adaptive fastest path computation on a road network: A traffic mining approach. In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB’07). VLDB Endowment, 794--805.Google Scholar
- Torsten Hägerstraand. 1970. What about people in regional science? Pap. Region. Sci. 24, 1 (1970), 7--24.Google ScholarCross Ref
- Stephan Hartwig and Michael Buchmann. 2007. Empty seats traveling: Next-generation ridesharing and its potential to mitigate traffic-and emission problems in the 21st century. Technical report, Nokia Research Center, 2007.Google Scholar
- Anand Jatin. 2015. Delhi government asks centre to ban uber, ola, taxi for sure apps. The Hindu. Retrieved from http://www.thehindu.com/news/cities/Delhi/delhi-govt-asks-centre-to-ban-uber-ola-taxi-for-sure-apps/article7031897.ece.Google Scholar
- Hoyoung Jeung, Man Lung Yiu, Xiaofang Zhou, Christian S. Jensen, and Heng Tao Shen. 2008. Discovery of convoys in trajectory databases. Proceedings of the VLDB Endow. 1, 1 (Aug. 2008), 1068--1080.Google ScholarDigital Library
- Beihong Jin and Jiafeng Hu. 2012. Towards scalable processing for a large-scale ride sharing service. In Proceedings of the 2012 9th International Conference on Ubiquitous Intelligence & Computing and 9th International Conference on Autonomic & Trusted Computing (UIC/ATC). IEEE, 940--944.Google ScholarDigital Library
- Eija Kaasinen. 2003. User needs for location-aware mobile services. Pers. Ubiq. Comput. 7, 1 (2003), 70--79.Google ScholarDigital Library
- Ece Kamar and Eric Horvitz. 2009. Collaboration and shared plans in the open world: Studies of ridesharing. In Proceedings of the 21st International Joint Conference on Artificial Intelligence.Google Scholar
- E. Kanoulas, Yang Du, Tian Xia, and Donghui Zhang. 2006. Finding fastest paths on a road network with speed patterns. In Proceedings of the 22nd International Conference on Data Engineering (ICDE’06). 10--10.Google ScholarDigital Library
- John Kell and Smith Geoffrey. 2014. Berlin bans uber app, citing passenger safety concerns. Fortune. http://fortune.com/2014/08/14/uber-berlin-band/.Google Scholar
- Arjun Kharpal. 2014. Sydney to Paris: Uber’s 5 biggest issues right now. CNBC. Retrieved from http://www.cnbc.com/id/102268278#.Google Scholar
- Alexander Kleiner, Bernhard Nebel, and Vittorio A. Ziparo. 2011. A mechanism for dynamic ride sharing based on parallel auctions. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence. 266--272.Google Scholar
- John Krumm. 2007. Inference attacks on location tracks. In Pervasive Computing, Anthony LaMarca, Marc Langheinrich, and Khai Truong (Eds.). Lecture Notes in Computer Science, Vol. 4480. Springer, Berlin, 127--143.Google Scholar
- Bart Kuijpers and Walied Othman. 2009. Modeling uncertainty of moving objects on road networks via spacetime prisms. Int. J. Geogr. Inf. Sci. 23, 9 (2009), 1095--1117.Google ScholarCross Ref
- Bart Kuijpers and Walied Othman. 2010. Trajectory databases: Data models, uncertainty and complete query languages. J. Comput. System Sci. 76, 7 (2010), 538--560.Google ScholarDigital Library
- Shuo Ma, Yu Zheng, and Ouri Wolfson. 2013. T-share: A large-scale dynamic taxi ridesharing service. In Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE’13). 410--421.Google Scholar
- Shao Ma, Yu Zheng, and Ouri Wolfson. 2014. Real-time city-scale taxi ridesharing. IEEE Trans. Know. Data Eng. PP, 99 (2014), 1--1.Google Scholar
- Harvey J. Miller. 1991. Modelling accessibility using space-time prism concepts within geographical information systems. Int. J. Geog. Inform. Syst. 5, 3 (1991), 287--301.Google ScholarCross Ref
- Steven P. Miller, B. Clifford Neuman, Jeffrey I. Schiller, and Jermoe H. Saltzer. 1987. Kerberos authentication and authorization system. In In Project Athena Technical Plan. Citeseer.Google Scholar
- Tijs Neutens, Matthias Delafontaine, Darren M. Scott, and Philippe De Maeyer. 2012. An analysis of day-to-day variations in individual spacetime accessibility. J. Transport Geogr. 23 (2012), 81--91.Google ScholarCross Ref
- Tijs Neutens, Nico Weghe, Frank Witlox, and Philippe Maeyer. 2008. A three-dimensional network-based space-time prism. J. Geogr. Syst. 10, 1 (2008), 89--107.Google ScholarCross Ref
- Sarana Nutanong, Egemen Tanin, Jie Shao, Rui Zhang, and Kotagiri Ramamohanarao. 2012. Continuous detour queries in spatial networks. IEEE Trans. Know. Data Eng. 24, 7 (2012), 1201--1215.Google ScholarDigital Library
- Atsuyuki Okabe, Barry Boots, Kokichi Sugihara, and Sung Nok Chiu. 2000. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams (2nd ed.). John Wiley and Sons, Inc., New York, NY.Google ScholarCross Ref
- Gang Pan, Guande Qi, Wangsheng Zhang, Shijian Li, Zhaohui Wu, and L. T. Yang. 2013. Trace analysis and mining for smart cities: Issues, methods, and applications. IEEE Commun. Mag. 51, 6 (June 2013), 120--126.Google ScholarCross Ref
- Manoj M. Prabhakaran and Amit Sahai. 2013. Secure Multi-Party Computation. Vol. 10. IOS Press.Google Scholar
- Kenneth Radke, Margot Brereton, Seyed Hadi Mirisaee, Sunil Ghelawat, Colin Boyd, and Juan Manuel González Nieto. 2011. Tensions in developing a secure collective information practice—the case of agile ridesharing. In Proceedings of the 13th IFIP TC 13 International Conference on Human-Computer Interaction (INTERACT’11). 524--532.Google ScholarCross Ref
- Tim Roughgarden and Éva Tardos. 2002. How bad is selfish routing? Journal of the ACM (JACM) 49, 2 (2002), 236--259.Google ScholarDigital Library
- Douglas Oliveira Santos and Eduardo Candido Xavier. 2013. Dynamic taxi and ridesharing: A framework and heuristics for the optimization problem. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence.Google Scholar
- Eric Hal Schwartz. 2014. Now lyft is in the hot seat over privacy policy. DC Inno. Retrieved from http://dcinno.streetwise.co/2014/12/03/lyft-hot-seat-privacy-policy-al-franken/.Google Scholar
- Ben Smith. 2014. Uber executive suggests digging up dirt on journalists. BuzzFeed News (November 2014). Retrieved from http://www.buzzfeed.com/bensmith/uber-executive-suggests-digging-up-dirt-on-journalists#.vbR2wylpG.Google Scholar
- Christoph Stach and Andreas Brodt. 2011. vHike - a dynamic ride-sharing service for smartphones. In Mobile Data Management. 333--336.Google Scholar
- Gayatri Swamynathan, Ben Y. Zhao, and Kevin C. Almeroth. 2005. Decoupling service and feedback trust in a peer-to-peer reputation system. In Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. Lecture Notes in Computer Science, Vol. 3759. Springer, Berlin, 82--90.Google Scholar
- Roger F. Teal. 1987. Carpooling: Who, how and why. Transport. Res. A: Gen. 21, 3 (1987), 203--214.Google ScholarCross Ref
- Manolis Terrovitis, Spiridon Bakiras, Dimitris Papadias, and Kyriakos Mouratidis. 2005. Constrained shortest path computation. In Advances in Spatial and Temporal Databases, Claudia Bauzer Medeiros, Max J. Egenhofer, and Elisa Bertino (Eds.). Lecture Notes in Computer Science, Vol. 3633. Springer, Berlin, 181--199.Google Scholar
- Goce Trajcevski, Alok Choudhary, Ouri Wolfson, Li Ye, and Gang Li. 2010. Uncertain range queries for necklaces. In Eleventh International Conference on Mobile Data Management (MDM), 2010. IEEE, 199--208.Google ScholarDigital Library
- Jiajie Xu, Limin Guo, Zhiming Ding, Xiling Sun, and Chengfei Liu. 2012. Traffic aware route planning in dynamic road networks. In Database Systems for Advanced Applications, Sang-goo Lee, Zhiyong Peng, Xiaofang Zhou, Yang-Sae Moon, Rainer Unland, and Jaesoo Yoo (Eds.). Lecture Notes in Computer Science, Vol. 7238. Springer, Berlin, 576--591.Google Scholar
- Kai Zheng, Goce Trajcevski, Xiaofang Zhou, and Peter Scheuermann. 2011. Probabilistic range queries for uncertain trajectories on road networks. In Proceedings of the 14th International Conference on Extending Database Technology (EDBT/ICDT’11). ACM, New York, NY, 283--294.Google ScholarDigital Library
Index Terms
- Privacy-Aware Dynamic Ride Sharing
Recommendations
Passenger Trip Planning using Ride-Sharing Services
CHI '18: Proceedings of the 2018 CHI Conference on Human Factors in Computing SystemsRide-sharing can potentially address transportation challenges such as traffic congestion and air pollution by letting drivers share their cars unused capacity with a number of passengers. However, even though multiple ride-sharing services exist and ...
Price-aware real-time ride-sharing at scale: an auction-based approach
SIGSPACIAL '16: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsReal-time ride-sharing, which enables on-the-fly matching between riders and drivers (even en-route), is an important problem due to its environmental and societal benefits. With the emergence of many ride-sharing platforms (e.g., Uber and Lyft), the ...
Congestion-Aware Ride-Sharing
Special Issue on SIGSPATIAL 2017In its current form, ride-sharing is responsible for a small fraction of traffic load compared to other transportation modes, especially private vehicles. As its benefits became more evident, and obstacles, e.g., lack of liability legislation, that may ...
Comments