IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2022i1p26-d1010204.html
   My bibliography  Save this article

Coverage, Rate, and Last Hop Selection in Multi-Hop Communications in Highway Scenarios

Author

Listed:
  • Vitalii Beschastnyi

    (Applied Probability and Informatics Department, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia)

  • Egor Machnev

    (Applied Probability and Informatics Department, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia)

  • Darya Ostrikova

    (Applied Probability and Informatics Department, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia)

  • Yuliya Gaidamaka

    (Applied Probability and Informatics Department, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia
    Federal Research Center “Computer Science and Control” of Russian Academy of Sciences, 119333 Moscow, Russia)

  • Konstantin Samouylov

    (Applied Probability and Informatics Department, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia
    Federal Research Center “Computer Science and Control” of Russian Academy of Sciences, 119333 Moscow, Russia)

Abstract

The recent 3GPP initiative to extend IAB technology to mobile nodes in recently stated Release 18 opens up new opportunities for services operators in highway scenarios, where the extreme density of base stations (BS) is required to deliver uninterrupted coverage. The latter problem is specifically important for millimeter wave (mmWave) and future sub-terahertz (sub-THz) deployments. However, in such systems, there are inherent trade-offs between the rate provided over the multi-hop chain, the so-called “bridge”, and the inter-site distance. One of the critical factors involved in this trade-off is the choice of the last hop. In this paper, we utilize realistic channel measurements at 300 GHz to develop a framework characterizing the above-mentioned trade-off. Then, we proceed proposing a simple technique to maximize the latter by addressing the “last-hop problem” and compare its performance to the set of alternative solutions. Our numerical results illustrate that bumper location is better in terms of relaying communication distance. Furthermore, the proposed last hop selection strategies allow for extreme performance gains in terms of data rate as compared to the traditional approaches reaching 100 % for large ISD and 400–500% for small ISDs. In absolute numbers, the proposed relying with the last hop selection strategy allows for reducing the required BS density along the highways by 15–30% depending on the vehicle density and required level of connectivity.

Suggested Citation

  • Vitalii Beschastnyi & Egor Machnev & Darya Ostrikova & Yuliya Gaidamaka & Konstantin Samouylov, 2022. "Coverage, Rate, and Last Hop Selection in Multi-Hop Communications in Highway Scenarios," Mathematics, MDPI, vol. 11(1), pages 1-19, December.
  • Handle: RePEc:gam:jmathe:v:11:y:2022:i:1:p:26-:d:1010204
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/1/26/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/1/26/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. George S. Fishman & L. Stephen Yarberry, 1997. "An Implementation of the Batch Means Method," INFORMS Journal on Computing, INFORMS, vol. 9(3), pages 296-310, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lada, Emily K. & Wilson, James R., 2006. "A wavelet-based spectral procedure for steady-state simulation analysis," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1769-1801, November.
    2. Ali Tafazzoli & James R. Wilson & Emily K. Lada & Natalie M. Steiger, 2011. "Performance of Skart: A Skewness- and Autoregression-Adjusted Batch Means Procedure for Simulation Analysis," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 297-314, May.
    3. Christos Alexopoulos & David Goldsman & Gamze Tokol, 2001. "Properties of Batched Quadratic-Form Variance Parameter Estimators for Simulations," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 149-156, May.
    4. Song, Wheyming T. & Chih, Mingchang, 2010. "Extended dynamic partial-overlapping batch means estimators for steady-state simulations," European Journal of Operational Research, Elsevier, vol. 203(3), pages 640-651, June.
    5. Song, Wheyming Tina & Chih, Mingchang, 2013. "Run length not required: Optimal-mse dynamic batch means estimators for steady-state simulations," European Journal of Operational Research, Elsevier, vol. 229(1), pages 114-123.
    6. David Goldsman & Seong-Hee Kim & William S. Marshall & Barry L. Nelson, 2002. "Ranking and Selection for Steady-State Simulation: Procedures and Perspectives," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 2-19, February.
    7. Natalie M. Steiger & James R. Wilson, 2002. "An Improved Batch Means Procedure for Simulation Output Analysis," Management Science, INFORMS, vol. 48(12), pages 1569-1586, December.
    8. Park, Dae S. & Kim, Yun B. & Shin, Key I. & Willemain, Thomas R., 2001. "Simulation output analysis using the threshold bootstrap," European Journal of Operational Research, Elsevier, vol. 134(1), pages 17-28, October.
    9. Alex F. Mills & Jonathan E. Helm & Yu Wang, 2021. "Surge Capacity Deployment in Hospitals: Effectiveness of Response and Mitigation Strategies," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 367-387, March.

    More about this item

    Keywords

    IAB; V2X; 6G sub-terahertz; relay; blockage;
    All these keywords.

    JEL classification:

    Statistics

    Access and download statistics

    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:gam:jmathe:v:11:y:2022:i:1:p:26-:d:1010204. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.