Optimal roadside units placement in urban areas for vehicular networks

• Published in: 2012 IEEE Symposium on Computers and Communications (ISCC) pp. 000423 - 000429
• Main Authors: Aslam, B., Amjad, F., Zou, C. C.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.07.2012
• Subjects: initial deployment stage; Linear programming; optimization; Optimization methods; placement; Roads; roadside unit; Topology; Urban areas; VANET; Vehicles
• ISBN: 9781467327121; 1467327123
• ISSN: 1530-1346; 2642-7389
• DOI: 10.1109/ISCC.2012.6249333

The most important component of a vehicular ad hoc network (VANET), besides VANET-enabled vehicles, is roadside units (RSUs). The effectiveness of a VANET largely depends on the density and location of these RSUs. During the initial stages of VANET, it will not be possible to deploy a large number of RSUs either due to the low market penetration of VANET-enabled vehicles or due to the deployment cost of RSUs. There is, therefore, a need to optimally place a limited number of RSUs in a given region in order to achieve maximum performance. In this paper, we present two different optimization methods for placement of a limited number of RSUs in an urban region: an analytical Binary Integer Programming (BIP) method and a novel Balloon Expansion Heuristic (BEH) method. BIP method utilizes branch and bound approach to find an optimal analytical solution whereas BEH method uses balloon expansion analogy to find an optimal or near optimal solution. Our evaluations show that both methods perform optimally or near optimally compared with the exhaustive method. Further, BEH method is more versatile and performs better than BIP method in terms of computational cost and scalability.