ISAC Network Planning: Sensing Coverage Analysis and 3-D BS Deployment Optimization
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918259959267328 |
|---|---|
| author | Meng, Kaitao Han, Kawon Masouros, Christos Hanzo, Lajos |
| author_facet | Meng, Kaitao Han, Kawon Masouros, Christos Hanzo, Lajos |
| contents | Integrated sensing and communication (ISAC) networks strive to deliver both high-precision target localization and high-throughput data services across the entire coverage area. In this work, we examine the fundamental trade-off between sensing and communication from the perspective of base station (BS) deployment. Furthermore, we conceive a design that simultaneously maximizes the target localization coverage, while guaranteeing the desired communication performance. In contrast to existing schemes optimized for a single target, an effective network-level approach has to ensure consistent localization accuracy throughout the entire service area. While employing time-of-flight (ToF) based localization, we first analyze the deployment problem from a localization-performance coverage perspective, aiming for minimizing the area Cramer-Rao Lower Bound (A-CRLB) to ensure uniformly high positioning accuracy across the service area. We prove that for a fixed number of BSs, uniformly scaling the service area by a factor κincreases the optimal A-CRLB in proportion to κ^{2β}, where βis the BS-to-target pathloss exponent. Based on this, we derive an approximate scaling law that links the achievable A-CRLB across the area of interest to the dimensionality of the sensing area. We also show that cooperative BSs extend the coverage but yield marginal A-CRLB improvement as the dimensionality of the sensing area grows. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_18009 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | ISAC Network Planning: Sensing Coverage Analysis and 3-D BS Deployment Optimization Meng, Kaitao Han, Kawon Masouros, Christos Hanzo, Lajos Signal Processing Information Theory Integrated sensing and communication (ISAC) networks strive to deliver both high-precision target localization and high-throughput data services across the entire coverage area. In this work, we examine the fundamental trade-off between sensing and communication from the perspective of base station (BS) deployment. Furthermore, we conceive a design that simultaneously maximizes the target localization coverage, while guaranteeing the desired communication performance. In contrast to existing schemes optimized for a single target, an effective network-level approach has to ensure consistent localization accuracy throughout the entire service area. While employing time-of-flight (ToF) based localization, we first analyze the deployment problem from a localization-performance coverage perspective, aiming for minimizing the area Cramer-Rao Lower Bound (A-CRLB) to ensure uniformly high positioning accuracy across the service area. We prove that for a fixed number of BSs, uniformly scaling the service area by a factor κincreases the optimal A-CRLB in proportion to κ^{2β}, where βis the BS-to-target pathloss exponent. Based on this, we derive an approximate scaling law that links the achievable A-CRLB across the area of interest to the dimensionality of the sensing area. We also show that cooperative BSs extend the coverage but yield marginal A-CRLB improvement as the dimensionality of the sensing area grows. |
| title | ISAC Network Planning: Sensing Coverage Analysis and 3-D BS Deployment Optimization |
| topic | Signal Processing Information Theory |
| url | https://arxiv.org/abs/2506.18009 |