Teng Liu
ABSTRACT
Control of conventional transportation networks aims at bringing the state of the network to the system optimal (SO) state. This optimum is characterized by the minimality of the social cost function, i.e., the total cost of travel of all drivers. On the other hand, drivers are assumed to be rational and selfish, and make their travel decisions to optimize their own travel costs, bringing the state of the network to a user equilibrium (UE). In this paper, we model the behavior of users in the future connected vehicular transportation networks, where users consider both the travel cost and the utility from data communication when making their travel decisions. We divide the users into two groups based on the kind of data network they are using. We leverage the data communication aspect of the decision making to influence the user route choices, driving the UE state to the SO state. We propose a V2I bandwidth allocation scheme, which provides a guideline on how the system operator can adjust the parameters of the communication network to achieve the optimal UE.
- Haitham M Al-Deek, Asad J Khattak, and Paramsothy Thananjeyan. 1998. A combined traveler behavior and system performance model with advanced traveler information systems. Transportation Research Part A: Policy and Practice, Vol. 32, 7 (1998), 479--493.Google Scholar
Cross Ref
- Osama Attia and Tamer A. ElBatt. 2012. On the Role of Vehicular Mobility in Cooperative Content Caching. CoRR Vol. abs/1203.0657 (2012), 350--354.Google Scholar
- M. J. Beckman, C. B. McGuire, and C. B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press.Google Scholar
- Chaoyi Bian, Tong Zhao, Xiaoming Li, Xiaojiang Du, and Wei Yan. 2016. Theoretical analysis on caching effects in urban vehicular ad hoc networks. Wireless Communications and Mobile Computing Vol. 16 (Sept. . 2016), 1759--1772. Issue 13. Kay Axhausen, Robert Schlich, and René Zbinden. 2010. Models of mode choice and mobility tool ownership beyond 2008 fuel prices. Transportation Research Record: Journal of the Transportation Research Board 2157 (2010), 86--94. Google ScholarDigital Library
- T. L. Wilke, T. Patcharinee, and N. F. Maxemchuk. 2009. A survey of inter-vehicle communication protocols and their applications. IEEE Communications Surveys and Tutorials Vol. 11, 2 (2009), 3--20. Google ScholarDigital Library
- J. Yao, S. S. Kanhere, and M. Hassan. 2012. Improving QoS in High-Speed Mobility Using Bandwidth Maps. IEEE Transactions on Mobile Computing Vol. 11, 4 (April. 2012), 603--617. 1536--1233 Google ScholarDigital Library
- H. Youn, M. T. Gastner, and H. Jeong. 2008. Price of Anarchy in Transportation Networks: Efficiency and Optimality Control. Physics Review Letters Vol. 101, 12 (2008), 128701.Google ScholarCross Ref
- Shanyu Zhou and Hulya Seferoglu. 2016. Connectivity-aware Traffic Phase Scheduling for Heterogeneously Connected Vehicles Proceedings of the First ACM International Workshop on Smart, Autonomous, and Connected Vehicular Systems and Services (CarSys '16). 44--51. Google ScholarDigital Library
Index Terms
- Infrastructure Bandwidth Allocation for Social Welfare Maximization in Future Connected Autonomous Vehicular Networks
Recommendations
Multidimensional Dynamic Pricing for Welfare Maximization
EC '17: Proceedings of the 2017 ACM Conference on Economics and ComputationWe study the problem of a seller dynamically pricing d distinct types of indivisible goods, when faced with the online arrival of unit-demand buyers drawn independently from an unknown distribution. The goods are not in limited supply, but can only be ...
Nash Social Welfare Approximation for Strategic Agents
EC '17: Proceedings of the 2017 ACM Conference on Economics and ComputationThe fair division of resources among strategic agents is an important age-old problem that has led to a rich body of literature. At the center of this literature lies the question of whether there exist mechanisms that can implement fair outcomes, ...
Welfare and Profit Maximization with Production Costs
FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer ScienceCombinatorial Auctions are a central problem in Algorithmic Mechanism Design: pricing and allocating goods to buyers with complex preferences in order to maximize some desired objective (e.g., social welfare, revenue, or profit). The problem has been ...
Comments