Abstract

In smart cities, the computing power and battery life of terminal devices (TDs) can be effectively enhanced by offloading tasks to nearby base stations (BSs) with richer resources. With the goal of TDs being fully served and achieving low-carbon energy savings for the system, this paper investigates task offloading in cloud-edge collaborative heterogeneous scenarios with multiple BSs and TDs. According to the proportional relationship between the energy and coverage radii of BSs, a complete coverage task offloading model with adjustable BS radii is proposed. The task offloading problem is formulated as an integer linear program with multidimensional resource constraints to minimize the sum of energy consumption of BS coverage, offloading tasks to BSs and the cloud data center (CC). Since this task offloading problem is NP-hard, two approximate algorithms with polynomial time complexity are designed based on the greedy strategy of seeking the most energy-effective disk and the primal–dual method of constructing primal feasible solutions according to dual feasible solutions. Experimental results show that both the greedy and primal–dual algorithms can achieve good approximation performance, but each of them has its own advantages due to different design principles. The former is superior in execution time and energy consumption, while the latter has advantages in balancing loads among BSs and alleviating core network bandwidth pressure.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.