Shortest Path Lengths in Poisson Line Cox Processes: Approximations and Applications
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917847804936192 |
|---|---|
| author | Ghatak, Gourab Jhawar, Sanjoy Kumar Haenggi, Martin |
| author_facet | Ghatak, Gourab Jhawar, Sanjoy Kumar Haenggi, Martin |
| contents | We derive exact expressions for the shortest path length to a point of a Poisson line Cox process (PLCP) from the typical point of the PLCP and from the typical intersection of the underlying Poisson line process (PLP), restricted to a single turn. For the two turns case, we derive a bound on the shortest path length from the typical point and demonstrate conditions under which the bound is tight. We also highlight the line process and point process densities for which the shortest path from the typical intersection under the one turn restriction may be shorter than the shortest path from the typical point under the two turns restriction. Finally, we discuss two applications where our results can be employed for a statistical characterization of system performance: in a re-configurable intelligent surface (RIS) enabled vehicle-to-vehicle (V2V) communication system and in electric vehicle charging point deployment planning in urban streets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_16441 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Shortest Path Lengths in Poisson Line Cox Processes: Approximations and Applications Ghatak, Gourab Jhawar, Sanjoy Kumar Haenggi, Martin Information Theory Applications We derive exact expressions for the shortest path length to a point of a Poisson line Cox process (PLCP) from the typical point of the PLCP and from the typical intersection of the underlying Poisson line process (PLP), restricted to a single turn. For the two turns case, we derive a bound on the shortest path length from the typical point and demonstrate conditions under which the bound is tight. We also highlight the line process and point process densities for which the shortest path from the typical intersection under the one turn restriction may be shorter than the shortest path from the typical point under the two turns restriction. Finally, we discuss two applications where our results can be employed for a statistical characterization of system performance: in a re-configurable intelligent surface (RIS) enabled vehicle-to-vehicle (V2V) communication system and in electric vehicle charging point deployment planning in urban streets. |
| title | Shortest Path Lengths in Poisson Line Cox Processes: Approximations and Applications |
| topic | Information Theory Applications |
| url | https://arxiv.org/abs/2411.16441 |