DocumentCode
3548000
Title
Utility optimal scheduling in energy cooperation networks powered by renewable energy
Author
Congshi Hu ; Xu Zhang ; Sheng Zhou ; Zhisheng Niu
Author_Institution
Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
fYear
2013
fDate
29-31 Aug. 2013
Firstpage
403
Lastpage
408
Abstract
In this paper, we consider the problem of energy and data control in energy cooperation networks powered by renewable energy. In such networks, nodes can provide data transmission service, and at the same time they have power lines to transfer the harvested energy to others. We develop an online algorithm called Energy and Data Aware (EDA) algorithm using Lyapunov analysis, which makes data admission control and decides energy allocation for traffic transmission and energy transfer. In our EDA algorithm, the node only needs to keep track of its own energy storage status and does not require any knowledge of the energy harvesting process. We show that the proposed algorithm achieves a utility that is within O(ε) of the optimal, for any ε > 0, while ensuring that both the network data queue length and the capacity of energy storage devices are upper bounded by bounds of size O(1/ε).
Keywords
Lyapunov methods; cooperative communication; data communication; energy harvesting; energy storage; telecommunication congestion control; telecommunication power management; telecommunication traffic; EDA algorithm; Lyapunov analysis; data admission control; data traffic transmission service; energy allocation; energy and data aware; energy cooperation network; energy storage device capacity; energy storage status tracking; harvested energy transfer; network data queue length; power lines; renewable energy; utility optimal scheduling; Algorithm design and analysis; Data communication; Energy exchange; Energy harvesting; Optimization; Renewable energy sources; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (APCC), 2013 19th Asia-Pacific Conference on
Conference_Location
Denpasar
Print_ISBN
978-1-4673-6048-7
Type
conf
DOI
10.1109/APCC.2013.6765979
Filename
6765979
Link To Document