{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:32:34Z","timestamp":1762507954422,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T00:00:00Z","timestamp":1576454400000},"content-version":"vor","delay-in-days":15,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the Internet of Vehicles (IoV), with the increasing demand for intelligent technologies such as driverless driving, more and more in-vehicle applications have been put into autonomous driving. For the computationally intensive task, the vehicle self-organizing network uses other high-performance nodes in the vehicle driving environment to hand over tasks to these nodes for execution. In this way, the computational load of the cloud alleviated. However, due to the unreliability of the communication link and the dynamic changes of the vehicle environment, lengthy task completion time may lead to the increase of task failure rate. Although the flooding algorithm can improve the success rate of task completion, the offloading expend will be large. Aiming at this problem, we design the partial flooding algorithm, which is a comprehensive evaluation method based on system reliability in the vehicle computing environment without infrastructure. Using V2V link to select some nodes with better performance for partial flooding offloading to reduce the task complete time, improve system reliability and cut down the impact of vehicle mobility on offloading. The results show that the proposed offloading strategy can not only improve the utilization of computing resources, but also promote the offloading performance of the system.<\/jats:p>","DOI":"10.1186\/s13677-019-0147-6","type":"journal-article","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T16:02:37Z","timestamp":1576512157000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Reliability and capability based computation offloading strategy for vehicular ad hoc clouds"],"prefix":"10.1186","volume":"8","author":[{"given":"Bo","family":"Li","sequence":"first","affiliation":[]},{"given":"Ziyi","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Hou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8135-4198","authenticated-orcid":false,"given":"Min","family":"He","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Anisetti","sequence":"additional","affiliation":[]},{"given":"Gwanggil","family":"Jeon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,16]]},"reference":[{"issue":"1","key":"147_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/s13638-018-1315-y","volume":"2019","author":"B Ahmed","year":"2019","unstructured":"Ahmed B, Malik AW, Hafeez T, Ahmed N. Services and simulation frameworks for vehicular cloud computing: a contemporary survey. EURASIP J Wirel Commun Netw. 2019; 2019(1):4.","journal-title":"EURASIP J Wirel Commun Netw"},{"issue":"5","key":"147_CR2","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1080\/02564602.2017.1342572","volume":"5","author":"A Aliyu","year":"2018","unstructured":"Aliyu A, Abdullah AH, Kaiwartya O, Cao Y, Usman MJ, Kumar S, Lobiyal DK, Raw RS. Cloud computing in vanets: Architecture, taxonomy, and challenges. Iete Tech Rev. 2018; 5(5):523\u2013547.","journal-title":"Iete Tech Rev"},{"key":"147_CR3","doi-asserted-by":"publisher","first-page":"19239","DOI":"10.1109\/ACCESS.2017.2752420","volume":"5","author":"H-T Wu","year":"2017","unstructured":"Wu H-T, Horng G-J. Establishing an intelligent transportation system with a network security mechanism in an internet of vehicle environment. IEEE Access. 2017; 5:19239\u201319247.","journal-title":"IEEE Access"},{"key":"147_CR4","doi-asserted-by":"publisher","first-page":"100179","DOI":"10.1016\/j.vehcom.2019.100179","volume":"19","author":"Muhammad Arif","year":"2019","unstructured":"Arif M, Wang G, Bhuiyan MZA, Wang T, Chen J. A survey on security attacks in vanets: Communication, applications and challenges. Veh Commun. 2019:100179. https:\/\/doi.org\/10.1016\/j.vehcom.2019.100179.","journal-title":"Vehicular Communications"},{"issue":"6","key":"147_CR5","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1109\/TITS.2018.2865173","volume":"20","author":"F Abbas","year":"2018","unstructured":"Abbas F, Fan P, Khan Z. A novel low-latency v2v resource allocation scheme based on cellular v2x communications. IEEE Trans Intell Transp Syst. 2018; 20(6):2185\u20132197.","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"147_CR6","doi-asserted-by":"publisher","unstructured":"Huang C-M, Wu Z-Y, Lin S-Y. The mobile edge computing (mec)-based vanet data offloading using the staying-time-oriented k-hop away offloading agent. In: 2019 International Conference on Information Networking (ICOIN). IEEE: 2019. p. 357\u201362. https:\/\/doi.org\/10.1109\/icoin.2019.8718188.","DOI":"10.1109\/icoin.2019.8718188"},{"key":"147_CR7","doi-asserted-by":"publisher","unstructured":"Lin X, Li J, Yang W, Wu J, Zong Z, Wang X. Vehicle-to-cloudlet: Game-based computation demand response for mobile edge computing through vehicles. In: 2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring). IEEE: 2019. p. 1\u20136. https:\/\/doi.org\/10.1109\/vtcspring.2019.8746335.","DOI":"10.1109\/vtcspring.2019.8746335"},{"key":"147_CR8","doi-asserted-by":"publisher","unstructured":"Naresh M, Raje A, Varsha K. Link prediction algorithm for efficient routing in vanets. IEEE; 2019. pp. 1156\u20131161. https:\/\/doi.org\/10.1109\/iccmc.2019.8819723.","DOI":"10.1109\/iccmc.2019.8819723"},{"issue":"12","key":"147_CR9","doi-asserted-by":"publisher","first-page":"3818","DOI":"10.1109\/TITS.2018.2789482","volume":"19","author":"W Kim","year":"2018","unstructured":"Kim W, Kang CM, Son YS, Lee S-H, Chung CC. Vehicle path prediction using yaw acceleration for adaptive cruise control. IEEE Trans Intell Transp Syst. 2018; 19(12):3818\u20133829.","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"147_CR10","doi-asserted-by":"publisher","unstructured":"Ye M, Guan L, Quddus M. Mpbrp-mobility prediction based routing protocol in vanets. IEEE; 2019. pp. 1\u20137. https:\/\/doi.org\/10.1109\/commnet.2019.8742389.","DOI":"10.1109\/commnet.2019.8742389"},{"key":"147_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-51969-2_16","volume-title":"Lecture Notes in Computer Science","author":"Tao Lei","year":"2016","unstructured":"Lei T, Wang S, Li J, Yang F. A cooperative route choice approach via virtual vehicle in internet of vehicles. Springer; 2016. pp. 194\u2013205. https:\/\/doi.org\/10.1007\/978-3-319-51969-2_16."},{"key":"147_CR12","doi-asserted-by":"publisher","first-page":"975","DOI":"10.4028\/www.scientific.net\/AMR.268-270.975","volume":"268-270","author":"Xuan He","year":"2011","unstructured":"He X, Zhao H, Yu BJ, Zhu J. Design and implementation of minimum hop routing algorithm with reliability assurance for wsn. In: Advanced Materials Research, vol. 268. Trans Tech Publ: 2011. p. 975\u2013980. https:\/\/doi.org\/10.4028\/www.scientific.net\/amr.268-270.975.","journal-title":"Advanced Materials Research"},{"issue":"8","key":"147_CR13","first-page":"1775","volume":"35","author":"SP Fan","year":"2014","unstructured":"Fan SP, Bao-Ying MA, Gao CG, Yao NM, University MN. Minimum hop routing algorithm for clustering wireless sensor networks. J Chin Comput Syst. 2014; 35(8):1775\u20131779.","journal-title":"J Chin Comput Syst"},{"key":"147_CR14","doi-asserted-by":"publisher","unstructured":"Le HQ, Al-Shatri H, Klein A. Efficient resource allocation in mobile-edge computation offloading: Completion time minimization. IEEE; 2017. pp. 2513\u20132517. https:\/\/doi.org\/10.1109\/isit.2017.8006982.","DOI":"10.1109\/isit.2017.8006982"},{"key":"147_CR15","doi-asserted-by":"publisher","unstructured":"Toh C-K, Bunchua S. Performance evaluation of flooding-based and associativity-based ad hoc mobile multicast routing protocols. IEEE; 2000. pp. 1274\u20131279. https:\/\/doi.org\/10.1109\/wcnc.2000.904815.","DOI":"10.1109\/wcnc.2000.904815"},{"key":"147_CR16","volume-title":"Proceedings of the 7th annual international on mobile computing and networking","author":"J Li","year":"2001","unstructured":"Li J, Blake C, De Couto DSJ, et al. Capacity of ad hoc wireless networks. In: Proceedings of the 7th annual international on mobile computing and networking. New York: ACM: 2001. p. 61\u201369."},{"issue":"4","key":"147_CR17","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1109\/TVT.2013.2244625","volume":"62","author":"MH Eiza","year":"2013","unstructured":"Eiza MH, Ni Q. An evolving graph-based reliable routing scheme for vanets. IEEE Trans Veh Technol. 2013; 62(4):1493\u20131504.","journal-title":"IEEE Trans Veh Technol"},{"key":"147_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/9781119224006","volume-title":"Network reliability: measures and evaluation","author":"SK Chaturvedi","year":"2016","unstructured":"Chaturvedi SK. Network reliability: measures and evaluation. New York: John Wiley & Sons; 2016."},{"issue":"3","key":"147_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s13198-019-00795-9","volume":"10","author":"G Khanna","year":"2019","unstructured":"Khanna G, Chaturvedi S, Soh S. Reliability evaluation of mobile ad hoc networks by considering link expiration time and border time. Int J Syst Assur Eng Manag. 2019; 10(3):399\u2013415.","journal-title":"Int J Syst Assur Eng Manag"},{"issue":"5","key":"147_CR20","doi-asserted-by":"publisher","first-page":"2769","DOI":"10.1007\/s11276-019-01992-x","volume":"25","author":"B \u00d6zceylan","year":"2019","unstructured":"\u00dcnl\u00fc B, \u00d6zceylan B, Baykal B. Ipbm: an energy efficient reliable interference-aware periodic broadcast messaging protocol for manets. Wirel Netw. 2019; 25(5):2769\u20132787.","journal-title":"Wirel Netw"},{"issue":"2","key":"147_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.comnet.2004.07.004","volume":"47","author":"M Ylianttila","year":"2005","unstructured":"Ylianttila M, M\u00e4kel\u00e4 J, Pahlavan K. Analysis of handoff in a location-aware vertical multi-access network. Comput Netw. 2005; 47(2):185\u2013201.","journal-title":"Comput Netw"},{"issue":"1","key":"147_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/nem.386","volume":"11","author":"W Su","year":"2001","unstructured":"Su W, Lee S-J, Gerla M. Mobility prediction and routing in ad hoc wireless networks. Int J Netw Manag. 2001; 11(1):3\u201330.","journal-title":"Int J Netw Manag"},{"issue":"4","key":"147_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1740437.1740439","volume":"13","author":"Y Zhang","year":"2010","unstructured":"Zhang Y, Zhao J, Cao G. Roadcast: a popularity aware content sharing scheme in vanets. ACM SIGMOBILE Mob Comput Commun Rev. 2010; 13(4):1\u201314.","journal-title":"ACM SIGMOBILE Mob Comput Commun Rev"},{"key":"147_CR24","doi-asserted-by":"publisher","unstructured":"Peng S, Chai R, Chen Q, Qin Y. Minimum end-to-end transmission delay based routing algorithm for vanets. IEEE; 2017. pp. 176\u2013181. https:\/\/doi.org\/10.1109\/icait.2017.8388910.","DOI":"10.1109\/icait.2017.8388910"},{"key":"147_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.jpdc.2017.06.022","volume":"117","author":"S Hussain","year":"2018","unstructured":"Hussain S, Keung J, Khan AA, Ahmad A, Cuomo S, Piccialli F, Jeon G, Akhunzada A. Implications of deep learning for the automation of design patterns organization. J Parallel Distrib Comput. 2018; 117:256\u2013266.","journal-title":"J Parallel Distrib Comput"},{"key":"147_CR26","doi-asserted-by":"publisher","unstructured":"Chianese A, Marulli F, Piccialli F. Cultural heritage and social pulse: A semantic approach for ch sensitivity discovery in social media data. IEEE; 2016. pp. 459\u2013464. https:\/\/doi.org\/10.1109\/icsc.2016.50.","DOI":"10.1109\/icsc.2016.50"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-019-0147-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13677-019-0147-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-019-0147-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T00:04:30Z","timestamp":1607990670000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-019-0147-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1186\/s13677-019-0147-6","relation":{},"ISSN":["2192-113X"],"issn-type":[{"type":"electronic","value":"2192-113X"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"25 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"21"}}