Chengzhi Ma, Jintao Wang, Xi Yang, Guanghua Yang, Wei Zhang, Shaodan Ma
In this paper, we investigate a novel reconfigurable distributed antennas and reflecting surface (RDARS) aided multi-user massive MIMO system with imperfect CSI and propose a practical two-timescale (TTS) transceiver design to reduce the communication overhead and computational complexity of the system. In the RDARS-aided system, not only distribution gain but also reflection gain can be obtained by a flexible combination of the distributed antennas and reflecting surface, which differentiates the system from the others and also makes the TTS design challenging. To enable the optimal TTS transceiver design, the achievable rate of the system is first derived in closed-form. Then the TTS design aiming at the weighted sum rate maximization is considered. To solve the challenging non-convex optimization problem with high-order design variables, i.e., the transmit powers and the phase shifts at the RDARS, a block coordinate descent based method is proposed to find the optimal solutions in semi-closed forms iteratively. Specifically, two efficient algorithms are proposed with provable convergence for the optimal phase shift design, i.e., Riemannian Gradient Ascent based algorithm by exploiting the unit-modulus constraints, and Two-Tier Majorization-Minimization based algorithm with closed-form optimal solutions in each iteration. Simulation results validate the effectiveness of the proposed algorithm and demonstrate the superiority of deploying RDARS in massive MIMO systems to provide substantial rate improvement with a significantly reduced total number of active antennas/RF chains and lower transmit power when compared to the DAS and RIS-aided systems.
{"title":"RDARS Empowered Massive MIMO System: Two-Timescale Transceiver Design with Imperfect CSI","authors":"Chengzhi Ma, Jintao Wang, Xi Yang, Guanghua Yang, Wei Zhang, Shaodan Ma","doi":"arxiv-2312.08753","DOIUrl":"https://doi.org/arxiv-2312.08753","url":null,"abstract":"In this paper, we investigate a novel reconfigurable distributed antennas and\u0000reflecting surface (RDARS) aided multi-user massive MIMO system with imperfect\u0000CSI and propose a practical two-timescale (TTS) transceiver design to reduce\u0000the communication overhead and computational complexity of the system. In the\u0000RDARS-aided system, not only distribution gain but also reflection gain can be\u0000obtained by a flexible combination of the distributed antennas and reflecting\u0000surface, which differentiates the system from the others and also makes the TTS\u0000design challenging. To enable the optimal TTS transceiver design, the\u0000achievable rate of the system is first derived in closed-form. Then the TTS\u0000design aiming at the weighted sum rate maximization is considered. To solve the\u0000challenging non-convex optimization problem with high-order design variables,\u0000i.e., the transmit powers and the phase shifts at the RDARS, a block coordinate\u0000descent based method is proposed to find the optimal solutions in semi-closed\u0000forms iteratively. Specifically, two efficient algorithms are proposed with\u0000provable convergence for the optimal phase shift design, i.e., Riemannian\u0000Gradient Ascent based algorithm by exploiting the unit-modulus constraints, and\u0000Two-Tier Majorization-Minimization based algorithm with closed-form optimal\u0000solutions in each iteration. Simulation results validate the effectiveness of\u0000the proposed algorithm and demonstrate the superiority of deploying RDARS in\u0000massive MIMO systems to provide substantial rate improvement with a\u0000significantly reduced total number of active antennas/RF chains and lower\u0000transmit power when compared to the DAS and RIS-aided systems.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138693177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Over-the-Air (OtA) computation is a newly emerged concept for computing functions of data from distributed nodes by taking advantage of the wave superposition property of wireless channels. Despite its advantage in communication efficiency, OtA computation is associated with significant security and privacy concerns that have so far not been thoroughly investigated, especially in the case of active attacks. In this paper, we propose and evaluate a detection scheme against active attacks in OtA computation systems. More explicitly, we consider an active attacker which is an external node sending random or misleading data to alter the aggregated data received by the server. To detect the presence of the attacker, in every communication period, legitimate users send some dummy samples in addition to the real data. We propose a detector design that relies on the existence of a shared secret only known by the legitimate users and the server, that can be used to hide the transmitted signal in a secret subspace. After the server projects the received vector back to the original subspace, the dummy samples can be used to detect active attacks. We show that this design achieves good detection performance for a small cost in terms of channel resources.
空中计算（OtA）是一个新出现的概念，它利用无线信道的波叠加特性，计算分布式节点的数据函数。尽管空中计算在通信效率方面具有优势，但它在安全和隐私方面却存在重大隐患，迄今为止尚未对其进行深入研究，尤其是在主动攻击的情况下。在本文中，我们提出并评估了一种针对 OtA 计算系统中主动攻击的检测方案。更明确地说，我们认为主动攻击者是一个外部节点，它发送随机或误导数据来改变服务器接收到的聚合数据。为了检测攻击者的存在，在每次通信期间，合法用户都会在真实数据之外发送一些虚假样本。我们提出了一种检测器设计，它依赖于只有合法用户和服务器知道的共享秘密的存在，该秘密可用于将传输信号隐藏在秘密子空间中。服务器将接收到的矢量投影回原始子空间后，假样本就可以用来检测主动攻击。我们的研究表明，这种设计以较小的信道资源成本实现了良好的检测性能。
{"title":"Detecting Active Attacks in Over-the-Air Computation using Dummy Samples","authors":"David Nordlund, Zheng Chen, Erik G. Larsson","doi":"arxiv-2312.08950","DOIUrl":"https://doi.org/arxiv-2312.08950","url":null,"abstract":"Over-the-Air (OtA) computation is a newly emerged concept for computing\u0000functions of data from distributed nodes by taking advantage of the wave\u0000superposition property of wireless channels. Despite its advantage in\u0000communication efficiency, OtA computation is associated with significant\u0000security and privacy concerns that have so far not been thoroughly\u0000investigated, especially in the case of active attacks. In this paper, we\u0000propose and evaluate a detection scheme against active attacks in OtA\u0000computation systems. More explicitly, we consider an active attacker which is\u0000an external node sending random or misleading data to alter the aggregated data\u0000received by the server. To detect the presence of the attacker, in every\u0000communication period, legitimate users send some dummy samples in addition to\u0000the real data. We propose a detector design that relies on the existence of a\u0000shared secret only known by the legitimate users and the server, that can be\u0000used to hide the transmitted signal in a secret subspace. After the server\u0000projects the received vector back to the original subspace, the dummy samples\u0000can be used to detect active attacks. We show that this design achieves good\u0000detection performance for a small cost in terms of channel resources.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In-band full-duplex (IBFD) is a theoretically effective solution to increase the overall throughput for the future wireless communications system by enabling transmission and reception over the same time-frequency resources. However, reliable source reconstruction remains a great challenge in the practical IBFD systems due to the non-ideal elimination of the self-interference and the inherent limitations of the separate source and channel coding methods. On the other hand, artificial intelligence-enabled semantic communication can provide a viable direction for the optimization of the IBFD system. This article introduces a novel IBFD paradigm with the guidance of semantic communication called semantics-division duplexing (SDD). It utilizes semantic domain processing to further suppress self-interference, distinguish the expected semantic information, and recover the desired sources. Further integration of the digital and semantic domain processing can be implemented so as to achieve intelligent and concise communications. We present the advantages of the SDD paradigm with theoretical explanations and provide some visualized results to verify its effectiveness.
{"title":"Semantics-Division Duplexing: A Novel Full-Duplex Paradigm","authors":"Kai Niu, Zijian Liang, Chao Dong, Jincheng Dai, Zhongwei Si, Ping Zhang","doi":"arxiv-2312.08862","DOIUrl":"https://doi.org/arxiv-2312.08862","url":null,"abstract":"In-band full-duplex (IBFD) is a theoretically effective solution to increase\u0000the overall throughput for the future wireless communications system by\u0000enabling transmission and reception over the same time-frequency resources.\u0000However, reliable source reconstruction remains a great challenge in the\u0000practical IBFD systems due to the non-ideal elimination of the\u0000self-interference and the inherent limitations of the separate source and\u0000channel coding methods. On the other hand, artificial intelligence-enabled\u0000semantic communication can provide a viable direction for the optimization of\u0000the IBFD system. This article introduces a novel IBFD paradigm with the\u0000guidance of semantic communication called semantics-division duplexing (SDD).\u0000It utilizes semantic domain processing to further suppress self-interference,\u0000distinguish the expected semantic information, and recover the desired sources.\u0000Further integration of the digital and semantic domain processing can be\u0000implemented so as to achieve intelligent and concise communications. We present\u0000the advantages of the SDD paradigm with theoretical explanations and provide\u0000some visualized results to verify its effectiveness.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Quentin Gontier, Charles Wiame, Joe Wiart, François Horlin, Christo Tsigros, Claude Oestges, Philippe De Doncker
Existing studies analyzing electromagnetic field (EMF) exposure in wireless networks have primarily considered downlink (DL) communications. In the uplink (UL), the EMF exposure caused by the user's smartphone is usually the only considered source of radiation, thereby ignoring contributions caused by other active neighboring devices. In addition, the network coverage and EMF exposure are typically analyzed independently for both the UL and DL, while a joint analysis would be necessary to fully understand the network performance. This paper aims at bridging the resulting gaps by presenting a comprehensive stochastic geometry framework including the above aspects. The proposed topology features base stations (BS) modeled via a homogeneous Poisson point process as well as a user process of type II (with users uniformly distributed in the Voronoi cell of each BS). In addition to the UL to DL exposure ratio, we derive joint probability metrics considering the UL and DL coverage and EMF exposure. These metrics are evaluated in two scenarios considering BS and/or user densifications. Our numerical results highlight the existence of optimal node densities maximizing these joint probabilities.
现有的无线网络电磁场（EMF）暴露分析研究主要考虑的是下行链路（DL）通信。在上行链路（UL）中，用户的智能手机造成的电磁场暴露通常是唯一考虑的辐射源，从而忽略了其他邻近设备造成的辐射。此外，网络覆盖和电磁场辐射通常是对上行链路和下行链路进行独立分析，而要想全面了解网络性能，就必须进行联合分析。本文旨在通过提出一个包含上述方面的综合随机几何框架来弥补由此产生的差距。所提出的拓扑结构包括通过同质泊松点过程建模的基站（BS）以及 II 型用户过程（用户均匀分布在每个 BS 的 Voronoi 单元中）。除了 UL 与 DL 暴露比之外，我们还考虑了 UL 和 DL 覆盖范围以及 EMF 暴露的联合概率指标。在考虑到 BS 和/或用户密度的两种情况下对这些指标进行了评估。我们的数值结果表明，存在使这些联合概率最大化的最佳节点密度。
{"title":"On the Uplink and Downlink EMF Exposure and Coverage in Dense Cellular Networks: A Stochastic Geometry Approach","authors":"Quentin Gontier, Charles Wiame, Joe Wiart, François Horlin, Christo Tsigros, Claude Oestges, Philippe De Doncker","doi":"arxiv-2312.08978","DOIUrl":"https://doi.org/arxiv-2312.08978","url":null,"abstract":"Existing studies analyzing electromagnetic field (EMF) exposure in wireless\u0000networks have primarily considered downlink (DL) communications. In the uplink\u0000(UL), the EMF exposure caused by the user's smartphone is usually the only\u0000considered source of radiation, thereby ignoring contributions caused by other\u0000active neighboring devices. In addition, the network coverage and EMF exposure\u0000are typically analyzed independently for both the UL and DL, while a joint\u0000analysis would be necessary to fully understand the network performance. This\u0000paper aims at bridging the resulting gaps by presenting a comprehensive\u0000stochastic geometry framework including the above aspects. The proposed\u0000topology features base stations (BS) modeled via a homogeneous Poisson point\u0000process as well as a user process of type II (with users uniformly distributed\u0000in the Voronoi cell of each BS). In addition to the UL to DL exposure ratio, we\u0000derive joint probability metrics considering the UL and DL coverage and EMF\u0000exposure. These metrics are evaluated in two scenarios considering BS and/or\u0000user densifications. Our numerical results highlight the existence of optimal\u0000node densities maximizing these joint probabilities.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this article, we introduce LLMind, an innovative AI framework that utilizes large language models (LLMs) as a central orchestrator. The framework integrates LLMs with domain-specific AI modules, enabling IoT devices to collaborate effectively in executing complex tasks. The LLM performs planning and generates control scripts using a reliable and precise language-code transformation approach based on finite state machines (FSMs). The LLM engages in natural conversations with users, employing role-playing techniques to generate contextually appropriate responses. Additionally, users can interact easily with the AI agent via a user-friendly social media platform. The framework also incorporates semantic analysis and response optimization techniques to enhance speed and effectiveness. Ultimately, this framework is designed not only to innovate IoT device control and enrich user experiences but also to foster an intelligent and integrated IoT device ecosystem that evolves and becomes more sophisticated through continuing user and machine interactions.
{"title":"LLMind: Orchestrating AI and IoT with LLMs for Complex Task Execution","authors":"Hongwei Cui, Yuyang Du, Qun Yang, Yulin Shao, Soung Chang Liew","doi":"arxiv-2312.09007","DOIUrl":"https://doi.org/arxiv-2312.09007","url":null,"abstract":"In this article, we introduce LLMind, an innovative AI framework that\u0000utilizes large language models (LLMs) as a central orchestrator. The framework\u0000integrates LLMs with domain-specific AI modules, enabling IoT devices to\u0000collaborate effectively in executing complex tasks. The LLM performs planning\u0000and generates control scripts using a reliable and precise language-code\u0000transformation approach based on finite state machines (FSMs). The LLM engages\u0000in natural conversations with users, employing role-playing techniques to\u0000generate contextually appropriate responses. Additionally, users can interact\u0000easily with the AI agent via a user-friendly social media platform. The\u0000framework also incorporates semantic analysis and response optimization\u0000techniques to enhance speed and effectiveness. Ultimately, this framework is\u0000designed not only to innovate IoT device control and enrich user experiences\u0000but also to foster an intelligent and integrated IoT device ecosystem that\u0000evolves and becomes more sophisticated through continuing user and machine\u0000interactions.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For a prime $p$ and a positive integer $m$, let $mathbb{F}_{p^m}$ be the finite field of characteristic $p$, and $mathfrak{R}_l:=mathbb{F}_{p^m}[v]/langle v^l-vrangle$ be a non-chain ring. In this paper, we study the $(sigma,delta)$-cyclic codes over $mathfrak{R}_l$. Further, we study the application of these codes in finding DNA codes. Towards this, we first define a Gray map to find classical codes over $mathbb{F}_{p^m}$ using codes over the ring $mathfrak{R}_l$. Later, we find the conditions for a code to be reversible and a DNA code using $(sigma, delta)$-cyclic code. Finally, this algebraic method provides many classical and DNA codes of better parameters.
{"title":"Construction of $(σ,δ)$-cyclic codes over a non-chain ring and their applications in DNA codes","authors":"Ashutosh Singh, Priyanka Sharma, Om Prakash","doi":"arxiv-2312.08109","DOIUrl":"https://doi.org/arxiv-2312.08109","url":null,"abstract":"For a prime $p$ and a positive integer $m$, let $mathbb{F}_{p^m}$ be the\u0000finite field of characteristic $p$, and\u0000$mathfrak{R}_l:=mathbb{F}_{p^m}[v]/langle v^l-vrangle$ be a non-chain ring.\u0000In this paper, we study the $(sigma,delta)$-cyclic codes over\u0000$mathfrak{R}_l$. Further, we study the application of these codes in finding\u0000DNA codes. Towards this, we first define a Gray map to find classical codes\u0000over $mathbb{F}_{p^m}$ using codes over the ring $mathfrak{R}_l$. Later, we\u0000find the conditions for a code to be reversible and a DNA code using $(sigma,\u0000delta)$-cyclic code. Finally, this algebraic method provides many classical\u0000and DNA codes of better parameters.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138628077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of their duals. Recently, in order to study the duals of BCH codes and the lower bounds on their minimum distances, a new concept called dually-BCH code was proposed by authors in cite{GDL21}. In this paper, the lower bounds on the minimum distances of the duals of narrow-sense BCH codes with length $frac{q^m-1}{lambda}$ over $mathbb{F}_q$ are developed, where $lambda$ is a positive integer satisfying $lambda, |, q-1$, or $lambda=q^s-1$ and $s, |,m$. In addition, the sufficient and necessary conditions in terms of the designed distances for these codes being dually-BCH codes are presented. Many considered codes in cite{GDL21} and cite{Wang23} are the special cases of the codes showed in this paper. Our lower bounds on the minimum distances of the duals of BCH codes include the bounds stated in cite{GDL21} as a special case. Several examples show that the lower bounds are good in some cases.
{"title":"The duals of narrow-sense BCH codes with length $frac{q^m-1}λ$","authors":"Xiaoqiang Wang, Chengliang Xiao, Dabin Zheng","doi":"arxiv-2312.05474","DOIUrl":"https://doi.org/arxiv-2312.05474","url":null,"abstract":"BCH codes are an interesting class of cyclic codes due to their efficient\u0000encoding and decoding algorithms. In the past sixty years, a lot of progress on\u0000the study of BCH codes has been made, but little is known about the properties\u0000of their duals. Recently, in order to study the duals of BCH codes and the\u0000lower bounds on their minimum distances, a new concept called dually-BCH code\u0000was proposed by authors in cite{GDL21}. In this paper, the lower bounds on the\u0000minimum distances of the duals of narrow-sense BCH codes with length\u0000$frac{q^m-1}{lambda}$ over $mathbb{F}_q$ are developed, where $lambda$ is a\u0000positive integer satisfying $lambda, |, q-1$, or $lambda=q^s-1$ and $s,\u0000|,m$. In addition, the sufficient and necessary conditions in terms of the\u0000designed distances for these codes being dually-BCH codes are presented. Many\u0000considered codes in cite{GDL21} and cite{Wang23} are the special cases of the\u0000codes showed in this paper. Our lower bounds on the minimum distances of the duals of BCH codes include\u0000the bounds stated in cite{GDL21} as a special case. Several examples show that\u0000the lower bounds are good in some cases.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138576147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zixiang Ren, Jie Xu, Ling Qiu, Derrick Wing Kwan Ng
This paper studies a secure cell-free integrated sensing and communication (ISAC) system, in which multiple ISAC transmitters collaboratively send confidential information to multiple communication users (CUs) and concurrently conduct target detection. Different from prior works investigating communication security against potential information eavesdropping, we consider the security of both communication and sensing in the presence of both information and sensing eavesdroppers that aim to intercept confidential communication information and extract target information, respectively. Towards this end, we optimize the joint information and sensing transmit beamforming at these ISAC transmitters for secure cell-free ISAC. Our objective is to maximize the detection probability over a designated sensing area while ensuring the minimum signal-to-interference-plus-noise-ratio (SINR) requirements at CUs. Our formulation also takes into account the maximum tolerable signal-to-noise ratio (SNR) at information eavesdroppers for ensuring the confidentiality of information transmission, and the maximum detection probability constraints at sensing eavesdroppers for preserving sensing privacy. The formulated secure joint transmit beamforming problem is highly non-convex due to the intricate interplay between the detection probabilities, beamforming vectors, and SINR constraints. Fortunately, through strategic manipulation and via applying the semidefinite relaxation (SDR) technique, we successfully obtain the globally optimal solution to the design problem by rigorously verifying the tightness of SDR. Furthermore, we present two alternative joint beamforming designs based on the sensing SNR maximization over the specific sensing area and the coordinated beamforming, respectively. Numerical results reveal the benefits of our proposed design over these alternative benchmarks.
本文研究了一种安全的无蜂窝综合传感与通信（ISAC）系统，在该系统中，多个 ISAC 发射器协同向多个通信用户（CU）发送机密信息，并同时进行目标检测。与之前研究针对潜在信息窃听的通信安全的工作不同，我们考虑的是在同时存在信息窃听者和传感窃听者的情况下通信和传感的安全性，窃听者的目的分别是截获机密通信信息和提取目标信息。为此，我们优化了这些 ISAC 发射机上的联合信息和传感发射波束成形，以实现安全的无小区 ISAC。我们的目标是最大限度地提高指定感知区域内的探测概率，同时确保 CU 的信噪比（SINR）要求最小。我们的方案还考虑了信息窃听者可容忍的最大信噪比（SNR），以确保信息传输的保密性，以及传感窃听者的最大检测概率限制，以保护传感隐私。由于检测概率、波束成形向量和信噪比约束之间错综复杂的相互作用，所提出的安全联合发射波束成形问题是高度非凸的。幸运的是，通过策略操作和应用半无限松弛（SDR）技术，我们成功地获得了设计问题的全局最优解，严格验证了 SDR 的严密性。此外，我们还提出了两种可供选择的联合波束成形设计，分别基于特定传感区域的传感信噪比最大化和协调波束成形。数值结果表明，我们提出的设计优于这些替代基准。
{"title":"Secure Cell-Free Integrated Sensing and Communication in the Presence of Information and Sensing Eavesdroppers","authors":"Zixiang Ren, Jie Xu, Ling Qiu, Derrick Wing Kwan Ng","doi":"arxiv-2312.04355","DOIUrl":"https://doi.org/arxiv-2312.04355","url":null,"abstract":"This paper studies a secure cell-free integrated sensing and communication\u0000(ISAC) system, in which multiple ISAC transmitters collaboratively send\u0000confidential information to multiple communication users (CUs) and concurrently\u0000conduct target detection. Different from prior works investigating\u0000communication security against potential information eavesdropping, we consider\u0000the security of both communication and sensing in the presence of both\u0000information and sensing eavesdroppers that aim to intercept confidential\u0000communication information and extract target information, respectively. Towards\u0000this end, we optimize the joint information and sensing transmit beamforming at\u0000these ISAC transmitters for secure cell-free ISAC. Our objective is to maximize\u0000the detection probability over a designated sensing area while ensuring the\u0000minimum signal-to-interference-plus-noise-ratio (SINR) requirements at CUs. Our\u0000formulation also takes into account the maximum tolerable signal-to-noise ratio\u0000(SNR) at information eavesdroppers for ensuring the confidentiality of\u0000information transmission, and the maximum detection probability constraints at\u0000sensing eavesdroppers for preserving sensing privacy. The formulated secure\u0000joint transmit beamforming problem is highly non-convex due to the intricate\u0000interplay between the detection probabilities, beamforming vectors, and SINR\u0000constraints. Fortunately, through strategic manipulation and via applying the\u0000semidefinite relaxation (SDR) technique, we successfully obtain the globally\u0000optimal solution to the design problem by rigorously verifying the tightness of\u0000SDR. Furthermore, we present two alternative joint beamforming designs based on\u0000the sensing SNR maximization over the specific sensing area and the coordinated\u0000beamforming, respectively. Numerical results reveal the benefits of our\u0000proposed design over these alternative benchmarks.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138554059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fuchao He, Zheng Shi, Guanghua Yang, Xiaofan Li, Xinrong Ye, Shaodan Ma
This paper introduces hybrid automatic repeat request with incremental redundancy (HARQ-IR) to boost the reliability of short packet communications. The finite blocklength information theory and correlated decoding events tremendously preclude the analysis of average block error rate (BLER). Fortunately, the recursive form of average BLER motivates us to calculate its value through the trapezoidal approximation and Gauss-Laguerre quadrature. Moreover, the asymptotic analysis is performed to derive a simple expression for the average BLER at high signal-to-noise ratio (SNR). Then, we study the maximization of long term average throughput (LTAT) via power allocation meanwhile ensuring the power and the BLER constraints. For tractability, the asymptotic BLER is employed to solve the problem through geometric programming (GP). However, the GP-based solution underestimates the LTAT at low SNR due to a large approximation error in this case. Alternatively, we also develop a deep reinforcement learning (DRL)-based framework to learn power allocation policy. In particular, the optimization problem is transformed into a constrained Markov decision process, which is solved by integrating deep deterministic policy gradient (DDPG) with subgradient method. The numerical results finally demonstrate that the DRL-based method outperforms the GP-based one at low SNR, albeit at the cost of increasing computational burden.
有限块长信息论和相关解码事件极大地阻碍了对平均块误码率（BLER）的分析。幸运的是，平均误码率的递归形式促使我们通过梯形近似和高斯-拉盖尔正交来计算其值。此外，我们还进行了渐近分析，得出了高信噪比（SNR）下平均误码率的简单表达式。然后，我们研究了通过功率分配最大化长期平均吞吐量（LTAT），同时确保功率和 BLER 约束。为了提高可操作性，我们采用了渐近 BLER，通过几何编程（GP）来解决这个问题。然而，由于这种情况下的近似误差较大，基于 GP 的解决方案在低信噪比时会低估 LTAT。另外，我们还开发了一种基于深度强化学习（DRL）的框架来学习功率分配策略，特别是将优化问题转化为受约束马尔可夫决策过程，并通过将深度确定性策略梯度（DDPG）与子梯度法相结合来解决该问题。数值结果最终证明，在低信噪比条件下，基于 DRL 的方法优于基于 GP 的方法，尽管代价是增加了计算负担。
{"title":"HARQ-IR Aided Short Packet Communications: BLER Analysis and Throughput Maximization","authors":"Fuchao He, Zheng Shi, Guanghua Yang, Xiaofan Li, Xinrong Ye, Shaodan Ma","doi":"arxiv-2312.04377","DOIUrl":"https://doi.org/arxiv-2312.04377","url":null,"abstract":"This paper introduces hybrid automatic repeat request with incremental\u0000redundancy (HARQ-IR) to boost the reliability of short packet communications.\u0000The finite blocklength information theory and correlated decoding events\u0000tremendously preclude the analysis of average block error rate (BLER).\u0000Fortunately, the recursive form of average BLER motivates us to calculate its\u0000value through the trapezoidal approximation and Gauss-Laguerre quadrature.\u0000Moreover, the asymptotic analysis is performed to derive a simple expression\u0000for the average BLER at high signal-to-noise ratio (SNR). Then, we study the\u0000maximization of long term average throughput (LTAT) via power allocation\u0000meanwhile ensuring the power and the BLER constraints. For tractability, the\u0000asymptotic BLER is employed to solve the problem through geometric programming\u0000(GP). However, the GP-based solution underestimates the LTAT at low SNR due to\u0000a large approximation error in this case. Alternatively, we also develop a deep\u0000reinforcement learning (DRL)-based framework to learn power allocation policy.\u0000In particular, the optimization problem is transformed into a constrained\u0000Markov decision process, which is solved by integrating deep deterministic\u0000policy gradient (DDPG) with subgradient method. The numerical results finally\u0000demonstrate that the DRL-based method outperforms the GP-based one at low SNR,\u0000albeit at the cost of increasing computational burden.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138553805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider a distributed coding for computing problem with constant decoding locality, i.e. with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed bits. We establish an achievable rate region by designing an efficient coding scheme. The scheme reduces the required rate by introducing auxiliary random variables and supports local decoding at the same time. Then we show the rate region is optimal under mild regularity conditions on source distributions. A coding for computing problem with side information is analogously studied. These results indicate that more rate has to be taken in order to achieve lower coding complexity in distributed computing settings. Moreover, useful graph characterizations are developed to simplify the computation of the achievable rate region.
{"title":"Distributed Approximate Computing with Constant Locality","authors":"Deheng Yuan, Tao Guo, Zhongyi Huang, Shi Jin","doi":"arxiv-2312.04141","DOIUrl":"https://doi.org/arxiv-2312.04141","url":null,"abstract":"We consider a distributed coding for computing problem with constant decoding\u0000locality, i.e. with a vanishing error probability, any single sample of the\u0000function can be approximately recovered by probing only constant number of\u0000compressed bits. We establish an achievable rate region by designing an\u0000efficient coding scheme. The scheme reduces the required rate by introducing\u0000auxiliary random variables and supports local decoding at the same time. Then\u0000we show the rate region is optimal under mild regularity conditions on source\u0000distributions. A coding for computing problem with side information is\u0000analogously studied. These results indicate that more rate has to be taken in\u0000order to achieve lower coding complexity in distributed computing settings.\u0000Moreover, useful graph characterizations are developed to simplify the\u0000computation of the achievable rate region.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"52 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138553763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：