The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Data aggregation and roadside unit placement for a vanet traffic information system
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
A Novel Approach for Infrastructure Deployment for VANET
FGCN '08 Proceedings of the 2008 Second International Conference on Future Generation Communication and Networking - Volume 01
Access-points deployment for vehicular networks based on group centrality
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
A power-saving model for roadside unit deployment in vehicular networks
IEEE Communications Letters
An efficient routing protocol for green communications in vehicular ad-hoc networks
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
An adaptive approach for information dissemination in Vehicular Ad hoc Networks
Journal of Network and Computer Applications
Vehicle Ad Hoc networks: applications and related technical issues
IEEE Communications Surveys & Tutorials
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
A tutorial survey on vehicular ad hoc networks
IEEE Communications Magazine
A geometry-based coverage strategy over urban VANETs
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
| Hi-index | 0.00 |
A VANET is a network where each node represents a vehicle equipped with wireless communication technology. This type of network enhances road safety, traffic efficiency, Internet access and many others applications to minimize environmental impact and in general maximize the benefits for the road users. This paper studies a relevant problem in VANETs, known as the deployment of RSUs. A RSU is an access points, used together with the vehicles, to allow information dissemination in the roads. Knowing where to place these RSUs so that a maximum number of vehicles circulating is covered is a challenge. We model the problem as a Maximum Coverage with Time Threshold Problem (MCTTP), and use a genetic algorithm to solve it. The algorithm is tested in four real-world datasets, and compared to a greedy approach previously proposed in the literature. The results show that our approach finds better results than the greedy in all scenarios, with gains up to 11 percentage points.