Hotspot discovery algorithms in coverage selection model over VANETs

The RSU deployment algorithms to cover interest regions have emerged as promising areas of research in vehicular ad hoc networks. However, there is few research on the discovery of the interest regions. Besides, the deployment algorithms are usually proposed for either continuous coverage or sparse coverage. The wisdom of the model selection are rarely addressed. In this paper, we proposed a new algorithm to discover interest regions. A budget-constrained coverage selection algorithm is also presented to help network designers choose suitable coverage models to meet the budget and quality requirements. The algorithms are implemented on top of Ns2 and the simulations are carried out using SUMO and OpenStreet Maps. The performance comparison between our algorithm and other two clustering algorithms prove that our algorithm has a better performance in terms of contact time for both sparse coverage and continue coverage.