检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:胡倩 陈杨杨 HU Qian;CHEN Yang-yang(School of Cyber Science and Engineering,Southeast University,Nanjing Jiangsu 210096,China;School of Automation,Southeast University,Nanjing Jiangsu 210096,China)
机构地区:[1]东南大学网络空间安全学院,江苏南京210096 [2]东南大学自动化学院,江苏南京210096
出 处:《控制理论与应用》2024年第8期1335-1340,共6页Control Theory & Applications
基 金:国家自然科学基金项目(62373097)资助。
摘 要:物联网应用(IOTA)作为一种经典的基于有向无环图而非链式结构的区块链系统,由于采用置信度共识方式导致交易确认依赖中心节点,并且难以及时发现交易冲突.为此,本文提出一种基于时间切片的设计方法,通过规定在每个时间片结束时由内部节点检查并同步当前交易子图,设计了一种high quality IOTA(HQIOTA)共识机制.在交易确认中,通过设计内部节点自适应调节控制替代了原有的外部规定阈值的转变.进而能及时发现并删除矛盾交易,解决了交易冲突不敏感的问题.本文基于概率分布模拟的网络环境进行实验,结果表明HQIOTA能比IOTA更快发现交易冲突并且更灵活地进行交易确认.Internet of things application(IOTA)is a classic blockchain system based on the directed acyclic graph rather than chain structure.Due to the adoption of confidence consensus,transaction confirmation depends on the central node and it is difficult tofind conflicting transactions in time.Therefore,this paper proposes a design method based on time slice.It is specified that the current transaction subgraph is checked and synchronized by the internal node at the end of each time slice.A high quality IOTA(HQIOTA)consensus mechanism is designed.In the transaction confirmation,the adaptive control of internal nodes is designed to replace the transformation of the original external specified threshold.Then the contradictory transactions can be found and deleted in time,and the problem of being insensitive to conflicting transactions can be solved.In this paper,experiments are carried out in the network environment based on the probability distribution simulation.The results show that the HQIOTA canfind transaction conflicts faster and confirm transactions moreflexibly than IOTA.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200