Journal
IEEE INTERNET OF THINGS JOURNAL
Volume 7, Issue 7, Pages 5882-5891Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2019.2949352
Keywords
Robots; Servers; Energy consumption; Smart devices; Internet of Things; Crawlers; Wireless sensor networks; Combinatorial optimization problem; complexity and algorithms; Internet of Things (IoT); superposed data
Categories
Funding
- National Natural Science Foundation of China [61772454, 61811530332, 61702491, 61872048]
Ask authors/readers for more resources
As a successful application of edge computing in the industrial production environment, prolonging the smart devices' (SDs') battery lifetime has become an important issue. In some special practical applications, the uploaded data from SDs to vehicle base stations (VBSs) or servers can be merged between SDs with a fixed size, which is called superposed data. In this article, we consider the superposed data uploading problem in a decentralized device-to-device communication system. The task of the problem is to minimize the total energy consumption of uploading data. We reduce it into a combinatorial optimization problem from the graph theory perspective. For VBSs or servers with infinite capacities, we propose an optimal algorithm with polynomial running time. When VBSs or servers have limited capacities, the problem is NP-hard even in very special cases. For this NP-hard problem, we give two heuristic algorithms and the corresponding numerical simulation results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available