{'fraction_non_alphanumeric': 0.024667931688804556, 'fraction_numerical': 0.0, 'mean_word_length': 5.355421686746988, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Energy-Efficient Power Control with Max-Min Fairness for Energy Harvesting Ad Hoc Networks

An energy-efficient power control algorithm with max-min fairness for energy harvesting ad hoc networks is studied in this paper. Specially, each node of the network has an ability of harvesting energy from external environment, e.g., thermal or solar etc. We aim to maximize the minimum individual energy efficiency while guaranteeing the energy causality constraint and quality of service (QoS) of each node. The fairness-aware energy-efficient power control problem is formulated as a fractional nonconvex problem. To make the formulated problem tractable, we transform the original problem into an equivalent subtractive-form problem via Dinkelbach approach. A combinational framework of successive convex approximation (SCA) and geometric programming (GP) is further adopted to obtain a near optimal solution of the power control problem. Simulation results show that the proposed algorithm can provide greater fairness in energy harvesting ad hoc networks.