Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2306.04906v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2306.04906v1 (cs)
[Submitted on 8 Jun 2023 ]

Title: Spectrum Sharing between High Altitude Platform Network and Terrestrial Network: Modeling and Performance Analysis

Title: 高空平台网络与地面网络之间的频谱共享:建模与性能分析

Authors:Zhiqing Wei, Lin Wang, Zhan Gao, Huici Wu, Ning Zhang, Kaifeng Han, Zhiyong Feng
Abstract: Achieving seamless global coverage is one of the ultimate goals of space-air-ground integrated network, as a part of which High Altitude Platform (HAP) network can provide wide-area coverage. However, deploying a large number of HAPs will lead to severe congestion of existing frequency bands. Spectrum sharing improves spectrum utilization. The coverage performance improvement and interference caused by spectrum sharing need to be investigated. To this end, this paper analyzes the performance of spectrum sharing between HAP network and terrestrial network. We firstly generalize the Poisson Point Process (PPP) to curves, surfaces and manifolds to model the distribution of terrestrial Base Stations (BSs) and HAPs. Then, the closed-form expressions for coverage probability of HAP network and terrestrial network are derived based on differential geometry and stochastic geometry. We verify the accuracy of closed-form expressions by Monte Carlo simulation. The results show that HAP network has less interference to terrestrial network. Low height and suitable deployment density can improve the coverage probability and transmission capacity of HAP network.
Abstract: 实现无缝的全球覆盖是空天地一体化网络的终极目标之一,其中高空平台(HAP)网络可以提供广域覆盖。 然而,部署大量HAP会导致现有频段严重拥塞。 频谱共享可以提高频谱利用率。 需要研究频谱共享带来的覆盖性能提升和干扰问题。 为此,本文分析了HAP网络与地面网络之间的频谱共享性能。 我们首先将泊松点过程(PPP)推广到曲线、曲面和流形,以建模地面基站(BS)和HAP的分布。 然后,基于微分几何和随机几何推导了HAP网络和地面网络的覆盖率闭合表达式。 我们通过蒙特卡洛仿真验证了闭合表达式的准确性。 结果表明,HAP网络对地面网络的干扰较小。 低高度和合适的部署密度可以提高HAP网络的覆盖率和传输能力。
Subjects: Information Theory (cs.IT) ; Robotics (cs.RO)
Cite as: arXiv:2306.04906 [cs.IT]
  (or arXiv:2306.04906v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2306.04906
arXiv-issued DOI via DataCite

Submission history

From: Zhiqing Wei [view email]
[v1] Thu, 8 Jun 2023 03:20:30 UTC (3,263 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2023-06
Change to browse by:
cs
cs.RO
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号