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

推荐订阅源

罗磊的独立博客
大猫的无限游戏
大猫的无限游戏
WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
MongoDB | Blog
MongoDB | Blog
爱范儿
爱范儿
小众软件
小众软件
MyScale Blog
MyScale Blog
美团技术团队
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
S
SegmentFault 最新的问题
G
Google Developers Blog
Stack Overflow Blog
Stack Overflow Blog
V
V2EX
量子位
云风的 BLOG
云风的 BLOG
A
About on SuperTechFans
阮一峰的网络日志
阮一峰的网络日志
Last Week in AI
Last Week in AI
Martin Fowler
Martin Fowler
C
Check Point Blog
月光博客
月光博客

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
D2D Multicast in Underlay Cellular Networks with Exclusio...
Ajay Bhardwaj, Samar Agnihotri · 2019-05-01 · via cs.IT updates on arXiv.org

Underlay device-to-device (D2D) multicast communication has potential to improve performance of cellular networks. However, co-channel interference among cellular users (CUs) and D2D multicast groups (MGs) limits the gains of such communication. Allowing the CUs to have exclusion zones around them where no receiver of any MG can exist, is a realistic and pragmatic approach to reduce the co-channel interference of cellular transmission on D2D multicast reception. We use a stochastic geometry based approach to model this scenario. Specifically, we model the locations of CUs and D2D MG receivers with homogeneous Poisson Point Process (PPP), and Poisson Hole Process (PHP), respectively. We formulate the network sum throughput maximization problem in terms of a joint MG channel and power allocation problem with constraints on cellular and MG users maximum transmit and acceptable quality of service. We establish that the MG channel allocation problem has computational complexity that is exponential in both, the number of MGs and the number of available cellular channels. Then, we decompose this problem into two subproblems: subset selection problem and subset channel assignment problem. Based on observations and insights obtained from numerical analysis of the optimal solution of the subset selection problem in wide variety of scenarios, we propose a computationally efficient scheme that achieves almost optimal performance for the subset selection problem. We further provide a computationally efficient algorithm that achieves almost optimal performance for the subset channel assignment problem. Finally, combining these two schemes, we provide a computationally efficient and almost optimal scheme to solve the channel allocation problem, and various results and insights on the variation of the optimal system performance with respect to different system parameters