检索结果-内蒙古大学图书馆

arXiv 2023年

作者： Liang, Jiaxin Chan, Tse-Tin Pan, Haoyuan Computer Network and Protocol Research Laboratory Huawei Technologies Shenzhen518060 China Department of Mathematics and Information Technology The Education University of Hong Kong Hong Kong College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

This paper investigates the information freshness of Industrial Internet of Things (IIoT) systems, where each IoT device makes a partial observation of a common target and transmits the information update to a central receiver to recover the complete observation. We consider the age of collection (AoC) performance as a measure of information freshness. Unlike the conventional age of information (AoI) metric, the instantaneous AoC decreases only when all cooperative packets for a common observation are successfully received. Hence, effectively allocating wireless time-frequency resources among IoT devices to achieve a low average AoC at the central receiver is paramount. Three multiple access schemes are considered in this paper: time-division multiple access (TDMA) without retransmission, TDMA with retransmission, and frequency-division multiple access (FDMA). First, our theoretical analysis indicates that TDMA with retransmission outperforms the other two schemes in terms of average AoC. Subsequently, we implement information update systems based on the three schemes on software-defined radios. Experimental results demonstrate that considering the medium access control (MAC) overhead in practice, FDMA achieves a lower average AoC than TDMA with or without retransmission in the high signal-to-noise ratio (SNR) regime. In contrast, TDMA with retransmission provides a stable and relatively low average AoC over a wide SNR range, which is favorable for IIoT applications. Overall, we present a theoretical-plus-experimental investigation of AoC in IIoT information update systems. Copyright © 2023, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

4-6 Solving a Discrete Logarithm Problem via function field sieve (FFS)

引用

Journal of the National Institute of Information and Communications Technology 2011年第3-4期58卷 209-217页

作者： Shinohara, Naoyuki Wang, Lihua Matsuo, Shin'ichiro Security Fundamentals Laboratory Network Security Research Institute Computer Algebra Japan Security Fundamentals Laboratory Network Security Research Institute Cryptographic Theory Information Security Japan Security Architecture Laboratory Network Security Research Institute Cryptographic Protocol Japan

Pairings is used to construct many cryptographic systems for which no other efficient implementation is known, such as identity based encryption. Especially, the ηT-paring on supersingular curves over a finite field GF(3n) is efficiently implementable. The security of cryptosystems using such ηT-parings is based on the difficulty to solve Discrete Logarithm Problem (DLP) in GF(3n). Therefore, in the collaborative research of National Institute of Information and Communications Technology (NICT) and Future University-Hakodate, we successfully set a new record for solving the DLP in GF(36.71) of 676-bit size. In this paper, we remark about the collaborative research.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：