Conference paper · 2017
Efficient resource allocation in mobile-edge computation offloading: Completion time minimization
IEEE International Symposium on Information Theory (ISIT), 2513–2517 · Published 1 June 2017 · DOI 10.1109/isit.2017.8006982
In brief
“Efficient resource allocation in mobile-edge computation offloading: Completion time minimization” is a 2017 conference paper by Hong Quy Le and 2 co-authors, published in IEEE International Symposium on Information Theory (ISIT). OpenAlex counts 87 citations as of 19 November 2026, which puts it in the top 4% of works published in 2017 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 87
- Most cited in
- 2019 (18)
- Field-weighted impact
- 8.80
- References
- 8
- Authors
- 3
Abstract
Mobile-edge computation offloading (MECO) is a promising solution for enhancing the capabilities of mobile devices. For an optimal usage of the offloading, a joint consideration of radio resources and computation resources is important, especially in multiuser scenarios where the resources must be shared between multiple users. We consider a multi-user MECO system with a base… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Le, H. Q., Al-Shatri, H., & Klein, A. (2017). Efficient resource allocation in mobile-edge computation offloading: Completion time minimization. IEEE International Symposium on Information Theory (ISIT), 2513–2517. https://doi.org/10.1109/isit.2017.8006982
MLA 9
Le, Hong Quy, et al. “Efficient resource allocation in mobile-edge computation offloading: Completion time minimization.” IEEE International Symposium on Information Theory (ISIT), 2017, pp. 2513–2517. https://doi.org/10.1109/isit.2017.8006982.
Chicago
Le, Hong Quy, Hussein Al-Shatri, and Anja Klein. 2017. “Efficient resource allocation in mobile-edge computation offloading: Completion time minimization.” IEEE International Symposium on Information Theory (ISIT): 2513–2517. https://doi.org/10.1109/isit.2017.8006982.
Harvard
Le, H. Q., Al-Shatri, H. and Klein, A. (2017) ‘Efficient resource allocation in mobile-edge computation offloading: Completion time minimization’, IEEE International Symposium on Information Theory (ISIT), pp. 2513–2517. doi:10.1109/isit.2017.8006982.
IEEE
H. Q. Le, H. Al-Shatri, and A. Klein, “Efficient resource allocation in mobile-edge computation offloading: Completion time minimization,” IEEE International Symposium on Information Theory (ISIT), pp. 2513–2517, 2017, doi: 10.1109/isit.2017.8006982.
BibTeX
@inproceedings{le2017efficient,
title = {{Efficient resource allocation in mobile-edge computation offloading: Completion time minimization}},
author = {Le, Hong Quy and Al-Shatri, Hussein and Klein, Anja},
booktitle = {IEEE International Symposium on Information Theory (ISIT)},
year = {2017},
pages = {2513--2517},
doi = {10.1109/isit.2017.8006982},
url = {https://doi.org/10.1109/isit.2017.8006982}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 10 | |
| 2019 | 18 | |
| 2020 | 17 | |
| 2021 | 12 | |
| 2022 | 10 | |
| 2023 | 5 | |
| 2024 | 5 | |
| 2025 | 8 | |
| 2026 | 2 |
Its field-weighted citation impact is 8.80: it has been cited 8.80 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- resource allocation
- completion time minimization
- multi-user systems
- cloudlets
- TDMA
- frequency division multiple access
- radio resource allocation
- bisection search
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Le, H. Q., Al-Shatri, H., & Klein, A. (2017). Efficient resource allocation in mobile-edge computation offloading: Completion time minimization. IEEE International Symposium on Information Theory (ISIT), 2513–2517. https://doi.org/10.1109/isit.2017.8006982
How many times has this paper been cited?
87 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Hong Quy Le, Hussein Al-Shatri, Anja Klein.
What is the DOI of this paper?
10.1109/isit.2017.8006982, permanently at https://doi.org/10.1109/isit.2017.8006982. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.