Low-complexity scheduling policies for energy harvesting communication networks

Author(s):  
Pol Blasco ◽  
Deniz Gunduz ◽  
Mischa Dohler
2018 ◽  
Vol 66 (13) ◽  
pp. 3363-3376 ◽  
Author(s):  
Miguel Calvo-Fullana ◽  
Carles Anton-Haro ◽  
Javier Matamoros ◽  
Alejandro Ribeiro

2018 ◽  
Vol 77 ◽  
pp. 108-118 ◽  
Author(s):  
Mahmood Mohassel Feghhi ◽  
Aliazam Abbasfar ◽  
Mahtab Mirmohseni

Algorithms ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 25
Author(s):  
Su Zhao ◽  
Gang Huang ◽  
Qi Zhu

For an energy-harvesting wireless transmission system, considering that a transmitter which can harvest energy from nature has two kinds of extra energy consumption, circuit consumption and storage losses, the optimization models are set up in this paper for the purpose of maximizing the average throughput of the system within a certain period of time for both a time-invariant channel and time-varying channel. Convex optimization methods such as the Lagrange multiplier method and the KKT (Karush–Kuhn–Tucker) condition are used to solve the optimization problem; then, an optimal offline power allocation algorithm which has a three-threshold structure is proposed. In the three-threshold algorithm, two thresholds can be achieved by using a linear search method while the third threshold is calculated according to the channel state information and energy losses; then, the offline power allocation is based on the three thresholds and energy arrivals. Furthermore, inspired by the optimal offline algorithm, a low-complexity online algorithm with adaptive thresholds is derived. Finally, the simulation results show that the offline power allocation algorithms proposed in this paper are better than other algorithms, the performance of the online algorithm proposed is close to the offline one, and these algorithms can help improve the average throughput of the system.


Sensors ◽  
2018 ◽  
Vol 19 (1) ◽  
pp. 99
Author(s):  
Pengxu Li ◽  
Gaofeng Cui ◽  
Weidong Wang

This paper considers satellite communication networks where each satellite terminal is equipped with energy harvesting (EH) devices to supply energy continuously, and randomly transmits bursty packets to a geostationary satellite over a shared wireless channel. Packet replicas combined with a successive iteration cancellation scheme can reduce the negative impact of packet collisions but consume more energy. Hence, appropriate energy management policies are required to mitigate the adverse effect of energy outages. Although centralized access schemes can provide better performance on the networks’ throughput, they expend extra signallings to allocate the resources, which leads to non-negligible communication latencies, especially for the satellite communication networks. In order to reduce the communication overhead and delay, a distributed random access (RA) scheme considering the energy constraints is studied. Each EH satellite terminal (EH-ST) decides whether to transmit the packet and how many replicas are transmitted according to its local energy and EH rates to maximize the average long-term network throughput. Owing to the nonconvexity of this problem, we adopted a game theoretic method to approximate the optimal solution. By forcing all the EH-STs to employ the same policy, we characterized and proved the existence and uniqueness of the symmetric Nash equilibrium (NE) of the game. Moreover, an efficient algorithm is proposed to calculate the symmetric NE by combining a policy iteration algorithm and the bisection method. The performance of the proposed RA scheme was investigated via numerous simulations. Simulation results showed that the proposed RA scheme is applicable to the EH devices in the future low-cost interactive satellite communication system.


Sign in / Sign up

Export Citation Format

Share Document