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

Secrecy Outage Probability Analysis Based on Cognitive Decode-and-Forward Relaying

Computers, Materials & Continua 2020年第3期62卷 1387-1395页

作者： Ruoyu Su Xiaojun Sun Fei Ding Dengyin Zhang Hongbo Zhu M.I.M.Wahab Jiangsu Key Laboratory of Wireless Communications Nanjing University of Posts and Tele-CommunicationsNanjing210003China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Ministry of EducationNanjing University of Posts and TelecommunicationsNanjing210003China School of Information Science and Engineering Southeast UniversityNanjing210018China Department of Electrical and Computer Engineering Faculty of Engineering and Applied ScienceMemorial University of NewfoundlandSt.John’sA1B 3X5Canada Department of Mechanical and Industrial Engineering Ryerson UniversityToronto M5B 2K3Canada

wireless communications have to face to several different security issues in practice due to the nature of *** information theory is well known to provide efficient approaches to address security issues in wireless communications,which attracts much attention in both industry and academia in recent *** this paper,inspired by information theory,we study the outage probability of the opportunistic relay selection based on cognitive decode-and-forward relaying with the secrecy ***,the closed-form expression of the outage probability is ***,the asymptotic performance evaluation on the basis of the analytical results is *** simulation results show that the relay selection can reduce the outage probability in accordance with our theoretical analysis.

关键词： Secure communication average secrecy rate relay selection probability density function

来源：评论

学校读者我要写书评

暂无评论

Optimization on Cooperative communications Based on network Coding in Multi-hop wireless networks

Optimization on Cooperative Communications Based on Network ...

引用

International wireless communications and Mobile Computing Conference, IWCMC

作者： Xiande Bu Chuan Liu Qiang Yu Lei Yin Feng Tian State Grid Laboratory of Electric Power Communication Network Global Energy Interconnection Research Institute Nanjing China Key Lab of Broadband Wireless Communication and Sensor Network Technology (Nanjing Universityof Posts and Telecommunications) Ministry of Education Nanjing China

ISBN: (数字)9781728131290

ISBN: (纸本)9781728131306

Cooperative communications (CC) based on network coding (NC) can significantly increase the capacity of wireless networks. In this paper, we investigate how to apply NC in multi-hop wireless networks with multiple relay nodes and multiple sessions to achieve more practical and general CC based on NC. Based on NC, we consider to jointly optimize relay node selecting, scheduling and flow routing in CC in a multi-hop wireless network. We not only construct a mathematical model but also formulate a maximum-minimum (Max-Min) optimization problem for it. Then we reformulate and solve it with CPLEX. Through simulation, we validate that the achieved rate gain by NC can be greatly improved than the one by CC.

关键词： Relays Spread spectrum communication wireless networks Routing Optimization Mathematical model network coding

来源：评论

学校读者我要写书评

暂无评论

Fog node selection for low latency communication and anomaly detection in fog networks

Fog node selection for low latency communication and anomaly...

引用

2019 International Conference on communications, Information System, and Computer Engineering, CISCE 2019

作者： Li, Yuxiao Zhang, Yazhong Liu, Yuxiang Meng, Qingmin Tian, Feng Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education College of Telecommunications and Information Engineering Nanjing210003 China

ISBN: (纸本)9781728136813

The application of 5G in IOT (Internet of things) puts forward strict requirements for network latency. In view of the fog network scenario with large-scale IOT devices, this paper proposes a procedure of unsupervised learning to efficiently realize the requirement of low-latency communication. We propose an integrated K-means clustering and PCA fog computing design, which facilitates a new service of fog, anomaly detection. Computer simulation shows that, in the presence of large-scale path loss, shadow and small-scale fading channel, the system design with low latency needs to consider the deployment of dense fog nodes and adopt more frequency or power resources at the same time. The proposed procedure and machine learning design not only facilitates the selection of fog nodes, but also presents a new example of anomaly detection using fog nodes. © 2019 IEEE.

关键词： Fog

来源：评论

学校读者我要写书评

暂无评论

Privacy amplification scheme based on composite coding

arXiv

引用

arXiv 2021年

作者： Li, Wei Zhao, Shengmei Nanjing University of Posts and Telecommunications Institute of Signal Processing and Transmission Nanjing210003 China Nanjing University of Posts and Telecommunications Key Lab Broadband Wireless Communication and Sensor Network Ministy of Education Nanjing210003 China National Laboratory of Solid State Microstructures Nanjing University Nanjing210093 China

Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding. Copyright © 2021, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

The optimal positive operator-valued measure for state discrimination

arXiv

引用

arXiv 2021年

Evaluating the amount of information obtained from non-orthogonal quantum states is an important topic in the field of quantum information. The commonly used evaluation method is Holevo bound, which only provides a loose upper bound for quantum measurement. In this paper, we provide a theoretical study of the positive operator-valued measure (POVM) for discriminating nonorthogonal states. We construct a generalized POVM measurement operation, and derive the optimal one for state discrimination by Lagrange multiplier method. With simulation, we find that the optimal POVM measurement provides a tight upper bound for state discrimination, which is significantly lower than that predicted by Holevo bound. The derivation of optimal POVM measurement will play an important role in the security research of quantum key distribution. Copyright © 2021, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Measurement-device-independent quantum secure direct communication

引用

Science China(Physics,Mechanics & Astronomy) 2020年第3期63卷 2-7页

作者： ZengRong Zhou Yu Bo Sheng PengHao Niu LiuGuo Yin GuiLu Long Lajos Hanzo State Key Laboratory of Low-dimensional Quantum Physics Beijing 100084China Department of Physics Tsinghua UniversityBeijing 100084China Collaborative Innovation Center of Quantum Matter Beijing 100084China Beijing Academy of Quantum Information Beijing 100084China Institute of Quantum Information and Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China College of Telecommunications&Information Engineering Nanjing University of Posts and TelecommunicationsNanjing 210003China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of EducationNanjing University of Posts and TelecommunicationsNanjing 210003China Beijing National Research Center for Information Science and Technology Beijing 100084China School of Information and Technology Tsinghua UniversityBeijing 100084China School of Electronics and Computer Science University of SouthamptonSouthampton SO171BJUK

Quantum secure direct communication(QSDC)is a unique technique,which supports the secure transmission of confidential information directly through a quantum channel without the need for a secret key and for *** this secure communication protocol fundamentally differs from its conventional *** this article,we report the first measurement-deviceindependent(MDI)QSDC protocol relying on sequences of entangled photon pairs and single ***,it eliminates the security loopholes associated with the measurement ***,this MDI technique is capable of doubling the communication distance of its conventional counterpart operating without using our MDI *** also conceive a protocol associated with linear optical Bell-basis measurements,where only two of the four Bell-basis states could be *** the number of qubits in a sequence reduces to 1,the MDI-QSDC protocol degenerates to a deterministic MDI quantum key distribution protocol.

关键词： quantum information secure communication quantum communication

来源：评论

学校读者我要写书评

暂无评论

A Survey of Trusted network Trust Evaluation Methods 2nd

A Survey of Trusted Network Trust Evaluation Methods

引用

2nd EAI International Conference on Security and Privacy in New Computing Environments, SPNCE 2019

作者： Yin, An-Sheng Zhang, Shun-Yi Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Nanjing210023 China Department of Internet of Things Nanjing University of Posts and Telecommunications Nanjing210023 China

ISBN: (纸本)9783030213725

The proposed trusted network is respond to the increasingly prominent internal network security threats. At present, research on trusted networks focuses on two aspects: pre-network access check and dynamic evaluation after access. The pre-access check considers the integrity of the terminal and uses encryption and authentication methods to achieve it. The dynamic evaluation uses the static and dynamic attributes of the trust to implement trust evaluation. © 2019, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

A general deep reinforcement learning framework for grant-free NOMA optimization in mURLLC

arXiv

引用

arXiv 2021年

作者： Liu, Yan Deng, Yansha Zhou, Hui Elkashlan, Maged Nallanathan, Arumugam Key Laboratory of Ministry of Education in Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Nanjing210003 China School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom Department of Engineering King's College London London United Kingdom

Grant-free non-orthogonal multiple access (GF-NOMA) is a potential technique to support massive Ultra-Reliable and Low-Latency communication (mURLLC) service. However, the dynamic resource configuration in GF-NOMA systems is challenging due to random traffics and collisions, that are unknown at the base station (BS). Meanwhile, joint consideration of the latency and reliability requirements makes the resource configuration of GF-NOMA for mURLLC more complex. To address this problem, we develop a general learning framework for signature-based GF-NOMA in mURLLC service taking into account the multiple access signature collision, the UE detection, as well as the data decoding procedures for the K-repetition GF and the Proactive GF schemes. The goal of our learning framework is to maximize the long-term average number of successfully served users (UEs) under the latency constraint. We first perform a real-time repetition value configuration based on a double deep Q-network (DDQN) and then propose a Cooperative Multi-Agent learning technique based on the DQN (CMA-DQN) to optimize the configuration of both the repetition values and the contention-transmission unit (CTU) numbers. Our results show that the number of successfully served UEs under the same latency constraint in our proposed learning framework is up to ten times for the K-repetition scheme, and two times for the Proactive scheme, more than that with fixed repetition values and CTU numbers. In addition, the superior performance of CMA-DQN over the conventional load estimation-based approach (LE-URC) demonstrates its capability in dynamically configuring in long term. Importantly, our general learning framework can be used to optimize the resource configuration problems in all the signature-based GF-NOMA schemes. Copyright © 2021, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Accurate and fast DV-hop localization algorithm in irregular networks 5th

Accurate and fast DV-hop localization algorithm in irregular...

引用

5th International Conference on Artificial Intelligence and Security, ICAIS 2019

作者： Yan, Xiaoyong Feng, Xiang Sun, Zhixin Broadband Wireless Communication and Sensor Network Technology Key Lab of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing210003 China YuanTong Express Co. LTD. Shanghai201705 China

ISBN: (纸本)9783030242701

The DV-hop localization algorithm does not depend on any measurement hardware, which only uses hop-counts to describe the Euclidean distance between nodes, it will not generate any additional burden, and thus this lightweight localization algorithm is economical and effective. Unfortunately, nodes generally have irregular distribution in reality, which tends to make deviations during the conversion between hop-counts and Euclidean distance, and as a result, the final estimated locations of nodes tend to deviate from the right location. Therefore, we analyzed the error during the hop-counts and Euclidean distance conversion, derived that the variance of error is related to hop-counts, and used the weighted least square method to correct the deviation. On this basis, we also limit the estimation location range of normal nodes according to the distances relationship between the estimated distances of normal nodes to anchor nodes and the distances of normal nodes estimated location to anchor nodes. Both the theoretical analysis and experimental results show that the proposed algorithm has not only maintained the economic characteristics of DV-hop localization, but also has the high localization accuracy and it can be adapted to various networks with different deployment of nodes. © Springer Nature Switzerland AG 2019.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Logic W-state concentration with parity check

Quantum Engineering

引用

Quantum Engineering 2021年第2期3卷

作者： Zhou, Lan Liu, Jiu Liu, Ze-Kai Zhong, Wei Sheng, Yu-Bo School of Science Nanjing University of Posts and Telecommunications Nanjing China Institute of Signal Processing Transmission Nanjing University of Posts and Telecommunications Nanjing China College of Telecommunications & Information Engineering Nanjing University of Posts and Telecommunications Nanjing China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China

Logic W state, which replaces each physical qubit in a W state with a Greenberger–Horne–Zeilinger state is robust against photon transmission loss in long-distance quantum communication. In practical application, the environmental noise may make maximally entangled logic W state degrade to less entangled state, which largely limits its application. In this article, we propose an efficient entanglement concentration protocol (ECP) for logic W state, which can recover the less entangled logic W state into the maximally entangled logic W state. Our ECP relies on the nondemolition polarization parity check (PPC) gate constructed with cross-Kerr nonlinearity. The distilled maximally entangled logic W state can be preserved for other application. Moreover, when the ECP fails, we can repeat the ECP to further concentrate the distilled less entangled logic W state. By repeating the ECP, the total success probability can be effectively increased. Based on above features, this ECP may be useful in quantum communication field. © 2021 John Wiley & Sons, Ltd.

关键词： Polarization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：