Qinghui Zhang
ABSTRACT
Terminal devices (TDs) connect to networks through access points (APs) integrated into the edge server. This provides a prerequisite for TDs to upload tasks to cloud data centers or offload them to edge servers for execution. In this process, signal coverage, data transmission, and task execution consume energy, and the energy consumption of signal coverage increases sharply as the radius increases. Lower power leads to less energy consumption in a given time segment. Thus, power control for APs is essential for reducing energy consumption. Our objective is to determine the power assignment for each AP with same capacity constraints such that all TDs are covered, and the total power is minimized. We define this problem as a minimum power capacitated cover (MPCC) problem and present a minimum local ratio (MLR) power control approach for this problem to obtain accurate results in polynomial time. Power assignments are chosen in a sequence of rounds. In each round, we choose the power assignment that minimizes the ratio of its power to the number of currently uncovered TDs it contains. In the event of a tie, we pick an arbitrary power assignment that achieves the minimum ratio. We continue choosing power assignments until all TDs are covered. Finally, various experiments verify that this method can outperform another greedy-based way.
- Nasir Abbas, Yan Zhang, Amir Taherkordi, and Tor Skeie. 2018. Mobile Edge Computing: A Survey. IEEE Internet of Things Journal 5 (2 2018), 450–465. Issue 1. https://doi.org/10.1109/JIOT.2017.2750180Google Scholar
- Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, and Kim Whittlesey. 2006. Minimum-cost coverage of point sets by disks. In Proceedings of the twenty-second annual symposium on Computational geometry - SCG ’06, Vol. 2006. ACM Press, New York, New York, USA, 449. https://doi.org/10.1145/1137856.1137922Google ScholarDigital Library
- Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos. 2005. Geometric Clustering to Minimize the Sum of Cluster Sizes. In Lecture Notes in Computer Science. Vol. 3669. 460–471. https://doi.org/10.1007/11561071_42Google ScholarDigital Library
- Timothy M. Chan, Elyot Grant, Jochen Könemann, and Malcolm Sharpe. 2012. Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1576–1585. https://doi.org/10.1137/1.9781611973099.125Google ScholarCross Ref
- Wang Chi Cheung, Michel X. Goemans, and Sam Chiu-Wai Wong. 2014. Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. 0. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1714–1726. https://doi.org/10.1137/1.9781611973402.124 arxiv:1606.07861Google ScholarCross Ref
- Trinh Van Chien, Thuong Nguyen Canh, Emil Bjornson, and Erik G. Larsson. 2020. Power Control in Cellular Massive MIMO With Varying User Activity: A Deep Learning Solution. IEEE Transactions on Wireless Communications 19 (9 2020), 5732–5748. Issue 9. https://doi.org/10.1109/TWC.2020.2996368Google Scholar
- Michele Chincoli and Antonio Liotta. 2018. Self-Learning Power Control in Wireless Sensor Networks. Sensors 18 (1 2018), 375. Issue 2. https://doi.org/10.3390/s18020375Google Scholar
- Julia Chuzhoy and Joseph (Seffi) Naor. 2006. Covering Problems with Hard Capacities. SIAM J. Comput. 36, 2 (jan 2006), 498–515. https://doi.org/10.1137/S0097539703422479Google ScholarDigital Library
- Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford. 1990. Introduction to Algorithms. MIT Press.Google Scholar
- Yanpeng Dai, Junyu Liu, Min Sheng, Nan Cheng, and Xuemin Shen. 2021. Joint Optimization of BS Clustering and Power Control for NOMA-Enabled CoMP Transmission in Dense Cellular Networks. IEEE Transactions on Vehicular Technology 70 (2 2021), 1924–1937. Issue 2. https://doi.org/10.1109/TVT.2021.3055769Google ScholarCross Ref
- Sudipto Guha, Refael Hassin, Samir Khuller, and Einat Or. 2003. Capacitated vertex covering. Journal of Algorithms 48, 1 (aug 2003), 257–270. https://doi.org/10.1016/S0196-6774(03)00053-1Google ScholarDigital Library
- Mong-Jen Kao. 2021. Iterative Partial Rounding for Vertex Cover with Hard Capacities. Algorithmica 83, 1 (jan 2021), 45–71. https://doi.org/10.1007/s00453-020-00749-9 arxiv:1606.08667Google ScholarDigital Library
- Weidong Li, Xi Liu, Xiaobo Cai, and Xuejie Zhang. 2019. Approximation algorithm for the energy-aware profit maximizing problem in heterogeneous computing systems. J. Parallel and Distrib. Comput. 124 (2019), 70–77. https://doi.org/10.1016/j.jpdc.2018.10.013Google ScholarCross Ref
- Xiaofei Liu, Weidong Li, and Han Dai. 2022. Approximation algorithms for the minimum power cover problem with submodular/linear penalties. Theoretical Computer Science (5 2022). https://doi.org/10.1016/j.tcs.2022.05.012Google ScholarDigital Library
- Xiaofei Liu, Weidong Li, and Runtao Xie. 2021. A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. Optimization Letters (11 2021). https://doi.org/10.1007/s11590-021-01831-zGoogle Scholar
- Xi Liu, Weidong Li, and Xuejie Zhang. 2018. Strategy-Proof Mechanism for Provisioning and Allocation Virtual Machines in Heterogeneous Clouds. IEEE Transactions on Parallel and Distributed Systems 29, 7 (2018), 1650–1663. https://doi.org/10.1109/TPDS.2017.2785815Google ScholarDigital Library
- Nabil H. Mustafa and Saurabh Ray. 2010. Improved Results on Geometric Hitting Set Problems. Discrete and Computational Geometry 44, 4 (dec 2010), 883–895. https://doi.org/10.1007/s00454-010-9285-9Google ScholarCross Ref
- Daniel Ronnow and Peter Handel. 2019. Nonlinear Distortion Noise and Linear Attenuation in MIMO Systems—Theory and Application to Multiband Transmitters. IEEE Transactions on Signal Processing 67 (10 2019), 5203–5212. Issue 20. https://doi.org/10.1109/TSP.2019.2935896Google ScholarCross Ref
- Kasturi Varadarajan. 2010. Weighted Geometric Set Cover via Quasi-Uniform Sampling. In Proceedings of the Forty-Second ACM Symposium on Theory of Computing (Cambridge, Massachusetts, USA) (STOC ’10). Association for Computing Machinery, New York, NY, USA, 641–648. https://doi.org/10.1145/1806689.1806777Google ScholarDigital Library
- Fan Wu, Supeng Leng, Sabita Maharjan, Xiaoyan Huang, and Yan Zhang. 2021. Joint Power Control and Computation Offloading for Energy-efficient Mobile Edge Networks. IEEE Transactions on Wireless Communications (2021), 1–1. https://doi.org/10.1109/TWC.2021.3130649Google ScholarDigital Library
- Jixian Zhang, Laixin Chi, Ning Xie, Xutao Yang, Xuejie Zhang, and Weidong Li. 2022. Strategy-Proof Mechanism for Online Resource Allocation in Cloud and Edge Collaboration. Computing 104, 2 (feb 2022), 383–412. https://doi.org/10.1007/s00607-021-00962-6Google ScholarDigital Library
- Yan Zhang. 2022. Mobile Edge Computing. Vol. 9. Springer International Publishing. https://doi.org/10.1007/978-3-030-83944-4Google Scholar
Index Terms
- A Local-Ratio-Based Power Control Approach for Capacitated Access Points in Mobile Edge Computing
Recommendations
Power sensitive power control in ad networks
ACM-SE 43: Proceedings of the 43rd annual Southeast regional conference - Volume 2In this paper, we propose battery power sensitive power control as a variable-range transmission power control strategy to maximize network lifetime and minimize end-to-end delay in wireless multi-hop networks. The network lifetime is defined as the ...
Coordinating processor and main memory for efficientserver power control
ICS '11: Proceedings of the international conference on SupercomputingWith the number of high-density servers in data centers rapidly increasing, power control with performance optimization has become a key challenge to gain a high return on investment, by safely accommodating the maximized number of servers allowed by ...
Power Scaling Method for Uplink Power Control with Carrier Aggregation
ICMTMA '11: Proceedings of the 2011 Third International Conference on Measuring Technology and Mechatronics Automation - Volume 02According to 3GPP RAN1 conference, power scaling for uplink power control should be applied equally. However, the detail of power scaling is a remaining issue. In this contribution, we clarify some cases of power scaling and propose several options of ...
Comments