海报:车辆街区树可行性的时间分析

Proceedings of the 3rd Workshop on Experiences with the Design and Implementation of Smart Objects Pub Date : 2017-10-16 DOI:10.1145/3127502.3127516

Joshua Joy, Gregory Cusack, M. Gerla

{"title":"海报:车辆街区树可行性的时间分析","authors":"Joshua Joy, Gregory Cusack, M. Gerla","doi":"10.1145/3127502.3127516","DOIUrl":null,"url":null,"abstract":"In this paper we evaluate the feasibility of the vehicular blocktree proposed by Joy whereby vehicles write and aggregate their signatures to a blockchain. We analyze the end to end cycle time to collect, write, and persist the content to the blockchain as well as the total minting time. We show via time analysis that the cycle time occurs on the order of hundreds of milliseconds, showing that the proposed design is indeed feasible.","PeriodicalId":410660,"journal":{"name":"Proceedings of the 3rd Workshop on Experiences with the Design and Implementation of Smart Objects","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Poster: Time Analysis of the Feasibility of Vehicular Blocktrees\",\"authors\":\"Joshua Joy, Gregory Cusack, M. Gerla\",\"doi\":\"10.1145/3127502.3127516\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we evaluate the feasibility of the vehicular blocktree proposed by Joy whereby vehicles write and aggregate their signatures to a blockchain. We analyze the end to end cycle time to collect, write, and persist the content to the blockchain as well as the total minting time. We show via time analysis that the cycle time occurs on the order of hundreds of milliseconds, showing that the proposed design is indeed feasible.\",\"PeriodicalId\":410660,\"journal\":{\"name\":\"Proceedings of the 3rd Workshop on Experiences with the Design and Implementation of Smart Objects\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd Workshop on Experiences with the Design and Implementation of Smart Objects\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3127502.3127516\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd Workshop on Experiences with the Design and Implementation of Smart Objects","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3127502.3127516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

在本文中，我们评估了Joy提出的车辆区块树的可行性，车辆将其签名写入并聚合到区块链中。我们分析了收集、写入和保存内容到区块链的端到端周期时间以及总铸造时间。我们通过时间分析表明，周期时间发生在数百毫秒的数量级，表明所提出的设计确实是可行的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Poster: Time Analysis of the Feasibility of Vehicular Blocktrees

In this paper we evaluate the feasibility of the vehicular blocktree proposed by Joy whereby vehicles write and aggregate their signatures to a blockchain. We analyze the end to end cycle time to collect, write, and persist the content to the blockchain as well as the total minting time. We show via time analysis that the cycle time occurs on the order of hundreds of milliseconds, showing that the proposed design is indeed feasible.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 3rd Workshop on Experiences with the Design and Implementation of Smart Objects

自引率

0.00%

发文量