A Max coverage formulation for information dissemination in vehicular networks
Visualitza/Obre
Cita com:
hdl:2117/9908
Tipus de documentComunicació de congrés
Data publicació2009
EditorIEEE Press. Institute of Electrical and Electronics Engineers
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
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.
CitacióTrullols, 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.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
05325298.pdf | 226,6Kb | Visualitza/Obre |