Abstract
In order to transfer an alert message from the accident site to the control center as soon as possible, the Roadside Units (RSUs) act as the most important roles in vehicular ad hoc networks (VANETs). However, we always hope to deploy minimum number of RSUs because of the low market penetration of VANET-enabled vehicles and the deployment cost of RSUs. In this paper, the optimal RSUs deployment problem is formulated as a set cover problem. We propose a heuristic greedy algorithm such that the number of RSUs is minimum. Meantime, alert messages would be propagated to RSUs within a time constraint, whenever an accident happens in anywhere of a road. Simulation results show that the scheme is efficient and the time complexity is better than those existing algorithms.
This work was financially supported by National Natural Science Foundation of China with Grants No.11371004 and No.61100191, and Shenzhen Strategic Emerging Industries Program with Grants No. ZDSY20120613125016389, No. JCYJ20120613151201451 and No. JCYJ20130329153215152.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aslam, B., Zou, C.C.: Optimal roadside units placement along highways. In: 2011 Consumer Communications and Networking Conference (CCNC), pp. 814–815 (2011)
Aslam, B., Amjad, F., Zou, C.C.: Optimal roadside units placement in urban areas for vehicular networks. In: 2012 IEEE Symposium on Computers and Communications (ISCC 2012), pp. 423–439 (2011)
Barrachina, J., Garrido, P., Fogue, M., et al.: D-RSU: a density-based approach for road side unit deployment in urban scenarios. In: International Workshop on IPv6-based Vehicular Networks (Vehi6), Collocated with the 2012 IEEE Intelligent Vehicles Symposium, pp. 1–6 (2012)
Barrachina, J., Garrido, P., Fogue, M., et al.: Road side unit deployment: a density-based approach. IEEE Intell. Transp. Syst. Mag. 5(3), 30–39 (2013)
Lin, P.-C.: Optimal roadside unit deployment in vehicle-to-infrastructure communications. In: 12th International Conference on ITS Telecommunications (ITST), pp. 796–800 (2012)
Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1–4), 353–371 (2000)
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960–981 (1994)
Cormode, G., Karloff, H., Wirth, A.: Set cover algorithms for very large datasets. In: Proceedings of the 19th ACM international conference on Information and knowledge management. pp. 479–488 (2010)
Fortune, S.J., Gay, D.M., Kernighan, B.W., Landron, O., Valenzuela, R.A., Wright, M.H.: Wise design of indoor wireless systems: practical computation and optimization. Comput Sci. Eng. 2(1), 58–68 (1995)
Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. Eur. J. Oper. Res. 101(1), 81–92 (1997)
Wright, M.H.: Optimization methods for base station placement in wireless applications. In: 48th IEEE Vehicular Technology Conference, pp. 387–391 (1998)
Beasley, J.E.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85–93 (1987)
Liu, J., Huang, H., Du, H.: Greedy algorithm for least privilege in RBAC model. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 537–545. Springer, Heidelberg (2011)
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, Plenum Press (1972)
Lee, J., Kim, C.M.: A roadside unit placement scheme for vehicular telematics networks. In: Kim, T., Adeli, H. (eds.) AST/UCMA/ISA/ACN 2010. LNCS, vol. 6059, pp. 196–202. Springer, Heidelberg (2010)
Lochert, C., Scheuermann, B., Wewetzer, C., Luebke, A., Mauve, M.: Data aggregation and roadside unit placement for a vanet traffic information system. In: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking, pp. 58–65 (2008)
Wan, P.-J., Du, D.-Z., Pardalos, P., Wu, W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45(2), 463–474 (2010)
Li, P., Huang, X., Fang, Y., Lin, P.: Optimal placement of gateways in vehicular networks. IEEE Trans. Veh. Technol. 56(6), 3421–3430 (2007)
Peng, Y., Abichar, Z., Chang, J.M.: Roadside-aided routing (RAR) in vehicular networks. In: IEEE International Conference on Communications, pp. 3602–3607 (2006)
Sun, Y., Lin, X., Lu, R., et al.: Roadside units deployment for efficient short-time certificate updating in VANETs. In: 2010 IEEE International Conference on Communications (ICC), pp. 1–5 (2010)
Trullols, O., Fiore, M., Casetti, C., et al.: Planning roadside infrastructure for information dissemination in intelligent transportation systems. Comput. Commun. 33(4), 432–442 (2010)
Trullols, O., Barcelo-Ordinas, J.M., Fiore, M., et al.: A max coverage formulation for information dissemination in vehicular networks. In: IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WIMOB 2009), pp. 154–160 (2009)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634–652 (1998)
Xiong, Y., Ma, J., Wang, W., Tu, D.: Roadgate: mobility-centric roadside units deployment for vehicular networks. Int. J. Distrib. Sens. Netw. 2013, 1–10 (2013)
Zheng Z, Sinha P, K.S.: Alpha coverage: Bounding the interconnection gap for vehicular internet access. In: INFOCOM 2009. pp. 2831–2835 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, C., Huang, H., Du, H., Jia, X. (2014). Optimal RSUs Deployment in Vehicular Networks. In: Chen, Y., et al. Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science(), vol 8597. Springer, Cham. https://doi.org/10.1007/978-3-319-11538-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-11538-2_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11537-5
Online ISBN: 978-3-319-11538-2
eBook Packages: Computer ScienceComputer Science (R0)