A Max coverage formulation for information dissemination in vehicular networks
Document typeConference lecture
PublisherIEEE Press. Institute of Electrical and Electronics Engineers
Rights accessOpen Access
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.
CitationTrullols, O. [et al.]. A Max coverage formulation for information dissemination in vehicular networks. A: IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. "5th. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications". Marrakech: IEEE Press. Institute of Electrical and Electronics Engineers, 2009, p. 154-160.
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