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. 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.
CitationTrullols, O. [et al.]. Information dissemination in VANETs: deployment strategies for maximizing coverage. A: Euro-NF Workshop on Wireless and Mobility. "6th. Euro-NF Workshop on Wireless and Mobility in the Network of the Future". Stresa, Lago Maggiore: 2009, p. 1-6.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com