2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (2009)
Oct. 12, 2009 to Oct. 14, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WiMob.2009.35
We consider that a given number of Dissemination Points (DPs) have to be deployed for disseminating information to vehicles travelling in an urban area. We formulate our problem as a Maximum Coverage Problem (MCP) so as to maximize the number of vehicles that get in contact with the DPs and as a second step with a sufficient amount of time. Since the MCP is NP-hard, we solve it though heuristic algorithms. Evaluation of the proposed solutions in a realistic urban environment shows how knowledge of vehicular mobility plays a major role in achieving an optimal coverage of mobile users, and that simple heuristics provide near-optimal results even in large-scale scenarios.
Vehicular networks, network planning, maximum coverage
J. M. Barcelo-Ordinas, C.-F. Chiasserini, O. Trullols, C. Casetti, M. Fiore, "A Max Coverage Formulation for Information Dissemination in Vehicular Networks", 2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), vol. 00, no. , pp. 154-160, 2009, doi:10.1109/WiMob.2009.35