Download now Free registration required
The authors consider that k infrastructured nodes have to be deployed for disseminating information to vehicles travelling in an urban area. They name the infrastructure nodes Dissemination Points (DPs) and formulate their 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, they solve it though heuristic algorithms, which present different levels of complexity and require different knowledge on the system. Then, they address the problem of covering a large number of vehicles for a sufficient amount of time. They therefore give a different formulation of the problem, which however is still NP-hard and requires a heuristic approach to be solved.
- Format: PDF
- Size: 158.05 KB