avino2026multilink
Abstract
Maintaining reliable Vehicle-to-Satellite (V2S) connectivity for critical mobile services is a significant challenge for Low Earth Orbit (LEO) satellite constellations due to high orbital velocities and frequent radio obstructions in urban environments. Spatial diversity through multi-link connectivity – the use of multiple simultaneous satellite links – can mitigate these shadowing effects, but introduces a potential increase in signaling overhead via frequent Handovers (HOs). This paper investigates this fundamental trade-off by evaluating three HO mechanisms. Leveraging a high-fdielity simulation framework that integrates orbital dynamics, vehicle mobility, and urban geometry, we analyze the impact of using up to three parallel links on the satellite link availability and HO frequency. Our results demonstrate that while multi-connectivity effectively mitigates obstacle blockage, the magnitude of the reliability gains and the associated signaling costs are strictly dependent on the HO logic. These findings establish a baseline for future works, including more detailed channel models and real-world scenarios.
Quick access
Contact
- Giuseppe Avino
- Mario Franke
- Enric Pardo
- Christoph Sommer
- Ion Turcanu
BibTeX reference
@inproceedings{avino2026multilink,
author = {Avino, Giuseppe and Franke, Mario and Pardo, Enric and Sommer, Christoph and Turcanu, Ion},
title = {{Multi-Link Connectivity for Vehicle-to-Satellite Communications Under Obstacle Blockage}},
booktitle = {17th IEEE Vehicular Networking Conference (VNC 2026)},
address = {Montr{\'{e}}al, Canada},
month = {June},
note = {to appear},
publisher = {IEEE},
year = {2026},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.