Deployment of roadside units based on partial mobility information

This work presents an algorithm for deployment of roadside units based on partial mobility information. We propose the partition of the road network into same size urban cells, and we use the migration ratios between adjacent urban cells in order to infer the better locations for the deployment of the roadside units. Our goal is to identify those α locations maximizing the number of distinct vehicles experiencing at least one V2I contact opportunity. We compare our strategy to two deployment algorithms: MCP-g relies on full mobility information (full knowledge of the vehicles trajectories), while MCP-kp does not assume any mobility information at all. Results demonstrate that our strategy increases the number of distinct vehicles contacting the infrastructure in 6.8% when compared to MCP-kp. On the other hand, MCP-g overcomes our strategy by 8.5%. We must evaluate whether the 8.5% improvement worthies tracking the trajectories of vehicles. Complementary, the marginal contribution of adding a new roadside unit becomes much more assertive when employing our strategy, enabling a better evaluation of the return on investments by network designers. Such guarantees are not provided by MCP-kp, and they are too weak in MCP-g.