hardes2023airbone
Abstract
We study the suitability of Unmanned Aerial Vehicles (UAVs) as purely opportunistic airborne virtual network infrastructure to support urban wireless networks, specifically in two Vehicle-to-Everything (V2X) use cases: First, UAVs being used as relays for cooperative awareness applications; second, UAVs being used to coordinate channel access for platooning in urban areas. We do not require that these UAVs alter trajectory nor speed from those of their random, unrelated primary missions, so that these additional tasks can be executed with close-to-zero impact on the execution of their primary missions. Based on extensive computer simulations we show that, within a wide band of acceptable speeds, flight routes (up to a standard deviation of 300 m from the optimum) as well as altitudes, opportunistic relaying of transmissions via UAVs can yield a benefit to system performance that is on the same order of magnitude as that of optimally deployed UAVs. We further show that an opportunistic channel access control can reduce the total number of packet collisions by approx. 86 % compared to a scenario without any UAVs. Moreover, much of the reduction in impact due to suboptimal missions can be recovered simply by moderately increasing the number of UAVs.
Quick access
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
BibTeX reference
@article{hardes2023airbone,
author = {Hardes, Tobias and Sommer, Christoph},
title = {{Opportunistic Airborne Virtual Network Infrastructure for Urban Wireless Networks}},
journal = {Elsevier Computer Communications},
doi = {10.1016/j.comcom.2023.06.003},
issn = {0140-3664},
month = {August},
publisher = {Elsevier},
volume = {208},
year = {2023},
}
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.