惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Jina AI
Jina AI
Apple Machine Learning Research
Apple Machine Learning Research
宝玉的分享
宝玉的分享
M
MIT News - Artificial intelligence
S
SegmentFault 最新的问题
博客园 - 叶小钗
量子位
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - Franky
博客园 - 司徒正美
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
人人都是产品经理
人人都是产品经理
Hugging Face - Blog
Hugging Face - Blog
V
Visual Studio Blog
阮一峰的网络日志
阮一峰的网络日志
博客园 - 【当耐特】
Google DeepMind News
Google DeepMind News
L
LangChain Blog
Stack Overflow Blog
Stack Overflow Blog
博客园_首页
U
Unit 42
月光博客
月光博客
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Secure Users Oriented Downlink MISO NOMA
Hui-Ming Wang, Xu Zhang, Qian Yang, Theodoros A. Tsiftsis · 2019-03-01 · via cs.IT updates on arXiv.org

This paper proposes a secure users oriented multiple-input and single-output (MISO) non-orthogonal multiple access (NOMA) downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming (ZFBF) to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate (MSR) and sum secrecy rate (SSR) of all SUs, respectively, subject to the secrecy outage probability (SOP) constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization (MO)-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate (MMSR) and max-sum secrecy rate (MSSR) problems, respectively. As for the upper bound case, an alternative optimization (AO)-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access (OMA) one is verified by numerical results.