IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v88y2025i3d10.1007_s11235-025-01327-6.html
   My bibliography  Save this article

Maximising Data Rate in HAP Assisted Cooperative Vehicular Networks with Optimised Relay Selection

Author

Listed:
  • Kayode Popoola

    (Dyson Institute of Engineering)

  • David Grace

    (Engineering and Technology)

  • Tim Clarke

    (Engineering and Technology)

  • Muheeb Ahmed

    (Dyson Institute of Engineering)

  • Stuart Nicholson

    (Dyson Institute of Engineering)

Abstract

In this paper, we address the challenge of improving network performance in High-Altitude Platform-assisted cooperative vehicular networking (HAP-CVN) through optimised relay selection. We propose the Kuhn-Munkres Relay Assignment (KMRA) algorithm, an approach based on a weighted bipartite matching framework. Our primary objective is to maximise sum transmission rates for vehicle user equipment (VUE) experiencing out-of-coverage or cell-edge channel conditions, which in turn significantly minimises their outage probability. By formulating the relay selection as a maximum weighted bipartite matching problem, our approach optimally pairs relays to destinations, outperforming conventional benchmark schemes. The proposed KMRA algorithm delivers significant performance improvements, particularly in terms of reduced outage probability, enhanced transmission success probability, and increased user throughput.

Suggested Citation

  • Kayode Popoola & David Grace & Tim Clarke & Muheeb Ahmed & Stuart Nicholson, 2025. "Maximising Data Rate in HAP Assisted Cooperative Vehicular Networks with Optimised Relay Selection," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 88(3), pages 1-15, September.
    • Handle: RePEc:spr:telsys:v:88:y:2025:i:3:d:10.1007_s11235-025-01327-6
    DOI: 10.1007/s11235-025-01327-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-025-01327-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-025-01327-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:88:y:2025:i:3:d:10.1007_s11235-025-01327-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.