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

IEEE Conference on Vehicular technology (VTC)

作者： Zhekang Zhou Jie Cao Xu Zhu School of Electronic and Information Engineering Harbin Institute of Technology Shenzhen China Guangdong Provincial Key Lab-oratory of Aerospace Communication and Networking Technology Harbin Institute of Technology (Shenzhen) Shenzhen China

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

In this paper, we investigate timely and resource-efficient transmission for mixed traffic in industrial Internet-of-Things (IIoT) with short packet communication (SPC). Due to the limited resources in IIoT, fixed resource allocation for multiple users with different arrival rates leads to low resource utilization and high age of information (AoI). We formulate an optimization problem to minimize the required bandwidth for mixed traffic with timely constraints. To avoid resource waste and data collisions, we use traffic prediction to categorize users into high and low traffic states. For users in high traffic state, dedicated bandwidth is reserved for each user while a synchronous multi-channel slotted ALOHA access method is adopted for users in low traffic state. To meet the required timeliness requirements, the closed-form expressions of the peak AoI (PAoI) for users with SPC in different traffic states are derived. Then we explore an Traffic Classification-based Bandwidth Allocation (TCBA) algorithm to minimize the required bandwidth with the timely constraints of mixed traffic. Numerical results are provided to verify our analysis and demonstrate that the proposed TCBA algorithm outperforms the existing methods significantly in terms of bandwidth saving.

关键词： Vehicular and wireless technologies Simulation Bandwidth Channel allocation Approximation algorithms Classification algorithms Resource management

来源：评论

学校读者我要写书评

暂无评论

Survey on Blockchain Incentive Mechanism

Survey on Blockchain Incentive Mechanism

引用

2019国际计算机前沿大会

作者： Jiyue Huang Kai Lei Maoyu Du Hongting Zhao Huafang Liu Jin Liu Zhuyun Qi Shenzhen Key Lab for Information Centric Networking & Blockchain Technology(ICNLAB) School of Electronics and Computer EngineeringPeking University

The current research on the blockchain includes study on network architecture and the *** this paper,an introduction to the architecture of information technology was given and the goal and research status of the incentive layer of blockchain were illustrated with digital economy development as the *** existing issuance of token was elaborated from computation,storage and transmission,three core facets of network *** development of the token allocation and the path was analyzed to confirm its *** discusses the possible directions and challenges of the future research on blockchain incentive.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Construction of exact-BASIC codes for distributed storage systems at the MSR point

Construction of exact-BASIC codes for distributed storage sy...

引用

IEEE International Conference on Big Data

作者： Hanxu Hou Kenneth W. Shum Hui Li Department of Information Engineering Chinese University of Hong Kong Institute of Network Coding Chinese University of Hong Kong Shenzhen Eng. Lab of Converged Networks Technology Peking University Shenzhen Graduate School

Regenerating codes (RGC) are a class of distributed storage codes that can provide efficient repair of failure nodes in distributed storage systems. In general, the reduction of repair bandwidth of RGC is at the expense of a small increase in storage cost and computational cost. The high computational complexity of data coding over a finite field of large size makes it unsuitable for practical distributed storage systems. BASIC codes, which stands for Binary Addition and Shift Implementable Convolutional codes, is introduced in [1] with the aim of reducing computational complexity, while retaining the benefits of RGC. In this paper, we present a construction of exact-repair BASIC codes at the minimum-storage point (MSR). A helper node needs no coding to repair a failure node for the minimum-storage BASIC codes. The results of simulation show minimum-storage BASIC codes outperform Cauchy Reed-Solomon codes in both repairing cost and coding cost.

关键词： Encoding Maintenance engineering Bandwidth Decoding Educational institutions Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Time-Space-Power Resource Allocation: From the Perspective of User Experience Rate

Multi-Stage Time-Space-Power Resource Allocation: From the P...

引用

IEEE Conference on Vehicular technology (VTC)

作者： Kehua Zhang Zhongxiang Wei Xu Zhu Wenjun Hou Zhihao Dong Yufei Jiang School of Electronic and Information Engineering Harbin Institute of Technology Shenzhen China School of Electronic and Information Engineering Tongji University Shanghai China Guangdong Provincial Key Lab-oratory of Aerospace Communication and Networking Technology Harbin Institute of Technology (Shenzhen) Shenzhen China

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

In last decades, joint design of user scheduling and precoding has been investigated for single transmission time interval (TTI). However, this family of single-stage design cannot optimize real-time metrics that are measured in temporal dimension. In this paper, we target on optimizing the experience rate, which is defined as the ratio of a user's data packet size to the total time for completely delivering the user's data. A novel multi-stage dynamic resource programming is formulated as a multi-stage mixed integer nonlinear programming (MINLP) problem. Then, a low-complexity iterative algorithm is proposed for a jointly optimizing user scheduling and precoding. In particular, a second cone programming problem is dedicatedly designed, for providing a high-quality initial point for the iterative algorithm. The simulation results demonstrate that the proposed design endorses enhanced experience rate performance, with fast convergence behavior.

关键词： Measurement Vehicular and wireless technologies Precoding Simulation Programming Iterative methods Resource management

来源：评论

学校读者我要写书评

暂无评论

New MDS array code correcting multiple disk failures

New MDS array code correcting multiple disk failures

引用

2014 IEEE Global Communications Conference

作者： Hanxu Hou Kenneth W. Shum Minghua Chen Hui Li Shenzhen Eng. Lab of Converged Networks Technology Peking University Shenzhen Graduate School Department of Information Engineering The Chinese University of Hong Kong Institute of Network Coding Shenzhen Key Lab. of Network Coding Key Tech. and Application China

ISBN: (纸本)9781479935130

We present a new family of maximal-distance separable (MDS) array codes which can tolerate five disk failures. The encoding is based on bit-wise exclusive OR (XOR) and bit-wise cyclic shifts, and hence is amenable to practical implementation. Efficient repair method for correcting up to two disk failures is also given. The proposed coding scheme provides a larger spectrum of parameters, with comparable encoding and repairing complexities in compare with existing MDS array codes, such as the row-diagonal parity (RDP) code and the EVENODD code.

关键词： Arrays Polynomials Encoding Complexity theory Maintenance engineering Memory Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A Secure Multiparty Quantum Homomorphic Encryption Scheme

引用

Computers, Materials & Continua 2022年第11期73卷 2835-2848页

作者： Jing-Wen Zhang Xiu-Bo Chen Gang Xu Heng-Ji Li Ya-Lan Wang Li-Hua Miao Yi-Xian Yang Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijing100876China School of Information Science and Technology North China University of TechnologyBeijing100144China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Sichuan610025China Quantum Technology Lab&Applied Mechanics Group University of MilanMilan20133Italy Department of Computer Science Faculty of Engineering and Physical SciencesUniversity of SurreyGuildfordSurreyGU27XHUnited Kingdom Huawei Technologies Co.Ltd Shenzhen518129China

The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private *** this paper,a novel secure multiparty quantum homomorphic encryption scheme is proposed,which can complete arbitrary quantum computation on the private data of multiple clients without decryption by an almost dishonest ***,each client obtains a secure encryption key through the measurement device independent quantum key distribution protocol and encrypts the private data by using the encryption operator and ***,with the help of the almost dishonest server,the non-maximally entangled states are preshared between the client and the server to correct errors in the homomorphic evaluation of T gates,so as to realize universal quantum circuit evaluation on encrypted ***,from the perspective of the application scenario of secure multi-party computation,this work is based on the probabilistic quantum homomorphic encryption scheme,allowing multiple parties to delegate the server to perform the secure homomorphic *** operation and the permission to access the data performed by the client and the server are clearly pointed ***,a concrete security analysis shows that the proposed multiparty quantum homomorphic encryption scheme can securely resist outside and inside attacks.

关键词： Quantum homomorphic encryption secure multiparty computation almost dishonest server security

来源：评论

学校读者我要写书评

暂无评论

On low repair complexity storage codes via group divisible designs

On low repair complexity storage codes via group divisible d...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Bing Zhu Kenneth W. Shum Hui Li Shuo-Yen Robert Li Shenzhen Eng. Lab of Converged Networks Technology Peking University Institute of Network Coding Chinese University of Hong Kong Department of Information Engineering Chinese University of Hong Kong

Fractional repetition (FR) codes are a family of storage codes that provide efficient node repair at the minimum bandwidth regenerating point. Specifically, the repair process is exact and uncoded, but table-based. Existing constructions of FR codes are primarily based on combinatorial designs such as Steiner systems, resolvable designs, etc. In this paper, we present a new explicit construction of FR codes, which adopts the theory of uniform group divisible designs, termed GDDFR codes. Our codes achieve the storage capacity of random access and are available for a wide range of parameters. In addition, our techniques allow for constructing FR codes with parameters that are not covered by Steiner systems, which answers an open question put forward in prior work.

关键词： Maintenance engineering Decision support systems Educational institutions Bandwidth Complexity theory Equations Network coding

来源：评论

学校读者我要写书评

暂无评论

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

引用

Digital Communications and Networks 2021年第4期7卷 470-478页

作者： Weidong Fang Wuxiong Zhang Wei Yang Zhannan Li Weiwei Gao Yinxuan Yang Science and Technology on Micro-system Laboratony Shanghai Institute of Micro-system and Informnation TechnologyChinese Academy of SciencesShanghai201899PR China University of Chinese Academy of Sciences Beijing100049PR China State Kg Laboramry of Networking and Switehing Technology Beijing University of Posts and TelecommunicationsBeijing 100876PR China Guangdong Southern Planning&Designing Institute of Telecom Consultation Co. Ltd.Shenzhen518038PR China Department of Information and Communication Engineering Harbin Engineering UniversityHarbin150001PR China Fuzhou Internet of Things Open Lab Co. LtdFuzhou350015PR China Shanghai Research and Development Center for Micro-Nano Electronics Shanghai 201210P.R.China

The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how to elect a secure cluster head and balance the network load becomes an enormous *** this paper,a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol(LEACH-TM)is *** LEACH-TM,by using the number of dynamic decision cluster head nodes,residual energy and density of neighbor nodes,the size of the cluster can be better constrained to improve energy efficiency,and avoid excessive energy consumption of a ***,the trust management scheme is introduced into LEACH-TM to defend against internal *** simulation results show that,compared with LEACH-SWDN protocol and LEACH protocol,LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption,and can effectively mitigate the influence of malicious nodes on cluster head selection,which can greatiy guarantee the security of the overall network.

关键词： Internet of things Wireless sensor network Secure routing protocol Trust management

来源：评论

学校读者我要写书评

暂无评论

Intelligent Eco networking (IEN) II: A Knowledge-Driven Future Internet Infrastructure for Value-Oriented Ecosystem

Intelligent Eco Networking (IEN) II: A Knowledge-Driven Futu...

引用

IEEE International Conference on Hot Information-Centric networking (HotICN)

作者： Kai Lei Shuokang Huang Jiyue Huang Huafang Liu Jin Liu PCL Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen China Shenzhen Key Lab for Information Centric Networking & Blockchain Technology (ICNLAB) School of Electronic and Computer Engineering (SECE) Peking University Shenzhen P.R. China

ISBN: (数字)9781728157818

ISBN: (纸本)9781728157825

Intelligent Eco networking (IEN) is intent on evolving the IP-based network architecture into a Knowledge-Driven Future Internet Infrastructure based on hierarchical heterogeneous networks composed of virtualized and configurable devices, taking the valuable contents as first-class entity, d riven by knowledge intelligence, integrating the decentralized consensus trust preservation, to establish a value-oriented social ecosystem. To counter with the complicated but inefficient mechanisms of IP, a tokenized fine-grained allocation mechanism i s proposed, taking comprehensive consideration of storage, computing and networking, bringing about a collaborative and mutually beneficial value-interconnection. Knowledge-Driven Scheme (KDS), as the guideline of IEN's establishment, illustrates the way to extract knowledge from the network, the value consensus of Blockchain, and the feedback control of Federated Learning, making economy-based distributed commerce feasible.

关键词： Knowledge engineering Quality of service Internet Protocols Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Impact of Network Load on Direct Acyclic Graph Based Blockchain for Internet of Things

Impact of Network Load on Direct Acyclic Graph Based Blockch...

引用

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC

作者： Bin Cao Shouming Huang Daquan Feng Lei Zhang Shengli Zhang Mugen Peng College of Communications and Information Engineering and Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing China College of Information Engineering Shenzhen University Shenzhen China School of Engineering University of Glasgow U.K. State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

In this paper, we investigate the impact of network load on the Direct Acyclic Graph (DAG) consensus process for the blockchain enabled Internet of Things. Specifically, Markov chain model has been adopted to illustrate the dynamics in the consensus process for DAG based blockchain networks. The key performance metrics including cumulative weight and transaction confirmation delay are analysed under the unsteady state caused by the fluctuation of transaction arrival rate. The analysis is based on one of the most typical DAGs, Tangle, and the results show that the performance will be affected when the transaction arrival rate fluctuates widely.

关键词： Blockchain Markov processes Load modeling Internet of Things Delays Analytical models Steady-state

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：