Adaptive Rateless Coded Blockchain for Dynamic IoV Scenarios | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Adaptive Rateless Coded Blockchain for Dynamic IoV Scenarios Shuo Zhang, Yuan-Yuan Song, Ming-Gang Zheng, Jie Li, Han Liang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6870574/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 26 Dec, 2025 Read the published version in Scientific Reports → Version 1 posted 10 You are reading this latest preprint version Abstract The rapid development of Internet of Vehicles (IoV) presents critical challenges in secure storage and sharing of massive vehicular data. Traditional blockchain's full-node storage paradigm incurs prohibitive overhead in resource-constrained vehicular environments, while existing coded blockchain schemes struggle with IoV's dynamic network topology and fluctuating node population. This paper proposes an adaptive rateless coded blockchain architecture tailored for dynamic IoV environments, employing systematic Raptor codes for block compression, VRF-based lightweight consensus, and dynamic parameter adjustment that adapts redundancy in real-time without re-encoding existing blocks. The scheme achieves an average compression ratio of 97.88% while ensuring decoding failure probability below 10^-12, significantly reducing storage overhead and demonstrating robustness in dynamic vehicular networks. Physical sciences/Engineering Physical sciences/Mathematics and computing Physical sciences/Mathematics and computing/Computational science Physical sciences/Mathematics and computing/Computer science Physical sciences/Mathematics and computing/Software Internet of Vehicles (IoV) coded blockchain Raptor codes storage compression dynamic 20 network lightweight consensus Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 26 Dec, 2025 Read the published version in Scientific Reports → Version 1 posted Editorial decision: Revision requested 30 Jul, 2025 Reviews received at journal 29 Jul, 2025 Reviews received at journal 05 Jul, 2025 Reviewers agreed at journal 27 Jun, 2025 Reviewers agreed at journal 25 Jun, 2025 Reviewers invited by journal 25 Jun, 2025 Editor assigned by journal 25 Jun, 2025 Editor invited by journal 16 Jun, 2025 Submission checks completed at journal 16 Jun, 2025 First submitted to journal 11 Jun, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6870574","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":476554306,"identity":"455b6048-1af5-40c3-9ce1-2871a558eb58","order_by":0,"name":"Shuo Zhang","email":"","orcid":"","institution":"Shandong Jianzhu University","correspondingAuthor":false,"prefix":"","firstName":"Shuo","middleName":"","lastName":"Zhang","suffix":""},{"id":476554307,"identity":"fd2f68f2-258a-41b1-9105-df249265861d","order_by":1,"name":"Yuan-Yuan Song","email":"","orcid":"","institution":"Shangdong Zhengchen Technology Company Ltd","correspondingAuthor":false,"prefix":"","firstName":"Yuan-Yuan","middleName":"","lastName":"Song","suffix":""},{"id":476554308,"identity":"e8e20fc4-2c81-4cb2-807d-dc74005287b6","order_by":2,"name":"Ming-Gang Zheng","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA7UlEQVRIiWNgGAWjYDACCQaGgx8MbOQYGBISQHzGBiK0MB6WKEgzJkkL8wGeD4cTGxjAOojQYnC7x+CAhEFa+vz2hMefeRhsZDccYH72AK+WO2cMDhQY2ORuOPMgwZiHIc14wwE2cwN8Wsxu5IBtyd0gkZCQzMNwOHHDAR42CYJaeAwOp8vPSEg4zMPwn3gtCQw3EhKbeRgOENZifyOt4DDQYYZAvyQzzjFINp55mM0MrxbJGcmbP374YyMv356T/OFNhZ1s3/HmZ3i1MDBwwIKHJwEYgECaGb96IGB/AGMcIKh2FIyCUTAKRiYAAP81URy4Ob9xAAAAAElFTkSuQmCC","orcid":"","institution":"Shandong Jianzhu University","correspondingAuthor":true,"prefix":"","firstName":"Ming-Gang","middleName":"","lastName":"Zheng","suffix":""},{"id":476554309,"identity":"f5cd8c63-9c13-4552-83d5-e1345620befa","order_by":3,"name":"Jie Li","email":"","orcid":"","institution":"Shandong Jianzhu University","correspondingAuthor":false,"prefix":"","firstName":"Jie","middleName":"","lastName":"Li","suffix":""},{"id":476554310,"identity":"479c0f35-dced-47fe-af83-80de38078638","order_by":4,"name":"Han Liang","email":"","orcid":"","institution":"Shandong Jianzhu University","correspondingAuthor":false,"prefix":"","firstName":"Han","middleName":"","lastName":"Liang","suffix":""}],"badges":[],"createdAt":"2025-06-11 10:08:25","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6870574/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6870574/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1038/s41598-025-31894-2","type":"published","date":"2025-12-26T15:57:28+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":99172869,"identity":"5c43ffcb-37e7-4654-a68a-62703f592b26","added_by":"auto","created_at":"2025-12-29 16:11:43","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":466438,"visible":true,"origin":"","legend":"","description":"","filename":"AdaptiveRatelessCodedBlockchainforDynamicIoVScenarios.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6870574/v1_covered_7f81a200-ecac-43ca-92bd-a0ceecf95b0a.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Adaptive Rateless Coded Blockchain for Dynamic IoV Scenarios","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Internet of Vehicles (IoV), coded blockchain, Raptor codes, storage compression, dynamic 20 network, lightweight consensus","lastPublishedDoi":"10.21203/rs.3.rs-6870574/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6870574/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The rapid development of Internet of Vehicles (IoV) presents critical challenges in secure storage and sharing of massive vehicular data. Traditional blockchain's full-node storage paradigm incurs prohibitive overhead in resource-constrained vehicular environments, while existing coded blockchain schemes struggle with IoV's dynamic network topology and fluctuating node population. This paper proposes an adaptive rateless coded blockchain architecture tailored for dynamic IoV environments, employing systematic Raptor codes for block compression, VRF-based lightweight consensus, and dynamic parameter adjustment that adapts redundancy in real-time without re-encoding existing blocks. The scheme achieves an average compression ratio of 97.88% while ensuring decoding failure probability below 10^-12, significantly reducing storage overhead and demonstrating robustness in dynamic vehicular networks. ","manuscriptTitle":"Adaptive Rateless Coded Blockchain for Dynamic IoV Scenarios","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-27 05:44:07","doi":"10.21203/rs.3.rs-6870574/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-07-30T19:16:48+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-07-29T11:28:52+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-07-05T11:27:46+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"73101408892644454808754634527709889748","date":"2025-06-27T05:43:33+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"165483514381095112196869642086628338016","date":"2025-06-25T06:25:16+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-06-25T04:39:27+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-06-25T04:36:42+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2025-06-16T05:54:55+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-06-16T05:03:57+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2025-06-11T09:59:23+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"beb8978a-5505-4a73-89ee-5ab28217791f","owner":[],"postedDate":"June 27th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":50604686,"name":"Physical sciences/Engineering"},{"id":50604687,"name":"Physical sciences/Mathematics and computing"},{"id":50604688,"name":"Physical sciences/Mathematics and computing/Computational science"},{"id":50604689,"name":"Physical sciences/Mathematics and computing/Computer science"},{"id":50604690,"name":"Physical sciences/Mathematics and computing/Software"}],"tags":[],"updatedAt":"2025-12-29T16:09:12+00:00","versionOfRecord":{"articleIdentity":"rs-6870574","link":"https://doi.org/10.1038/s41598-025-31894-2","journal":{"identity":"scientific-reports","isVorOnly":false,"title":"Scientific Reports"},"publishedOn":"2025-12-26 15:57:28","publishedOnDateReadable":"December 26th, 2025"},"versionCreatedAt":"2025-06-27 05:44:07","video":"","vorDoi":"10.1038/s41598-025-31894-2","vorDoiUrl":"https://doi.org/10.1038/s41598-025-31894-2","workflowStages":[]},"version":"v1","identity":"rs-6870574","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6870574","identity":"rs-6870574","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.