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

推荐订阅源

Y
Y Combinator Blog
V
V2EX
Jina AI
Jina AI
爱范儿
爱范儿
M
MIT News - Artificial intelligence
量子位
L
LangChain Blog
Google DeepMind News
Google DeepMind News
酷 壳 – CoolShell
酷 壳 – CoolShell
罗磊的独立博客
腾讯CDC
MongoDB | Blog
MongoDB | Blog
P
Proofpoint News Feed
宝玉的分享
宝玉的分享
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Last Week in AI
Last Week in AI
H
Hackread – Cybersecurity News, Data Breaches, AI and More
F
Fortinet All Blogs
The GitHub Blog
The GitHub Blog
Engineering at Meta
Engineering at Meta
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Vercel News
Vercel News
T
The Blog of Author Tim Ferriss

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
Coverage and Rate Analysis of Downlink Cellular Vehicle-t...
Vishnu Vardhan Chetlur, Harpreet S. Dhillon · 2019-01-26 · via cs.IT updates on arXiv.org

In this paper, we present the downlink coverage and rate analysis of a cellular vehicle-to-everything (C-V2X) communication network where the locations of vehicular nodes and road side units (RSUs) are modeled as Cox processes driven by a Poisson line process (PLP) and the locations of cellular macro base stations (MBSs) are modeled as a 2D Poisson point process (PPP). Assuming a fixed selection bias and maximum average received power based association, we compute the probability with which a {\em typical receiver}, an arbitrarily chosen receiving node, connects to a vehicular node or an RSU and a cellular MBS. For this setup, we derive the signal-to-interference ratio (SIR)-based coverage probability of the typical receiver. One of the key challenges in the computation of coverage probability stems from the inclusion of shadowing effects. As the standard procedure of interpreting the shadowing effects as random displacement of the location of nodes is not directly applicable to the Cox process, we propose an approximation of the spatial model inspired by the asymptotic behavior of the Cox process. Using this asymptotic characterization, we derive the coverage probability in terms of the Laplace transform of interference power distribution. Further, we compute the downlink rate coverage of the typical receiver by characterizing the load on the serving vehicular nodes or RSUs and serving MBSs. We also provide several key design insights by studying the trends in the coverage probability and rate coverage as a function of network parameters. We observe that the improvement in rate coverage obtained by increasing the density of MBSs can be equivalently achieved by tuning the selection bias appropriately without the need to deploy additional MBSs.