Planning roadside units for information dissemination in urban VANET

Abstract

With the development of vehicular ad hoc network (VANET), data dissemination has been widely studied and its performance is expected to be greatly improved. Research on data dissemination generally focuses on how to utilize road infrastructures, such as roadside units (RSUs), to facilitate the dissemination. In this paper, we consider a VANET where a given number of RSUs are available for disseminating information in an urban area.We formulate the problem as to minimize the number of RSUs selected from the available RSUs to cover a specific region. The paper proposes a c-street model and a city model. Then we develop a greedy polynomial time covering algorithm under the c-street model and a polynomial time approximation scheme is proposed under the city model based on shifting strategy. By evaluating the proposed solution in realistic urban environment, our simple greedy algorithm is implemented and some simulation results are provided.