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

IEEE Conference on Global Communications (GLOBECOM)

作者： Yujiao Zhu Mingzhe Chen Sihua Wang Yuchen Liu Gaolei Li Changchuan Yin Tony Q.S. Quek Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA Department of Computer Science North Carolina State University Raleigh NC USA School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University China

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In this paper, the optimization of unmanned aerial vehicle (UAV) localization under jamming attacks is studied. In the considered network, a base station (BS) collaborates with an active UAV to localize a target UAV. During this positioning process, a jamming UAV transmits discontinuous signals to passive UAVs to interfere the distance information measurement. To localize the target UAV under jamming attacks, the BS jointly use two localization methods: 1) generative adversarial network (GAN)-based positioning method and 2) time difference of arrival (TDOA)-based positioning method. Since GAN-based positioning method cannot defense in a strong jamming signal while TDOA-based positioning method may consume more energy and sacrifice localization accuracy, the BS must select an appropriate positioning method (GAN-based or TDOA-based methods) and four distance measurement information of passive UAVs to estimate the position of the target UAV. This problem is formulated as an optimization problem whose goal is to minimize the positioning error between the estimated and the ground truth positions of the target UAV while considering jamming attacks and the trajectory of passive UAVs. To solve this problem, we propose a mixture Gaussian distribution model-based collaborative reinforcement learning (RL) method which enables the active UAV to determine its transmit power and trajectory, and enables the BS to select the most appropriate subsets of distance measurement information and the optimal positioning method according to the movement of passive UAVs and the unknown jamming attack pattern of the jamming UAV. Simulation results show the proposed method can reduce the positioning error of the target UAV by up to 36.5% compared to the method that does not consider the GAN-based positioning method.

关键词： Location awareness Simulation Collaboration Reinforcement learning Gaussian distribution Autonomous aerial vehicles Distance measurement Trajectory Jamming Optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0

arXiv

引用

arXiv 2024年

作者： Wen, Jinbo Kang, Jiawen Xiong, Zehui Du, Hongyang Yang, Zhaohui Niyato, Dusit Shen, Meng Jiao, Yutao Zhang, Yang The College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong The College of Information Science and Electronic Engineering Zhejiang University China The School of Computer Science and Engineering Nanyang Technological University Singapore The School of Cyberspace Science and Technology Beijing Institute of Technology China The College of Communications Engineering Army Engineering University of PLA China

Web 3.0 is regarded as a revolutionary paradigm that enables users to securely manage data without a centralized authority. Blockchains, which enable data to be managed in a decentralized and transparent manner, are key technologies for achieving Web 3.0 goals. However, Web 3.0 based on blockchains is still in its infancy, such as ensuring block freshness and optimizing block propagation for improving blockchain performance. In this paper, we develop a freshness-aware block propagation optimization framework for Web 3.0. We first propose a novel metric called Age of Block Information (AoBI) based on the concept of age of information to quantify block freshness. AoBI measures the time elapsed from the freshest transaction generation to the completion of block consensus. To make block propagation optimization tractable, we classify miners into five different states and propose a block propagation model for public blockchains inspired by epidemic models. Moreover, considering that the miners are bounded rational, we propose an incentive mechanism based on the evolutionary game for block propagation to improve block propagation efficiency. Numerical results demonstrate that compared with other block propagation mechanisms in public blockchains, the proposed scheme has a higher block forwarding probability, which improves block propagation efficiency and decreases the minimum value of average AoBI. Copyright © 2024, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Secure Post-Quantum Multi-Authority Ciphertext-Policy Attribute-Based Encryption Method Using Lattice

An Efficient and Secure Post-Quantum Multi-Authority Ciphert...

引用

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Prithwi Bagchi Basudeb Bera Raj Maheshwari Ashok Kumar Das David K. Y. Yau Biplab Sikdar Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad India Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore

This article deals with designing an efficient post-quantum lattice based encryption scheme that relies on the multi-authority Ciphertext-Policy Attribute-Based Encryption (CP-ABE). The security of the proposed scheme is based on the hardness of the ring learning with errors (RLWE) problem. The construction of the proposed scheme is done using the Shamir's threshold secret sharing along with the Lagrange interpolation during the key generation and decryption processes in order to achieve the segmentation and restoration of private keys. A comparative study with the existing state of art schemes has been performed to show the feasibility and efficiency of the proposed scheme. Furthermore, experiments on the proposed scheme have been conducted to illustrate the computational time required during the key generation, encryption and decryption processes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Age-of-Information and Energy Optimization in Digital Twin Edge Networks

Age-of-Information and Energy Optimization in Digital Twin E...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Yongna Guo Yaru Fu Yan Zhang Tony Q. S. Quek School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden School of Science and Technology Hong Kong Metropolitan University China Department of Informatics University of Oslo Oslo Norway Information Systems Technology and Design Singapore University of Technology and Design Singapore

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In this paper, we study the intricate realm of digital twin synchronization and deployment in multi-access edge computing (MEC) networks, with the aim of optimizing and balancing the two performance metrics Age of Information (AoI) and energy efficiency. We jointly consider the problems of edge association, power allocation, and digital twin deployment. However, the inherent randomness of the problem presents a significant challenge in identifying an optimal solution. To address this, we first analyze the feasibility conditions of the optimization problem. We then examine a specific scenario involving a static channel and propose a cyclic scheduling scheme. This enables us to derive the sum AoI in closed form. As a result, the joint optimization problem of edge association and power control is solved optimally by finding a minimum weight perfect matching. Moreover, we examine the one-shot optimization problem in the contexts of both frequent digital twin migrations and fixed digital twin deployments, and propose an efficient online algorithm to address the general optimization problem. This algorithm effectively reduces system costs by balancing frequent migrations and fixed deployments. Numerical results demonstrate the effectiveness of our proposed scheme in terms of low cost and high efficiency.

关键词： Measurement Multi-access edge computing Costs Numerical analysis Power control Information age Digital twins Synchronization Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation

arXiv

引用

arXiv 2024年

作者： Xu, Minrui Niyato, Dusit Kang, Jiawen Xiong, Zehui Cao, Yuan Gao, Yulan Ren, Chao Yu, Han The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore The School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore The School of Communications and Information Engineering Nanjing University of Posts and Telecommunications Nanjing210003 China

Quantum computing networks enable scalable collaboration and secure information exchange among multiple classical and quantum computing nodes while executing large-scale generative AI computation tasks and advanced quantum algorithms. Quantum computing networks overcome limitations such as the number of qubits and coherence time of entangled pairs and offer advantages for generative AI infrastructure, including enhanced noise reduction through distributed processing and improved scalability by connecting multiple quantum devices. However, efficient resource allocation in quantum computing networks is a critical challenge due to factors including qubit variability and network complexity. In this article, we propose an intelligent resource allocation framework for quantum computing networks to improve network scalability with minimized resource costs. To achieve scalability in quantum computing networks, we formulate the resource allocation problem as stochastic programming, accounting for the uncertain fidelities of qubits and entangled pairs. Furthermore, we introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation to resolve the proposed stochastic resource allocation problem efficiently. Finally, we optimize the resource allocation in heterogeneous quantum computing networks supporting quantum generative learning applications and propose a multi-agent RL-based algorithm to learn the optimal resource allocation policies without prior knowledge. © 2024, CC BY.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Equilibria, Efficiency, and Inequality in Network Formation for Hiring and Opportunity

arXiv

引用

arXiv 2024年

作者： Dwork, Cynthia Hays, Chris Kleinberg, Jon Raghavan, Manish Department of Computer Science Harvard University United States Institute for Data Systems and Society Massachusetts Institute of Technology United States Departments of Computer Science and Information Science Cornell University United States Sloan School of Management Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology United States

Professional networks — the social networks among people in a given line of work — can serve as a conduit for job prospects and other opportunities. Here we propose a model for the formation of such networks and the transfer of opportunities within them. In our theoretical model, individuals strategically connect with others to maximize the probability that they receive opportunities from them. We explore how professional networks balance connectivity, where connections facilitate opportunity transfers to those who did not get them from outside sources, and congestion, where some individuals receive too many opportunities from their connections and waste some of them. We show that strategic individuals are over-connected at equilibrium relative to a social optimum, leading to a price of anarchy for which we derive nearly tight asymptotic bounds. We also show that, at equilibrium, individuals form connections to those who provide similar benefit to them as they provide to others. Thus, our model provides a microfoundation in professional networking contexts for the fundamental sociological principle of homophily, that "similarity breeds connection" [29], which in our setting is realized as a form of status homophily based on alignment in individual benefit. We further explore how, even if individuals are a priori equally likely to receive opportunities from outside sources, equilibria can be unequal, and we provide nearly tight bounds on how unequal they can be. Finally, we explore the ability for online platforms to intervene to improve social welfare and show that natural heuristics may result in adverse effects at equilibrium. Our simple model allows for a surprisingly rich analysis of coordination problems in professional networks and suggests many directions for further exploration. © 2024, CC BY.

关键词： Professional aspects

来源：评论

学校读者我要写书评

暂无评论

User-Centric Interactive AI for Distributed Diffusion Model-based AI-Generated Content

arXiv

引用

arXiv 2023年

作者： Du, Hongyang Zhang, Ruichen Niyato, Dusit Kang, Jiawen Xiong, Zehui Cui, Shuguang Shen, Xuemin Kim, Dong In The School of Computer Science and Engineering Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Chinese University of Hong Kong Shenzhen China The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Distributed Artificial Intelligence-Generated Content (AIGC) has attracted increasing attention. However, it faces two significant challenges: how to maximize the subjective Quality of Experience (QoE) and how to enhance the energy efficiency, which are particularly pronounced in widely adopted Generative Diffusion Model (GDM)-based AIGC services for image generation. In this paper, we propose a novel user-centric Interactive AI (IAI) approach for service management, with a distributed GDM-based AIGC framework, prioritizing efficient and collaborative GDM deployment. Specifically, we restructure the GDM's inference process, i.e., the denoising chain, to enable users' semantically similar prompts to share a portion of diffusion steps. Furthermore, to maximize the users' subjective QoE, we propose a IAI approach, i.e., Reinforcement Learning With Large Language Models Interaction (RLLI), which utilizes Large Language Model (LLM)-empowered generative agents to replicate users interaction, providing real-time and subjective QoE feedback that reflects a spectrum of user personalities. Lastly, we present the GDM-based Deep Deterministic Policy Gradient (G-DDPG) algorithm, adapted to the proposed RLLI framework, for effective communication and computing resource allocation while considering user subjective personalities and dynamic wireless environments in decision-making. Simulation results show that G-DDPG can increase the sum QoE by 15%, compared with the conventional DDPG algorithm. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Semantic Communications for Wireless Sensing: RIS-aided Encoding and Self-supervised Decoding

arXiv

引用

arXiv 2022年

作者： Du, Hongyang Wang, Jiacheng Niyato, Dusit Kang, Jiawen Xiong, Zehui Zhang, Junshan Shen, Xuemin The School of Computer Science and Engineering Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The Department of Electrical and Computer Engineering University of California Davis United States The Department of Electrical and Computer Engineering University of Waterloo Canada

Semantic communications can reduce the resource consumption by transmitting task-related semantic information extracted from source messages. However, when the source messages are utilized for various tasks, e.g., wireless sensing data for localization and activities detection, semantic communication technique is difficult to be implemented because of the increased processing complexity. In this paper, we propose the inverse semantic communications as a new paradigm. Instead of extracting semantic information from messages, we aim to encode the task-related source messages into a hyper-source message for data transmission or storage. Following this paradigm, we design an inverse semantic-aware wireless sensing framework with three algorithms for data sampling, reconfigurable intelligent surface (RIS)-aided encoding, and self-supervised decoding, respectively. Specifically, on the one hand, we propose a novel RIS hardware design for encoding several signal spectrums into one MetaSpectrum. To select the task-related signal spectrums for achieving efficient encoding, a semantic hash sampling method is introduced. On the other hand, we propose a self-supervised learning method for decoding the MetaSpectrums to obtain the original signal spectrums. Using the sensing data collected from real-world, we show that our framework can reduce the data volume by 95% compared to that before encoding, without affecting the accomplishment of sensing tasks. Moreover, compared with the typically used uniform sampling scheme, the proposed semantic hash sampling scheme can achieve 67% lower mean squared error in recovering the sensing parameters. In addition, experiment results demonstrate that the amplitude response matrix of the RIS enables the encryption of the sensing data. © 2022, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Vision-based Semantic Communications for Metaverse Services: A Contest Theoretic Approach

Vision-based Semantic Communications for Metaverse Services:...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Guangyuan Liu Hongyang Du Dusit Niyato Jiawen Kang Zehui Xiong Boon Hee Soong Energy Research Institute@NTU Interdisciplinary Graduate Program School of Computer Science and Engineering Nanyang Technological University Singapore School of Computer Science and Engineering Nanyang Technological University Singapore School of Automation Guangdong University of Technology China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Electrical and Electronic Engineering Nanyang Technological University Singapore

The popularity of Metaverse as an entertainment, social, and work platform has led to a great need for seamless avatar integration in the virtual world. In Metaverse, avatars must be updated and rendered to reflect users' behaviour. Achieving real-time synchronization between the virtual bilocation and the user is complex, placing high demands on the Metaverse Service Provider (MSP)'s rendering resource allocation scheme. To tackle this issue, we propose a semantic communication framework that leverages contest theory to model the interactions between users and MSPs and determine optimal resource allocation for each user. To reduce the consumption of network resources in wireless transmission, we use the semantic communication technique to reduce the amount of data to be transmitted. Under our simulation settings, the encoded semantic data only contains 51 bytes of skeleton coordinates instead of the image size of 8.243 megabytes. Moreover, we implement Deep Q-Network to optimize reward settings for maximum performance and efficient resource allocation. With the optimal reward setting, users are incentivized to select their respective suitable uploading frequency, reducing down-sampling loss due to rendering resource constraints by 66.076% compared with the traditional average distribution method. The framework provides a novel solution to resource allocation for avatar association in VR environments, ensuring a smooth and immersive experience for all users.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive Federated Learning Over the Air

arXiv

引用

arXiv 2024年

作者： Wang, Chenhao Chen, Zihan Pappas, Nikolaos Yang, Howard H. Quek, Tony Q.S. Poor, H. Vincent The ZJU-UIUC Institute Zhejiang University Haining314400 China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore The Department of Computer and Information Science Linköping University Linköping58183 Sweden The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

We propose a federated version of adaptive gradient methods, particularly AdaGrad and Adam, within the framework of over-the-air model training. This approach capitalizes on the inherent superposition property of wireless channels, facilitating fast and scalable parameter aggregation. Meanwhile, it enhances the robustness of the model training process by dynamically adjusting the stepsize in accordance with the global gradient update. We derive the convergence rate of the training algorithms, encompassing the effects of channel fading and interference, for a broad spectrum of nonconvex loss functions. Our analysis shows that the AdaGrad-based algorithm converges to a stationary point at the rate of O(ln (T)/T1−1/α), where α represents the tail index of the electromagnetic interference. This result indicates that the level of heavy-tailedness in interference distribution plays a crucial role in the training efficiency: the heavier the tail, the slower the algorithm converges. In contrast, an Adam-like algorithm converges at the O(1/T) rate, demonstrating its advantage in expediting the model training process. We conduct extensive experiments that corroborate our theoretical findings and affirm the practical efficacy of our proposed federated adaptive gradient methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：