In this paper we consider a partial case when the roadside units are connected in a wireless network with linear topology. Each road side units (RSUs) is equipped with IEEE 802.11 access point that is used by the mobile users to send their data via the network, and with a relay equipment that allows the RSU to connect to the neighbouring RSUs. Each station type is defined by the coverage radius of the access point, connection distance of the relay links and the station price. We also assume that the road has several possible discrete locations where the stations can be deployed. The problem is to find out which stations should be deployed to maximize the overall coverage while providing the given solution cost. First, we formulate the problem in combinatorial form and use this formulation to prove NP-hardness of the problem. Then we define an integer linear program that can be used to find the optimal solution using a well-known software.