SummaryA Vehicle AdHoc Network is mainly composed of mobile vehicles and fixed Road Site Units (RSUs). The latter is usually very expensive to deploy and has a crucial role in maintaining the network connectivity. Therefore, the design of an efficient RSU deployment strategy that enables a high coverage ratio and a lower deployment cost has been of paramount importance. In this respect, we introduce in this paper a new spatiotemporal coverage strategy for nonsafety Vehicle AdHoc Network applications like driving assistance and business promotion, called Minimal Mobility Patterns Coverage (MPC). The main thrust of MPC is to (1) depict the mobility patterns of moving vehicles from their trace files and then (2) compute the adequate RSU locations in order to cover the extracted mobility patterns by the minimal possible number of RSUs. To this end, we firstly provide a new method to depict the mobility patterns of vehicles by mining the correlations between the kept track connections of vehicle trajectories versus crossed junctions. Secondly, we introduce a new way to compute the adequate RSU locations through the instantiation of the well‐known problem of extracting minimal transversals of a hypergraph. Experimental results show that our RSUs deployment strategy performs better than baseline strategies.