Joint Roadside Unit Deployment and Service Task Assignment for Internet of Vehicles (IoV)

Abstract

Internet of Vehicles (IoV) is a promising Internet of Things application, where roadside unit (RSU) plays an important role for network service provisioning. How to select the number and locations of RSUs to deploy and allocate the traffic load to them is a critical and practical open problem. Most of the existing work focused on 1-D scenarios assuming unlimited RSU capacity, while a more practical 2-D case with limited RSU capacity has not been fully considered yet. In this paper, we investigate an RSU deployment problem for 2-D IoV networks considering the expected delivery delay requirements and task assignment. We formulate a novel utility-based maximization problem to solve the RSU deployment problem, where the utility function indicates the total benefit from the RSU deployment. We observe that each RSU has an irregular service area, which makes the problem much more difficult than the traditional facility location problem. Then, we design a utility-based RSU deployment algorithm (URDA), a linear programming-based clustering algorithm, to solve the problem. The gap between URDA and the optimal solution has been analyzed, which proved that the proposed URDA is near optimal if the deployment cost is low. Extensive simulations have been conducted to demonstrate the effectiveness and superiority of the proposed solution for IoV network service guarantee over other approaches.