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

35th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2024

作者： Yahia, Selma Taleb, Sylia Mekhmoukh Loscri, Valeria Saadi, Amylia Ait Ho, Tu Dac Vo, Van Nhan Eldeeb, Hossien Muhaidat, Sami Inria Lille-Nord Europe Lille 59000 France University of m'Hamed Bougara List Laboratory Boumerdes35000 Algeria Esme Engineering School Ivry-sur-Seine94200 France Norwegian University of Science and Technology Department of Information Security and Communication Technology Norway The Arctic University of Norway Department of Electrical Engineering Norway Duy Tan University Faculty of Information Technology Viet Nam Duy Tan University The Institute of Research and Development Viet Nam Khalifa University 6G Research Center Computer and Communication Engineering Abu Dhabi United Arab Emirates

ISBN: (纸本)9798350362244

Unmanned aerial vehicles (UAVs) offer a promising solution for enhancing network coverage, reliability, and data speed in future wireless network generations. However, deploying UAVs as aerial base stations requires careful consideration of crucial design factors, including three-dimensional (3D) placement and performance optimization tailored to specific applications. In this paper, the 3D placement of multiple UAVs, acting as aerial base stations, is investigated in a dynamic user scenario. First, a closed-form expression for the coverage probability is derived. Then, to maximize the network coverage and sum rate while ensuring reliable and energy efficient system, a joint multi-objective optimization problem is formulated considering the real-time user movements. To solve the problem, an improved Chaos-based Bonobo Optimizer (CBO) scheme is proposed which combines chaotic maps with the Bonobo Optimizer (BO) algorithm. The obtained results demonstrate the superior performance of the proposed approach compared with different benchmark algorithms. The results reveal that the proposed CBO algorithm offers a minimum of 1 5 % and 9 0 ~ M b i t / s ~ i m p r o v e m e n t s ~ in coverage and sum rate, respectively. © 2024 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

IDTRSC: ID-based Traceable Ring Signcryption Framework for Data Sharing without key Escrow

引用

IEEE Transactions on Vehicular technology 2025年

作者： Wei, Jiannan Xie, Longyu Zhu, Qinchuan Gao, Yansong Yu, Keping Choo, Kim-Kwang Raymond Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China institute of State Key Laboratory of Cryptology P.O.Box 5159 Beijing100878 China Waseda University Global Information and Telecommunication Institute Shinjuku169-8050 Japan University of Texas San Antonio Department of Information Systems and Cyber Security San AntonioTX78249-0631 United States

The capability to share data across different entities is increasingly pronounced in our data-driven and centric society. However, we also have to ensure properties such as data confidentiality, unforgeability, anonymity and traceability are supported in the solutions we deploy. Hence, in this paper we present an ID-based ring signcryption scheme. Specifically, our scheme supports confidentiality, unforgeability, anonymity, traceability and non-frameability. For example, the signcryption sender's identity can be revealed if needed (e.g., investigation). In addition, unlike other existing schemes, each user's partial private key is generated by the key generation center in our scheme. This circumvents the key escrow problem. We then theoretically and empirically demonstrate that our proposed scheme incurs reduced computational costs, in comparison to other competing schemes especially when the number of ring members is large. © 1967-2012 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

GSLB: The Graph Structure Learning Benchmark 37

GSLB: The Graph Structure Learning Benchmark

引用

37th Conference on Neural information Processing systems, NeurIPS 2023

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

ISBN: (纸本)9781713899921

Graph Structure Learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure Learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Exfiltration-resistant Proxy Re-Encryption for IoT Data Sharing in Unreliable Clouds

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Zhou, Yuyang Zhao, Liang Li, Fagen Takagi, Tsuyoshi School of Cyberspace Security Hainan University Haikou570000 China Department of Mathematical Informatics Graduate School of Information Science and Technology The university of Tokyo Tokyo113-8656 Japan School of Cyber Science and Engineering Sichuan University Chengdu610065 China Key Laboratory of Data Protection and Intelligent Management [Sichuan University Ministry of Education China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China

The sharing of Internet of Things (IoT) data plays an extensive role in our everyday lives. Exploring secure and efficient methods for data sharing is a prominent area of research. Proxy re-encryption (PRE) in the cloud provides a solution. However, traditional PRE schemes are vulnerable to algorithm substitution attacks (ASA). Moreover, in most PRE schemes, the proxy can know the relevant identity information of the data owner or the data recipient through the re-encryption key, and some current PRE schemes cannot guarantee strong resistance to collision. To address the limitations of traditional PRE schemes and offer a robust solution for secure and efficient data sharing in IoT application, we propose a reverse firewall for proxy re-encryption (PRE-RF) scheme, which we implement using the JPBC library. The security analysis reveals that the PRE-RF scheme offers effective resistance against ASA, while also providing strong collision security, chosen plaintext attack security, and key-private security. Compared to similar PRE schemes with more security features, our scheme reduces the length of the re-encryption keys and ciphertext, thereby reducing the storage cost of the system;also, our scheme’s computational cost is lower, thereby improving the operational efficiency of the system. Furthermore, as security levels rise, the portion of time dedicated to reverse firewall operations within our scheme diminishes. These advantages collectively render it a secure and efficient choice for sharing IoT data in unreliable cloud environments. © 2004-2012 IEEE All rights reserved.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Prototype Implementation and Experimental Evaluation for LoRa-Backscatter Communication systems with RF Energy Harvesting and Low Power Management

引用

IEEE Transactions on Communications 2024年

作者： Tang, Xiaoqing Liu, Xin Xie, Guihui Cui, Yongqiang Li, Dong Hubei University School of Artificial Intelligence Wuhan China Ministry of Education Key Laboratory of Intelligent Sensing System and Security Hubei University Wuhan China Wuhan Qingchuan University Institute of Electronic Information Wuhan China School of Automation Wuhan China South-Central Minzu University College of Electronics and Information Engineering Wuhan China Macau University of Science and Technology School of Computer Science and Engineering Avenida Wai Long Taipa Macau China

Battery free Internet of Things (BF IoT), which is realized by harvesting ambient energy to power the IoT devices, has many advantages such as low power, low cost, free-maintenance, easy deployment, and environmental protection. As the two key enabling technologies of BF IoT, the integration of energy harvesting, management and backscatter communication (BackCom) is expected to meet practical applications. However, several fundamental issues need to be addressed to fully develop the potential of such integration. In this paper, we propose an ultra-low power energy harvesting and management scheme that effectively reduces the startup and quiescent power consumption. In the case of extremely limited energy harvested, the Long Range (LoRa) BackCom digital waveform generation algorithm with ultra-low power consumption and low complexity is studied, which can support low-power and low-cost micro-controllers (MCUs). Then, a radio frequency (RF) front-end scheme that is compatible with RF energy harvesting (RFEH), BackCom, and On-Off-keying (OOK) receiving is proposed. On this basis, we design and implement a fully functional BF LoRa Tag, which integrates tag antennas, LoRa BackCom, low-power OOK receiving, multi-parameter real-time sensing, RFEH and management, at a cost of only $6. Our test results show that the BF LoRa Tag can be self-powered by harvesting the RF energy as low as -19 dBm, with the cold-start power as low as 280 nW, the quiescent power as low as 49 nW, the OOK receiving power consumption as low as 1.74 μW, the LoRa BackCom power consumption of only 251 μW, and the communication distance up to 445 meters. Compared with the prototypes in existing literature, the BF LoRa Tag not only has lower power consumption, wider coverage, and the lowest cost, but also has complete system functions. Finally, we discuss the reciprocity between stations and receivers, as well as the BF LoRa cellular communication network, which provides useful references for the practica

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Cybersecurity of Unmanned Aerial Vehicles: A Survey

Cybersecurity of Unmanned Aerial Vehicles: A Survey

引用

International Conference on Advanced computer Theory and Engineering, ICACTE

作者： Renshuai Guo Minhuan Huang Jin Li Jingjing Wang National Key Laboratory of Science and Technology on Information System Security Beijing China

ISBN: (纸本)9781665442459

In recent years, due to rapid advances in science and technology and the continuous reduction of manufacturing costs, unmanned aerial vehicles (UAVs) have expanded from the military field to the civil field and are used in a variety of scenarios. However, while bringing convenience to people, the security problems with UAVs are becoming more and more obvious. It is therefore critically important to take the cybersecurity of UAVs into account. In the present paper, we introduce the composition structure and various applications of the UAVs, and analyze the research status of UAV cybersecurity. Then we discuss the cybersecurity issues faced by UAVs from the aspects of confidentiality, integrity and availability. In particular, the vulnerability analysis technologies used in the UAV software systems are introduced. At last, the future research directions of UAV cybersecurity are discussed.

关键词： Costs Autonomous aerial vehicles Software systems Manufacturing computer security

来源：评论

学校读者我要写书评

暂无评论

Online scheduling of transmission and processing for AoI minimization with edge computing

arXiv

引用

arXiv 2022年

作者： Zhu, Jianhang Gong, Jie Guangdong Key Laboratory Of Information Security Technology School Of Computer Science And Engineering Sun Yat-sen University Guangzhou510006 China

Age of information (AoI), which measures the time elapsed since the generation of the last received packet at the destination, is a new metric for real-time status update tracking applications. In this paper, we consider a status-update system in which a source node samples updates and sends them to an edge server over a delay channel. The received updates are processed by the server with an infinite buffer and then delivered to a destination. The channel can send only one update at a time, and the server can process one at a time as well. The source node applies generate-at-will model according to the state of the channel, the edge server, and the buffer. We aim to minimize the average AoI with independent and identically distributed transmission time and processing time. We consider three online scheduling policies. The first one is the optimal long wait policy, under which the source node only transmits a new packet after the old one is delivered. Secondly, we propose a peak age threshold policy, under which the source node determines the sending time based on the estimated peak age of information (PAoI). Finally, we improve the peak age threshold policy by considering a postponed plan to reduce the waiting time in the buffer. The AoI performance under these policies is illustrated by numerical results with different parameters. © 2022, CC BY.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

SMWT: A Universal and Lightweight SDN-Based Meter Table Watermarking Traceback Scheme

SMWT: A Universal and Lightweight SDN-Based Meter Table Wate...

引用

Asia-Pacific Network Operations and Management Symposium (APNOMS)

作者： Heng He Sen Yang Xiaohu Zhou Jia Wang School of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China Guilin Medical University Guilin China

The use of anonymous network has increased dramatically due to the development of network technology and people focus on the network security and privacy. However, anonymous networks are often used for illegal purposes, which has caused a significant increase in illegal transactions in the network. Therefore, it is necessary to investigate methods that can trace illegal transactions in anonymous networks. In this paper, we propose a universal and lightweight Software Defined Network (SDN)-based Meter table Watermarking Traceback scheme (SMWT), which is an active watermarking technology. SMWT uses the Bose-Chaudhuri-Hocquenghem (BCH) code as the encoding method and the flow rate as the carrier for the watermark to effectively trace flows of different communication protocols in various anonymous network environments. It utilises the SDN controller to install flow table entries and meter entries to the SDN switch, which can efficiently change the flow rate and embed the watermark in the flow in a stealthily manner. After the flow passes through the anonymous network, the SDN switch can extract the watermark using the flow rate and identify the two communicating parties. We have conducted experiments to evaluate SMWT in a real anonymous network Tor. Compared with other relevant existing schemes, SMWT demonstrated a higher detection rate of 96.7% and a lower false positive rate of 0.3%, as well as high flexibility and stealthiness, low deployment difficulty and controller load.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A robust incomplete large-scale group decision-making model for metaverse metro operations and maintenance

引用

Applied Soft Computing 2024年 156卷

作者： Bai, Wenhui Zhang, Chao Zhai, Yanhui Sangaiah, Arun Kumar School of Computer and Information Technology Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Shanxi Taiyuan030006 China International Graduate Institute of Artificial Intelligence National Yunlin University of Science and Technology Yunlin Taiwan Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon

The metaverse, constructed through digital technology, serves as a virtual realm intertwining with reality. Within this context, the challenge of evaluating data from diverse sources arises, and the application of large-scale group decision-making (LSGDM) methods emerges as a viable solution. Handling incomplete information and reducing dimensionality for large-scale decision-makers (DMs) is crucial in addressing complex decision-making problems. Moreover, addressing missing data is a fundamental and pivotal concern in tackling real-world decision challenges, given the ubiquitous presence of information gaps that cannot be straightforwardly integrated into decision models. Besides, the intricacies of LSGDM amplify this challenge by introducing a wealth of DMs, thereby augmenting the complexity and diversity of decision-related information. This paper proposes an approach to supplement missing data by double-dimensions. This paper explores various facets of similarity relationships within the data to enhance data completeness. Additionally, this paper categorizes DMs into clusters based on their relevance and establishes a two-stage consensus-reaching process (CRP) that takes into account both group sizes and individual consensus contributions. These CRPs play a crucial role in enhancing the overall consistency and consensus within the decision group. Subsequently, this paper applies a robust decision-making method rooted in MULTIMOORA (Multi-Objective Optimization by Ratio Analysis plus the complete MULTIplicative form) to rank decision objects. Finally, this paper employs this proposed methodology in a practical case study that involves evaluating the operational status of a metaverse's urban construction metro system. Following these considerations, a comprehensive stability analysis of relevant parameters is conducted to guarantee the robustness and reliability of the decision-making process. © 2024 Elsevier B.V.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Transmission of Bernoulli Sources Using Convolutional LDGM Codes

arXiv

引用

arXiv 2022年

作者： Wang, Yixin Zhu, Tingting Ma, Xiao The Guangdong Key Laboratory of Information Security Technology School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China

We propose in this paper to exploit convolutional low density generator matrix (LDGM) codes for transmission of Bernoulli sources over binary-input output-symmetric (BIOS) channels. To this end, we present a new framework to prove the coding theorems for linear codes, which unifies the channel coding theorem, the source coding theorem and the joint source-channel coding (JSCC) theorem. In the presented framework, the systematic bits and the corresponding parity-check bits play different roles. Precisely, the noisy systematic bits are used to limit the list size of typical codewords, while the noisy parity-check bits are used to select from the list the maximum likelihood codeword. This new framework for linear codes allows that the systematic bits and the parity-check bits are transmitted in different ways and over different channels. With this framework, we prove that the Bernoulli generator matrix codes (BGMCs) are capacity-achieving over BIOS channels, entropy-achieving for Bernoulli sources, and also system-capacity-achieving for JSCC applications. A lower bound on the bit-error rate (BER) is derived for linear codes, which can be used to predict the error floors and hence serves as a simple tool to design the JSCC system. Numerical results show that the convolutional LDGM codes perform well in the waterfall region and match well with the derived error floors, which can be lowered down if required by simply increasing the encoding memory. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：