A primal-dual algorithm for the minimum power partial cover problem

Li, Menghong; Ran, Yingli; Zhang, Zhao

doi:10.1007/s10878-020-00567-3

Cited by 13 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, while the considerable energy consumption of BSs has been highlighted, few studies have devised methods for reducing energy costs by adjusting BS coverage. The minimum power partial coverage problem in wireless networks is discussed in detail in [9,37], with sensors or wireless access points having their coverage scaled by changing the transmit power. Similarly, multi-BS systems with self-regulating power can reasonably adjust BS coverage according to the TD distribution and task requirements.…”

Section: Related Workmentioning

confidence: 99%

“…Based on set coverage theory, similar to the literature [9], we introduce the concept of disks to reflect the coverage of the BSs when they have different energy. According to Equation (1), each BS b ∈ B corresponds to a number of disks, where b is the center and r(b) is the radius supported by energy E(b).…”

Section: Disk Structure Of the Bssmentioning

confidence: 99%

“…In this section, based on the primal-dual method devised in [9,43] and the disk structure proposed in this paper, we design a primal-dual cloud-edge collaborative task offloading algorithm for minimizing system energy consumption.…”

Section: Primal-dual Algorithm For Cloud-edge Collaborative Task Offl...mentioning

confidence: 99%

“…However, the energy consumption of BSs has long been a key issue for smart cities in realizing low carbon emissions [8]. According to [9], when the coverage area of a BS is regarded as an approximately circular surface, the energy is proportional to the coverage radius, that is,…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Energy-Aware Cloud-Edge Collaborative Task Offloading with Adjustable Base Station Radii in Smart Cities

Zhang

2022

Mathematics

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Disk Structure Of the Bssmentioning

confidence: 99%

Section: Primal-dual Algorithm For Cloud-edge Collaborative Task Offl...mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Energy-Aware Cloud-Edge Collaborative Task Offloading with Adjustable Base Station Radii in Smart Cities

Zhang

2022

Mathematics

View full text Add to dashboard Cite

show abstract

“…When calculating the light source superposition region S3, restricted by the illumination of S1 and S2 regions, the contour detection and matching of the search region are carried out. e minimum coverage problem [36] is used to solve the problem, and the improved artificial bee colony algorithm is combined to optimize the light source layout of L-shaped complex space. e light source layout and illumination distribution of complex space are shown in Figure 14.…”

Section: Simulation Experimentsmentioning

confidence: 99%

Light Source Layout Optimization Strategy Based on Improved Artificial Bee Colony Algorithm

Wang

Gao

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In order to optimize the indoor lighting effect and reduce the energy consumption of indoor lighting, the light source layout of conventional rooms and special rooms is studied in this paper. Firstly, the indoor space lighting model is analyzed, and the expressions of light source output and illumination on the target plane are derived. Secondly, in order to improve the search ability of the algorithm in specific areas, combined with the artificial bee colony algorithm, an improved artificial bee colony algorithm suitable for indoor lighting optimization is proposed. Using the average square difference of the illuminance of the target plane as the adaptation function, a penalty function is introduced, and the minimum circle surrounding strategy is used to search the specific location of the light source. Finally, the obtained layout is fitted by engineering standardization, and the indoor light source layout is obtained. Through the simulation of illuminance effect in conventional room and irregular room, it is proved that the proposed method can effectively improve the lighting effect and reduce the energy consumption of indoor lighting under the same number of light sources and the same illuminance index.

show abstract

The Bound Coverage Problem by Aligned Disks in $$L_1$$ Metric

Liu

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A primal-dual algorithm for the minimum power partial cover problem

Cited by 13 publications

References 19 publications

Energy-Aware Cloud-Edge Collaborative Task Offloading with Adjustable Base Station Radii in Smart Cities

Energy-Aware Cloud-Edge Collaborative Task Offloading with Adjustable Base Station Radii in Smart Cities

Light Source Layout Optimization Strategy Based on Improved Artificial Bee Colony Algorithm

The Bound Coverage Problem by Aligned Disks in $$L_1$$ Metric

Contact Info

Product

Resources

About