Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE internet of things journal Vol. 7; no. 7; pp. 5882 - 5891
Main Authors: Li, Wenjun, Xu, Huayi, Li, Huixi, Yang, Yongjie, Sharma, Pradip Kumar, Wang, Jin, Singh, Saurabh
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.07.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Combinatorial analysis
Combinatorial optimization problem
Communications systems
complexity and algorithms
Computer simulation
Crawlers
Edge computing
Electronic devices
Energy conservation
Energy consumption
Graph theory
Internet of Things
Internet of Things (IoT)
Optimization
Polynomials
Robots
Servers
Service life assessment
Smart devices
superposed data
Wireless sensor networks
ISSN:2327-4662, 2327-4662
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2019.2949352