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

IEEE Conference on Global Communications (GLOBECOM)

作者： Zhouxiang Zhao Zhaohui Yang Mingzhe Chen Xu Gan Chongwen Huang Wei Xu Zhaoyang Zhang College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA National Mobile Communications Research Laboratory Southeast University Nanjing China

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In this paper, the energy efficiency maximization problem in space-air-ground integrated network (SAGIN)-enabled probabilistic semantic communication (PSC) is investigated. In the considered model, a satellite needs to transmit data to multiple ground terminals (GTs) via an unmanned aerial vehicle (UAV) acting as a relay. During transmission, the satellite and the UAV can use PSC technique to compress the transmitted data, while the GTs can automatically recover the original data. In the considered PSC system, shared probability graphs serve as a common knowledge base among the transceivers, allowing for resource-saving communication at the expense of increased computation resource. Therefore, it is important to study the trade-off between communication and computation to achieve optimal energy efficiency. The joint communication and computation problem is formulated as an optimization problem aiming to minimize the total communication and computation energy consumption of the network under latency, semantic compression ratio, and UAV location constraints. To solve this non-convex problem, we propose an alternating algorithm. Numerical results show the effectiveness of the proposed algorithm.

关键词： Energy consumption Satellites Autonomous aerial vehicles Space-air-ground integrated networks Semantic communication Probabilistic logic Energy efficiency Transceivers Relays Optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-User Probabilistic Semantic Communication with Semantic Compression Ratio Optimization

Multi-User Probabilistic Semantic Communication with Semanti...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Zhouxiang Zhao Zhaohui Yang Mingzhe Chen Changsheng You Qianqian Yang Wei Xu Zhaoyang Zhang College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China National Mobile Communications Research Laboratory Southeast University Nanjing China

ISBN: (数字)9798350304053

ISBN: (纸本)9798350304060

In this paper, the problem of joint transmission and computation resource allocation for a multi-user probabilistic semantic communication (PSC) network is investigated. In the considered model, users employ semantic information extraction techniques to compress their large-sized raw data before transmitting them to a multi-antenna base station (BS). Our model represents the raw data through comprehensive knowledge graphs, utilizing shared probability graphs between users and the BS for efficient semantic compression. The resource allocation problem is formulated as an optimization problem with the objective of maximizing the sum of equivalent rate of all users, considering total power budget constraint. This joint optimization problem inherently addresses the delicate balance between transmission efficiency and computational complexity. To address this optimization challenge, we present an iterative algorithm in which the optimal solution for the semantic compression ratio of a specific user is determined at each iteration. Numerical results validate the effectiveness of the proposed scheme.

关键词： Conferences Computational modeling Semantics Knowledge graphs Probabilistic logic information retrieval Data models

来源：评论

学校读者我要写书评

暂无评论

KANsformer for Scalable Beamforming

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Xie, Xinke Lu, Yang Chi, Chong-Yung Chen, Wei Ai, Bo Niyato, Dusit Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation Beijing100044 China Beijing Jiaotong University School of Computer Science and Technology Beijing100044 China National Tsing Hua University Institute of Communications Engineering Department of Electrical Engineering Hsinchu30013 Taiwan Beijing Jiaotong University School of Electronics and Information Engineering Beijing100044 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

This paper proposes an unsupervised deep-learning (DL) approach by integrating Transformer and Kolmogorov-Arnold networks (KAN) termed KANsformer to realize scalable beamforming for mobile communication systems. Specifically, we consider a classic multi-input single-output energy efficiency maximization problem subject to the total power budget. The proposed KANsformer first extracts hidden features via a multi-head self-attention mechanism and then reads out the desired beamforming design via KAN. Numerical results are provided to evaluate the KANsformer in terms of generalization performance, transfer learning and ablation experiment. Overall, the KANsformer outperforms the existing benchmark DL approaches, and is adaptable to the variation in the number of mobile users with real-time and near-optimal inference. © 1967-2012 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Dynamic Spectrum Aggregation and Access for Rescue Cognitive Networks Using Multi-Agent Actor-Critic Reinforcement Learning

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Zhang, Wensheng Ding, Wenjiao Wang, Cheng-Xiang Chen, Yunfei Abreu, Giuseppe Liu, Zhi Sun, Jian Han, Zhu Shandong University School of Information Science and Engineering Shandong Key Laboratory of Intelligent Communication and Sensing-Computing Integration Qingdao266237 China Industrial and Commercial Bank Of China Limited Shandong Branch Jinan China Southeast University National Mobile Communications Research Laboratory School of Information Science and Engineering Nanjing211189 China Purple Mountain Laboratories Pervasive Communication Research Center Nanjing211111 China Durham University Department of Engineering DurhamDH1 3LE United Kingdom Constructor University Bremen GGMBH School of Computer Science and Engineering Campus Ring 1 Bremen28757 Germany University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

Unmanned aerial vehicles (UAVs) based emergency communication is gaining more attention for disaster rescue, where the UAV can work as an aerial base station to provide spectrum access in areas with power outages or network interruptions. However, UAVs can only provide limited spectrum access for a short period of time due to limited battery energy. Aiming to providing spectrum access to more users under spectrum and energy limitations, a new dynamic spectrum aggregation and access scheme is proposed for rescue cognitive networks (RCNs), in which different kinds of users are modeled as primary users (PUs) and secondary users (SUs). In each time slot, SUs with different spectrum sensing capabilities, spectrum aggregation capabilities, and bandwidth demands need to sense and aggregate multiple spectrum slots that are not occupied by PUs for data transmission. Based on selected channel states, the reward is designed as a function of transmission rates and is fed back to SUs. A maximum entropy based multi-agent actor-critic (ME-MAAC) algorithm is proposed to optimize the action selection policy for SUs. Simulation results show that the proposed ME-MAAC algorithm can effectively achieve higher achievable rate, lower mean collision rate and lower power consumption, than state-of-the-art methods based on Deep Q-Network (DQN) algorithm. The proposed RCNs provide a novel spectrum usage paradigm for emergency communication and rescue networks. © 2015 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Semantic Relay Aided Wireless Networks with Probability Graph

Resource Allocation for Semantic Relay Aided Wireless Networ...

引用

IEEE International Conference on Communications (ICC)

作者： Jiahui Zhao Ming Chen Zhaohui Yang Changsheng You Mingzhe Chen National Mobile Communications Research Laboratory Southeast University Nanjing China College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

In this paper, we introduce a novel uplink semantic relay (SemRelay)-aided wireless communication system, catering to multiple users by leveraging a shared probability graph between the SemRelay and the base station (BS). In this system, users transmit text information to the SemRelay through conventional bit transmission, and the SemRelay compresses this information using a knowledge based characterized by probability graph before transmitting it to the BS through semantic communication. Then, the BS recovers the information based on the shared probability graph. While the semantic information compression incurs computational resource consumption, it significantly reduces communication resource usage. This paper addresses the challenge of minimizing overall system latency through jointly optimizing communication and computation re-source allocation, considering limited wireless resources and the system's energy budget. To address this problem, we introduce an efficient iterative algorithm, which employs block coordinate descent for communication resource allocation and exhaustive searching for determining the optimal data compression scheme. In particular, both power allocation subproblem and bandwidth allocation subproblem are proved to be convex. The complexity analysis of the proposed algorithm are also provided. Numerical results validate the effectiveness of the proposed algorithm and the superior performance of semantic communication compared to the conventional bit transmission.

关键词： Wireless networks Semantics Knowledge based systems Data compression Search problems Complexity theory Resource management

来源：评论

学校读者我要写书评

暂无评论

Aerial Secure Collaborative Communications under Eavesdropper Collusion in Low-altitude Economy: A Generative Swarm Intelligent Approach

arXiv

引用

arXiv 2025年

作者： Li, Jiahui Sun, Geng Wu, Qingqing Liang, Shuang Wang, Jiacheng Niyato, Dusit Kim, Dong In College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China School of Information Science and Technology Northeast Normal University Changchun130117 China Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

The rapid development of the low-altitude economy (LAE) has significantly increased the utilization of autonomous aerial vehicles (AAVs) in various applications, necessitating efficient and secure communication methods among AAV swarms. In this work, we aim to introduce distributed collaborative beamforming (DCB) into AAV swarms and handle the eavesdropper collusion by controlling the corresponding signal distributions. Specifically, we consider a two-way DCB-enabled aerial communication between two AAV swarms and construct these swarms as two AAV virtual antenna arrays. Then, we minimize the two-way known secrecy capacity and maximum sidelobe level to avoid information leakage from the known and unknown eavesdroppers, respectively. Simultaneously, we also minimize the energy consumption of AAVs when constructing virtual antenna arrays. Due to the conflicting relationships between secure performance and energy efficiency, we consider these objectives by formulating a multi-objective optimization problem, which is NP-hard and with a large number of decision variables. Accordingly, we design a novel generative swarm intelligence (GenSI) framework to solve the problem with less overhead, which contains a conditional variational autoencoder (CVAE)-based generative method and a proposed powerful swarm intelligence algorithm. In this framework, CVAE can collect expert solutions obtained by the swarm intelligence algorithm in other environment states to explore characteristics and patterns, thereby directly generating high-quality initial solutions in new environment factors for the swarm intelligence algorithm to search solution space efficiently. Simulation results show that the proposed swarm intelligence algorithm outperforms other state-of-the-art baseline algorithms, and the GenSI can achieve similar optimization results by using far fewer iterations than the ordinary swarm intelligence algorithm. Experimental tests demonstrate that introducing the CVAE mechanism ach

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

arXiv

引用

arXiv 2025年

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian Key Laboratory of Network Fuzhou350002 China Computing and Intelligent Information Processing [Fuzhou University Fuzhou350116 China Department of Computer Science Faculty of Environment Science and Economy University of Exeter ExeterEX4 4QF United Kingdom School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Informatics University of Oslo Oslo0316 Norway

Mobile Edge computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Devils in the Clouds: An Evolutionary Study of Telnet Bot Loaders

Devils in the Clouds: An Evolutionary Study of Telnet Bot Lo...

引用

IEEE International Conference on Communications (ICC)

作者： Yuhui Zhu Zhenxiang Chen Qiben Yan Shanshan Wang Alberto Giaretta Enlong Li Lizhi Peng Chuan Zhao Mauro Conti Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan China School of Information Science and Engineering University of Jinan China Department of Computer Science and Engineering Michigan State University USA AASS MPI Lab Örebro University Sweden Department of Mathematics University of Padua Italy

One of the innovations brought by Mirai and its derived malware is the adoption of self-contained loaders for infecting IoT devices and recruiting them in botnets. Functionally decoupled from other botnet components and not embedded in the payload, loaders cannot be analysed using conventional approaches that rely on honeypots for capturing samples. Different approaches are necessary for studying the loaders evolution and defining a genealogy. To address the insufficient knowledge about loaders' lineage in existing studies, in this paper, we propose a semantic-aware method to measure, categorize, and compare different loader servers, with the goal of highlighting their evolution, independent from the payload evolution. Leveraging behavior-based metrics, we cluster the discovered loaders and define eight families to determine the genealogy and draw a homology map. Our study shows that the source code of Mirai is evolving and spawning new botnets with new capabilities, both on the client side and the server side. In turn, shedding light on the infection loaders can help the cybersecurity community to improve detection and prevention tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Meet-in-the-Middle Statistical Fault Analysis of the PRESENT lightweight Cryptosystem

Meet-in-the-Middle Statistical Fault Analysis of the PRESENT...

引用

作者： Li, Wei Zhu, Xiao-Ming Gu, Da-Wu Li, Jia-Yao Cai, Tian-Pei School of Computer Science and Technology Donghua University Shanghai201620 China Department of Computer and Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Shanghai Key Laboratory of Scalable Computing and System Shanghai200240 China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Shanghai200240 China

The lightweight block cipher PRESENT was presented at the International Conference on Cryptographic Hardware and Embedded Systems (CHES) in 2007, and it has become a standard of ISO/IEC-29192-2 for lightweight cryptosystems since 2012. Within the environment of the Internet of Things, this cipher is applicable to Radio Frequency Identification, network sensors, and smart cards. Its secret key can be either 80 or 128 bits long, while the block is 128 bits long. Since the publication of the PRESENT, numerous forms of cryptanalysis have been developed in order to evaluate its level of security. Some examples of these attacks include the differential attack, the linear attack, the integral attack, the algebraic attack, the fault attack, the side-cube attack, and the Biclique attack. All of these cryptanalyses are on the basis of the assumption that an attack using a chosen plaintext or an attack using a known plaintext would occur. In order to carry out a chosen-plaintext attack, an attacker must have the ciphertexts along with the plaintexts that go along with them, whereas a known-plaintext attack requires a significant quantity of plaintexts and ciphertexts. The ciphertext-only attack is distinct from the chosen-plaintext attack and the known-plaintext attack, which require the ciphertext only in order to be successful. In this sense, the ciphertext-only attack is relevant in a range of scenarios. There is no research that has been released yet regarding PRESENT'S resilience to the ciphertext-only attack. This study presents a novel meet-in-the-middle statistical fault analysis using the approach of statistical analysis and meet-in-the-middle attack of PRESENT. This analysis is able to decrypt the 80-bit and 128-bit secret keys of PRESENT with a series of new distinguishers that include the Pearson correlation coefficient-Hamming weight, the Kullback Leibler divergence- Hamming weight, and the Jaccard similarity coefficient-Hamming weight-maximum likelihood estimatio

关键词： Side channel attack

来源：评论

学校读者我要写书评

暂无评论

Lightweight Vision Model-based Multi-user Semantic Communication Systems

arXiv

引用

arXiv 2025年

作者： Jiang, Feibo Tu, Siwei Dong, Li Wang, Kezhi Yang, Kun Liu, Ruiqi Pan, Cunhua Wang, Jiangzhou Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory Changsha410205 China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China Wireless and Computing Research Institute ZTE Corporation Beijing100029 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China National Mobile Communications Research Laboratory Southeast University Nanjing China Purple Mountain Laboratories Nanjing China

Semantic Communication (SemCom) is a promising new paradigm for next-generation communication systems, emphasizing the transmission of core information, particularly in environments characterized by uncertainty, noise, and bandwidth constraints. However, existing image SemCom systems face several challenges, such as inefficient knowledge base construction, insufficient semantic encoding, and lack of multi-user semantic sharing. To address these issues, we propose a Lightweight Vision Model-based Multi-user Semantic Communication System (LVM-MSC). First, we construct a Lightweight Knowledge Base (LKB) based on the fast Segment Anything Model (SAM). LKB incorporates the extensive image knowledge of the SAM model while significantly reducing the number of parameters through its convolutional architecture. Next, we design an Efficient Semantic Codec (ESC) based on the Masked AutoEncoder (MAE) architecture. ESC enhances semantic compression at both the pixel and semantic levels and implements lightweight semantic decoding tailored for user devices. Furthermore, we propose a Multi-user Semantic Sharing (MSS) transmission for the multi-user SemCom. By calculating the similarity of semantic information among different users in the sharing semantic space, we unify the transmissions of similar semantic information through broadcasting, further improving the transmission efficiency. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed LVM-MSC system. Copyright © 2025, The Authors. All rights reserved.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：