Abstract
As data dissemination is of great importance for applications in connected vehicular networks (VANETs), we aim to facilitate the performance of data dissemination in this study. Consider strongly connected VANETs where a set of vehicular nodes exists to disseminate information. To reduce redundant transmissions and improve data dissemination delay, the number of data replicas that can be spread in the network is controlled. A replication-based distributed randomized algorithm is proposed, in which a balanced network status can be achieved after average operations among the nodes. In the algorithm, the data carrier distributes the dissemination tasks to multiple nodes to speed up the dissemination process such that the dissemination would be accelerated and consume less network resource. We evaluate the complexity of network convergence by analyzing the number of communication stages consumed when the network converges to a consensus. Theoretical analysis shows that the network can achieve balance quickly in the case of complete graph, which supports the real-time data dissemination in dense VANETs. Simulation results validate that the proposed algorithm can disseminate data to the vehicles within a specific area with high efficiency.
Similar content being viewed by others
References
Mukherjee, J. C., Gupta, A., & Sreenivas, R. C. (2016). Event notification in VANET with capacitated roadside units. IEEE Transactions on Intelligent Transportation Systems, 17(7), 1867–1879.
He, J., Cai, L., Cheng, P., & Pan, J. (2016). Delay minimization for data dissemination in large-scale VANETs with buses and taxis. IEEE Transactions on Mobile Computing, 15(8), 1–13.
Memon, I., & Arain, Q. A. (2017). Dynamic path privacy protection framework for continuous query service over road networks. World Wide Web-internet and Web Information Systems, 20(4), 639–672.
Ghebleh, R. (2018). A comparative classification of information dissemination approaches in vehicular Ad hoc networks from distinctive viewpoints: A survey. Computer Networks, 131, 15–37.
Yan, T., Zhang, W., & Wang, G. (2014). DOVE: Data dissemination to a desired number of receivers in VANET. IEEE Transactions on Vehicular Technology, 63(4), 1903–1916.
Li, Y., Jin, D., Hui, P., & Chen, S. (2016). Contact-aware data replication in roadside unit aided vehicular delay tolerant networks. IEEE Transactions on Mobile Computing, 15(2), 306–321.
Zhu, J., Huang, C., Fan, X., Guo, S., & Bin, F. (2018). EDDA: An efficient distributed data replication algorithm in VANETs. Sensors, 18, 2–547.
Khosravi, A., & Kavian, Y. S. (2017). Broadcast gossip ratio consensus: Asynchronous distributed averaging in strongly connected networks. IEEE Transactions on Signal Processing, 65(1), 119–129.
Wang, G., Wang, Z., & Wu, J. (2017). A local average broadcast gossip algorithm for fast global consensus over graphs. Journal of Parallel and Distributed Computing, 109, 301–309.
Zhu, J., Huang, C., Fan, X., Guo, S., & Fu, B. (2017). An efficient distributed randomized data replication algorithm in VANETs. In: Wireless algorithms, systems, and applications, Guilin, China, (pp. 369–380). Springer, London.
Torres, A., Ji, Y., Calafate, C. T., Cano, J.-C., & Manzoni, P. (2015). Evaluation of flooding schemes for real-time video transmission in VANETs. Ad Hoc Networks, 24, 3–20.
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 16(1), 77–90.
Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2010). Replication routing in DTNs: A resource allocation approach. IEEE/ACM Transactions on Networking, 18(2), 596–609.
Takahashi, A., Nishiyama, H., Kato, N., Nakahira, K., & Sugiyama, T. (2014). Replication control for ensuring reliability of convergecast message delivery in infrastructure-aided DTNs. IEEE Transactions on Vehicular Technology, 63(7), 3223–3231.
Xing, M., He, J., & Cai, L. (2017). Utility maximization for multimedia data dissemination in large-scale VANETs. IEEE Transactions on Mobile Computing, 14(7), 1188–1198.
Yuchen, W., Zhu, Y., Zhu, H., & Li, B. (2013). CCR: Capacity-constrained replication for data delivery in vehicular networks. IEEE INFOCOM, 12(11), 2580–2588.
Xiang, Q., Chen, X., Kong, L., Rao, L., & Liu, X. (2015). Data preference matters: A new perspective of safety data dissemination in vehicular ad hoc networks. In: IEEE conference on computer communications (INFOCOM) (pp. 1149–1157).
Memon, I., Arain, Q. A., Memon, M. H., et al. (2017). Search me if you can: Multiple mix zones with location privacy protection for mapping services. International Journal of Communication Systems, 30(16), e3312.
Arain, Q. A., Uqaili, M. A., Deng, Z., Memon, I., et al. (2017). Clustering based energy efficient and communication protocol for multiple mix-zones over road networks. Wireless Personal Communications, 95(2), 411–428.
Zhao, Z., Dong, W., Bu, J., Gu, T., & Min, G. (2017). Accurate and generic sender selection for bulk data dissemination in low-power wireless networks. IEEE/ACM Transactions on Networking, 25(2), 948–959.
Bharati, S., & Zhuang, W. (2016). CRB: Cooperative relay broadcasting for safety applications in vehicular networks. IEEE Transactions on Vehicular Technology, 65(12), 9542–9553.
Chen, F., Zhang, D., Zhang, J., et al. (2018). Distribution-aware cache replication for cooperative road side units in VANETs. Peer-to-Peer Networking and Applications, 11(5), 1075–1084.
Jiang, Z., Zhou, S., Guo, X., & Niu, Z. (2018). Task replication for deadline-constrained vehicular cloud computing: Optimal policy. IEEE Internet of Things Journal of Performance, Analysis, and Implications on Road Traffic, 5(1), 93–107.
Chen, P., Cheng, S., & Sung, M. (2018). Analysis of data dissemination and control in social internet of vehicles. IEEE Internet of Things Journal, 5(4), 2467–2477.
Shi, G., Li, B., Johansson, M., & Johansson, K. H. (2016). Finite-time convergent gossiping. IEEE/ACM Transactions on Networking, 24(5), 2782–2794.
Loizou, N., & Richtarik, P. (2016). A new perspective on randomized gossip algorithms. In: IEEE global conference on signal and information processing (pp. 440–444).
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006). Randomized gossip algorithms. IEEE Transactions on Information Theory, 52(6), 2508–2530.
Nedic, A., & Ozdaglar, A. (2010). Convergence rate for consensus with delays. Journal of Global Optimization, 47(3), 437–456.
Nedic, A., & Liu, J. (2017). On convergence rate of weighted-averaging dynamics for consensus problems. IEEE Transactions on Automatic Control, 62(2), 766–781.
Franceschelli, M., Giua, A., & Seatzu, C. (2017). Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks. Nonlinear Analysis-Hybrid Systems, 26, 292–306.
Aysal, T. C., Yildiz, M. E., Sarwate, A. D., & Scaglione, A. (2009). Broadcast gossip algorithms for consensus. IEEE Transactions on Signal Processing, 57(7), 2748–2761.
Shaochuan, W., & Rabbat, M. G. (2013). Broadcast gossip algorithms for consensus on strongly connected digraphs. IEEE Transactions on Signal Processing, 61(16), 3959–3971.
Motwani, R., & Raghavan, P. (2000). Randomized algorithms. Cambridge: Cambridge University Press.
Ming, L., Ma, B., & Wang, L. (2002). On the closest string and substring problems. Journal of the ACM, 49(2), 157–171.
Haklay, M., & Weber, P. (2008). Openstreetmap: User-generated street maps. IEEE Pervasive Computing, 7(4), 12–18.
SUMO: Simulation of Urban Mobility. Available: http://sumo.sourceforge.net
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Science Foundation of China (Nos. 61772385, 61373040, 61572370). Autonomous electric vehicle driving ability and safety evaluation technology and system development (SQ2018YFB010236-04).
Rights and permissions
About this article
Cite this article
Fan, X., Huang, C., Zhu, J. et al. R-DRA: a replication-based distributed randomized algorithm for data dissemination in connected vehicular networks. Wireless Netw 25, 3767–3782 (2019). https://doi.org/10.1007/s11276-018-01895-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-018-01895-3