2017 IEEE International Conference on Communications (ICC) 2017
DOI: 10.1109/icc.2017.7996353
|View full text |Cite
|
Sign up to set email alerts
|

Joint energy-bandwidth allocation for multi-user channels with cooperating hybrid energy nodes

Abstract: In this paper, we consider the energy-bandwidth allocation for a network of multiple users, where the transmitters each powered by both an energy harvester and conventional grid, access the network orthogonally on the assigned frequency band. We assume that the energy harvesting state and channel gain of each transmitter can be predicted for K time slots a priori. The different transmitters can cooperate by donating energy to each other. The tradeoff among the weighted sum throughput, the use of grid energy, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
9
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(9 citation statements)
references
References 44 publications
0
9
0
Order By: Relevance
“…Besides, both the time-varying channel conditions and the dynamic mobile traffic have the common features of randomness and unpredictability, resulting in that their statistical properties are uncertain or hard to obtain in a longtime. However, all works in [24][25][26]28] only consider full buffer networks without taking into account the dynamics of the data queues. Although Han and Ansari [27] took into account this factor, just focused on the single-link scenario and their proposed algorithms are not suitable for networks with multiple users.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…Besides, both the time-varying channel conditions and the dynamic mobile traffic have the common features of randomness and unpredictability, resulting in that their statistical properties are uncertain or hard to obtain in a longtime. However, all works in [24][25][26]28] only consider full buffer networks without taking into account the dynamics of the data queues. Although Han and Ansari [27] took into account this factor, just focused on the single-link scenario and their proposed algorithms are not suitable for networks with multiple users.…”
Section: Introductionmentioning
confidence: 99%
“…Although Han and Ansari [27] took into account this factor, just focused on the single-link scenario and their proposed algorithms are not suitable for networks with multiple users. As such, the algorithms proposed in [24][25][26][27][28][29] are hardly implemented in practice because they require prior knowledge of the EH process, data arrival process and the channel state process.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations