A Game Theory Based Efficient Computation Offloading in an UAV Network
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Recently, solutions based on mobile edge computing paradigm have been widely discussed in academia and industry. This paradigm offers solutions to address limitations, in terms of battery lifetime and processing power, of mobile and constrained devices. Despite the ever-increasing capabilities of these devices, resource requirements of applications can often transcend what is available within a single device. Offloading intensive computation tasks to a distant server can help applications reach their desired performances. In this work, we tackle the problem of offloading heavy computation tasks of unmanned aerial vehicles (UAVs) while achieving the best possible tradeoff between energy consumption, time delay, and computation cost. We focus on a scenario of a fleet of small UAVs performing an exploration mission. During their mission, these constrained devices have to carry-out highly intensive computation tasks such as pattern recognition and video preprocessing. We formulate the problem using a non-cooperative theoretical game with N players and three pure strategies. We provide a comprehensive proof for the existence of a Nash equilibrium and implement accordingly a distributed algorithm that converges to such an equilibrium. Extensive simulations are performed in order to provide thorough results and assess the performances of the approach compared to three other models. Results show that our algorithm outperforms all the three approaches. Our approach achieved in average about 19%, 58%, and 55% better results compared to local computing, offloading to the edge server, and offloading to base station, respectively.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Efficient multi-user computation offloading for mobile-edge cloud computing
Chen, X., Jiao, L., Li, W., & Fu, X. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2487344 · Cited by 2,675
MAUI: making smartphones last longer with code offload
Cuervo, E., Balasubramanian, A., Cho, D.-K., Wolman, A., Saroiu, S., Chandra, R., & Bahl, P. (2010) · Proceedings of the 8th international conference on Mobile systems, applications, and services · doi:10.1145/1814433.1814441 · Cited by 2,281
Space-Air-Ground Integrated Network: A Survey
Liu, J., Shi, Y., Fadlullah, Z. M., & Kato, N. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841996 · Cited by 1,281
A survey on mobile edge computing
Ahmed, A., & Ahmed, E. (2016) · 2016 10th International Conference on Intelligent Systems and Control (ISCO) · doi:10.1109/isco.2016.7727082 · Cited by 598
Resource efficient mobile computing using cloudlet infrastructure
Jararweh, Y., Tawalbeh, L., Ababneh, F., & Dosari, F. (2013) · 2013 IEEE 9th International Conference on Mobile Ad-hoc and Sensor Networks · doi:10.1109/msn.2013.75 · Cited by 132 · cited 2×
“Similar algorithms have been proposed for cloudlet-based [16] and mobile cloud computing [23], [24].”
Method
Cited by
Evolution of Non-Terrestrial Networks From 5G to 6G: A Survey
Azari, M. M., Solanki, S., Chatzinotas, S., Kodheli, O., Sallouha, H., Colpaert, A., Mendoza Montoya, J. F., Pollin, S., Haqiqatnejad, A., Mostaani, A., et al. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3199901 · Cited by 668
Wu, H., Zhang, Z., Guan, C., Wolter, K., & Xu, M. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2996784 · Cited by 260
An intelligent task offloading algorithm (iTOA) for UAV edge computing network
Chen, J., Chen, S., Luo, S., Wang, Q., Cao, B., & Li, X. (2020) · Digital Communications and Networks · doi:10.1016/j.dcan.2020.04.008 · Cited by 73
Candal‐Ventureira, D., González‐Castaño, F. J., Gil‐Castiñeira, F., & Fondo‐Ferreiro, P. (2023) · Software: Practice and Experience · doi:10.1002/spe.3161 · Cited by 7
Metadata
- Authors
- Messous, M.-A., Senouci, S.-M., Sedjelmaci, H., & Cherkaoui, S.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2019-05
- Volume
- 68
- Issue
- 5
- Pages
- 4964-4974
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2918311828
- Cited by
- 175
- References
- 5
- FWCI
- 16.29
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.