2013 National Conference on Communications (NCC) 2013
DOI: 10.1109/ncc.2013.6488018
|View full text |Cite
|
Sign up to set email alerts
|

Power-optimal scheduling for a Green Base station with delay constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 13 publications
0
11
0
Order By: Relevance
“…Besides, intelligently operating energy harvesting BSs in HCNs related to power saving has also received considerable interest [15]- [24]. A new tractable model for K-tier HCNs is developed in [15], where each BS is powered solely by a self-contained energy harvesting module.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Besides, intelligently operating energy harvesting BSs in HCNs related to power saving has also received considerable interest [15]- [24]. A new tractable model for K-tier HCNs is developed in [15], where each BS is powered solely by a self-contained energy harvesting module.…”
Section: Related Workmentioning
confidence: 99%
“…Authors in [23] study resource allocation algorithm design for energy-efficient communication in an orthogonal frequency division multiple access (OFDMA) downlink network with hybrid energy harvesting BS. A power optimization problem with average delay constraint on the downlink of a Green Base station is considered in [24]. This Green BS is powered by both renewable energy as well as conventional sources like diesel generators or the power grid.…”
Section: Related Workmentioning
confidence: 99%
“…Also, as before we assume that the energy is spent only in transmission and energy buffer is infinite. Various generalizations to energy spent on other activities and battery leakage can be taken into account as in [13] and due to space limitations we ignore them in this paper. Now the problem is to minimize (4a) but instead of (4b), the constraint at time k is P k ≤ E k .…”
Section: Generalizationsmentioning
confidence: 99%
“…Existence of an optimal policy for this problem has been proved in [13]. However, there is no closed form solution and it is computationally very complex to obtain the optimal policy.…”
Section: Multiuser Systemmentioning
confidence: 99%
See 1 more Smart Citation