A Max Coverage Formulation for Information Dissemination in Vehicular Networks

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 sec...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications pp. 154 - 160
Main Authors Trullols, O., Barcelo-Ordinas, J.M., Fiore, M., Casetti, C., Chiasserini, C.-F.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2009
Subjects
Ad hoc networks
Computer networks
Heuristic algorithms
maximum coverage
Mobile communication
Mobile computing
network planning
Network topology
Roads
Urban areas
Vehicles
Vehicular networks
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9780769538419
076953841X
ISSN:2160-4886
DOI:10.1109/WiMob.2009.35