Cross-Layer Scheduling and Beamforming in Smart Grid Powered Small-Cell Networks

Julian Cheng; Md. Jahangir Hossain; Victor C. M. Leung; Yanjie Dong

REVIEW 4 major objections 3 minor 21 references

Cross-Layer Scheduling and Beamforming in Smart Grid Powered Small-Cell Networks

T0 review · 4 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A two-scale scheduling and beamforming algorithm asymptotically achieves the minimum grid-energy expenditure in renewable-powered small-cell networks.

desk verdict The paper's asymptotic optimality claim is unproven and the scheduling rule looks like it ignores part of the objective, but the two-scale problem is well posed and the writing is honest. read the letter →

arxiv 1908.04887 v1 pith:P5OAR3JN submitted 2019-08-13 cs.IT eess.SPmath.IT

Yanjie Dong , Md. Jahangir Hossain , Julian Cheng , Victor C. M. Leung This is my paper · ORCID

classification cs.ITeess.SPmath.IT

keywords small-cellnetworksbeamforminguserschedulingbasestationsleepingsmartgridLyapunovoptimizationenergyharvestingtwo-scaleresourceallocation

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that a small-cell network running on renewable energy plus the smart grid can minimize its long-term electricity bill by acting on two time scales: once per frame it decides which users to serve and which base stations to sleep, and once per slot it computes the beamforming vectors. The authors prove, via Lyapunov optimization, that the resulting grid-energy expenditure is bounded between the true optimum and the optimum plus $\Psi/V$, a gap that shrinks as the control parameter $V$ grows, while all user queues remain stable. If the claim holds, operators gain a principled knob for trading end-to-end delay against energy cost without reconfiguring schedules at every slot. The tradeoff is that two load-bearing proofs---the exactness of the convex relaxation and the optimality bound---are deferred to an extended version.

What carries the argument

The machinery is the Lyapunov drift-plus-penalty framework applied to a two-scale system, supplemented by a convex reformulation of the non-convex proportional-rate constraints. The drift bound in Proposition 1 separates the scheduling decisions, which enter through the queue-backlog difference $q^U_{m,n}[k]-q^A_{m,n}[k]$, from the beamforming and energy-trading decisions, so the integer indicators can be optimized in closed form at frame granularity. The remaining slot-level problem is made convex by introducing the auxiliary variable $\varphi(t_k)$ and the constraints (27)-(28), and the paper argues the relaxation is tight because the optimal beamformers satisfy (27) with equality; a one-dimensional search over $\varphi(t_k)$ completes the per-slot solution.

What would settle it

Take a small two-user, one-base-station instance with fixed channels and solve both the original problem (26) with proportional-rate constraints (11) and the relaxed problem (31) with constraints (27)-(28). If the optimal values differ, or if at the optimum of (31) some constraint in (27) is slack, the claimed tightness fails. A second check is to simulate the full algorithm over many frames and see whether the sample-mean grid-energy expenditure actually lies within $\Psi/V$ of the optimum for large $K$.

Watch

Extended reading notes

Core claim

The central claim is that the long-term grid-energy expenditure minimization problem, which couples integer user-scheduling indicators with continuous beamforming vectors, can be solved near-optimally by a two-scale greedy algorithm. Scheduling follows a simple backlog rule: a user is scheduled only when its access-queue backlog is positive and smaller than its processing-queue backlog, and a base station sleeps when none of its users are scheduled. Beamforming and grid trading are then obtained per slot from a convex optimization problem, parameterized by a one-dimensional variable $\varphi(t_k)$, that replaces the proportional-rate constraints with the convex constraints (27)-(28). The paper asserts that the optimal beamformers make these constraints active, so the relaxed problem has the same value as the original, and that the Lyapunov drift-plus-penalty method yields the asymptotic bound $G^* \le \frac{1}{K}\sum_{k=0}^{K-1}\mathbb{E}\{G[k]\} \le \frac{\Psi}{V}+G^*$ together with queue stability. Both proofs are stated but deferred.

Load-bearing premise

The argument rests on assuming the relaxed per-slot problem (31), which replaces proportional-rate constraints by the convex set (27)-(28), has exactly the same optimal value as the original problem (26); if the constraints (27) are ever inactive at the optimum, the asymptotic grid-energy bound applies only to the relaxed problem, not to the true one.

Editorial extensions

If this is right

An operator can tune $V$ to move continuously between low delay and low grid-energy expenditure, with the suboptimality gap bounded by $\Psi/V$.
Scheduling and base-station sleeping need only be updated once per frame, so the overhead and reliability concerns of frequent switching are avoided.
The backlog-based scheduling rule (23) automatically provides proportional fairness, since users with larger access-queue backlogs get proportionally higher service rates.
Renewable-energy volatility is absorbed at frame granularity while beamforming tracks fast channel variations at slot granularity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A natural extension would be to prove the activeness of (27) directly: if the rate function $r_{m,n}=\psi_{m,n}\varphi(t_k)$ is increasing in $\varphi$, the optimal solution should push $\varphi$ to its upper bound, which is exactly the regime where (27) binds; supplying this argument would close the main gap.
The same two-scale decomposition could be applied to other cross-layer problems, such as joint caching and beamforming, where integer content-placement decisions are made at frame level and precoding at slot level.
One testable prediction is that the scheduling threshold (23) remains near-optimal even when renewable-energy arrivals are correlated across frames, since the drift-plus-penalty analysis only needs the expectation over random sources, not temporal independence.
If the relaxation is not always tight, a practical fix would be to add a small penalty that encourages the constraints (27) toward equality, or to use sequential convex programming; numerical results would reveal whether such a fix changes the cost.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Zev, quick take on 1908.04887. The central theorem—Proposition 2's asymptotic optimality bound (33)—is explicitly deferred to an extended version, and the proof of the relaxation tightness (activeness of (27)) is likewise postponed. That alone makes the paper incomplete as a submission. The deeper problem is that the scheduling rule (23) does not actually minimize the full drift-plus-penalty upper bound (19). It minimizes only the rate-dependent term (22), while the grid-energy expenditure term V E{G[k]} also depends on the scheduling decisions through the power consumption in (8) and the power balance (13). So the claimed optimality gap is unsupported on two levels.

What is genuinely new: the joint design of user scheduling, ScBS sleeping, and beamforming under proportional-rate constraints in a two-scale, smart-grid-powered small-cell network. Each component is known (Lyapunov drift-plus-penalty, convex relaxation of proportional rates), but the specific combination and the frame/slot decomposition are not in the prior work I know. The system model is carefully laid out, and the Lyapunov drift bound in Proposition 1 is standard and correctly derived. The numerical results show the expected tradeoff between delay and energy expenditure, but there are only two figures and no comparison to any baseline algorithm, so they are suggestive rather than convincing.

There is also a practical feasibility issue that the stress-test note flags: rule (23) schedules every UE with qU

To be fair: the paper is not a sham. It is clearly written, the authors are explicit about the missing proofs, and the citation pattern is fine—the self-citations are for standard results. But the load-bearing arguments are absent, so the scientific contribution as submitted is incomplete.

For peer review: I would not accept this as is. But it deserves a serious technical referee rather than a desk reject, because the problem is real and the flaws are subtle enough that an expert can pinpoint them constructively. The authors need to provide the missing proofs and fix the scheduling rule before the claims can be taken seriously.

Referee Report

4 major / 3 minor

Summary. The paper studies joint beamforming, user scheduling, and small-cell base station sleeping in a two-scale (frame/slot) small-cell network powered by smart grid and renewable energy. It formulates a long-term grid-energy expenditure minimization problem with proportional-rate fairness constraints, then applies Lyapunov drift-plus-penalty optimization to decouple the frame-level scheduling decisions from slot-level beamforming. The main theoretical claim is Proposition 2, which states that the proposed algorithm asymptotically achieves the optimal grid-energy expenditure within an additive gap Ψ/V while keeping queues stable. Numerical results based on solar irradiation data are reported to show a delay-energy tradeoff.

Significance. If fully established, the proposed two-scale cross-layer framework would be a useful contribution to energy-aware small-cell network design, as it targets a practical timescale separation between scheduling and beamforming. The problem formulation and the use of Lyapunov optimization are reasonable, and the numerical study with realistic renewable-energy data is a positive feature. However, the paper's principal theoretical guarantees are not proven: Proposition 2 is explicitly deferred, and the tightness of the convex relaxation that underlies the per-slot optimization is also deferred. In addition, the scheduling rule appears to minimize only a component of the drift-plus-penalty expression, so the optimality claim is not supported. Because the core claims are unverified, the contribution as submitted is limited.

major comments (4)

[Section III, Proposition 2 (Eq. 33)] The main theoretical result, the asymptotic optimality bound in (33), is stated without proof; the text says 'the detailed proof is omitted and it will be provided in the extended version.' This is not a local appendix omission but the central claim of the paper. The bound (33) is the basis for saying the proposed algorithm approaches the optimal grid-energy expenditure, so the manuscript does not currently provide the stated guarantee.
[Section III-B, after Eq. (31)] The proof that the relaxed problem (31) has the same optimal value as the original problem (26) is also deferred: 'The detailed proof of the activeness of (27) will be provided in the extended version.' The relaxation replaces the non-convex proportional-rate constraints (11) with (27)-(28). If the relaxation is not tight, the algorithm solves a different problem, and the bound (33) does not apply to the original problem (15). This is a load-bearing step that cannot be left as a promise.
[Section III-A, Eq. (23)] The scheduling rule a* in (23) minimizes only the rate term (22), which is one summand in the upper bound (19) of the drift-plus-penalty function. It does not account for the V E{G[k]} term, which depends on the scheduled user set through P_SC in (8) and the power balance (13), nor for the coupling between user rates and beamforming through the proportional-rate constraints. Minimizing one component of the RHS of (19) does not minimize the full upper bound, so the optimality of (23) is not established. Moreover, (23) schedules all users with q^U < q^A without checking channel quality or transmit power limits, so the per-slot problem (32) may become infeasible; the paper provides no feasibility condition or recovery mechanism.
[Section IV] The numerical results cannot compensate for the missing theoretical guarantees because the algorithm's decisions, particularly the scheduling rule (23), are not shown to minimize the drift-plus-penalty expression. The paper reports performance trends but does not test the claimed bound (33) against an optimal or benchmark solution. Without the missing proofs, the numerical section demonstrates only that the proposed heuristic behaves sensibly in the simulated scenario.

minor comments (3)

[Appendix, Eq. (37)] Equation (37) appears to have a typo: the left-hand side is written as ∆X + E{G[k]}, but the drift-plus-penalty function defined in (18) has the penalty weighted by V, so the LHS should likely be ∆X + V E{G[k]}. Also, the second summation on the right-hand side appears to have a duplicated 'N_m ∑ n=1' index.
[Section II-B] The rate expression r_{m,n}(t_k) = log(1 + SINR_{m,n}(t_k)) is used without stating the base of the logarithm; the numerical section uses nats/slot/Hz, so the base should be stated earlier to avoid ambiguity.
[General] The paper repeatedly refers to an 'extended version' for missing proofs and for the non-ideal energy trading case (Remark 1), but no reference or indication is given that such a version exists. The manuscript should either include the proofs or clearly state that the results are conjectural.

Circularity Check

0 steps flagged · score 1.0 of 10

No construction-level circularity: the central Lyapunov derivation is standard and parameter-free, but two load-bearing proofs are explicitly deferred and one relies on the authors' prior work.

full rationale

The paper does not fit any parameter to data it later 'predicts', so the fitted-input and self-definition patterns do not apply. The drift-plus-penalty bound (19) is derived in the Appendix from the queueing equations (1)/(3) via standard telescoping inequalities, and the algorithm (23)/(24)/(32) is presented as a minimization of that bound; no quantity is defined in terms of the target optimality gap. The only load-bearing appeals that could raise circularity concerns are two deferred proofs. First, the equality of the relaxed problem (31) and the original per-slot problem (26) is asserted via activeness of (27): 'With slight modification of the arguments in [19], we demonstrate that the optimal beamforming vectors make the constraints in (27) active... The detailed proof of the activeness of (27) will be provided in the extended version of the conference article.' Here [19] is a same-author paper, but the assertion is an adaptation of an external technical argument rather than a definitional identity, and no input quantity is renamed as a conclusion. Second, Proposition 2's asymptotic bound (33) is stated without proof: 'Due to the space limitation, the detailed proof is omitted and it will be provided in the extended version of this conference paper.' These are missing-proof/soundness gaps, not circular reductions; they should be weighed under correctness risk rather than circularity. Accordingly the circularity score is 1, reflecting one non-circular reliance on a same-group citation and deferred justification, while the substantive derivation is self-contained and parameter-free.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The algorithm has no fitted parameters; V is a user-tunable control parameter, not fitted to data. The central claim depends on standard Lyapunov theory, the i.i.d. channel assumption, the unproven tightness of the beamforming relaxation, and an ideal free energy-trading assumption. No new physical entities are introduced.

assumptions (4)

standard math The Lyapunov drift-plus-penalty framework (Neely [18]) is valid for the formulated stochastic optimization problem.
The proof of Proposition 1 follows the standard Lyapunov method, which requires assumptions about bounded moments and stationary random sources; the paper invokes this framework without restating those conditions.
domain assumption Channel coefficient vectors {h_m,n(tk)} are i.i.d. over different slots, enabling the replacement of the expectation in (26) with the instantaneous value in (32).
Stated in Section III-B: 'with the assumption that the channel coefficient vectors {hm,n(tk)} are i.i.d. over different slots.' This is strong and may not hold in practice with mobility and correlation.
ad hoc to paper The relaxed constraints (27)-(28) are tight for the original proportional-rate constraints (11), i.e., the optimal value of (31) equals that of (26).
The proof of activeness of (27) is deferred to an extended version, so this is an unproven but load-bearing assumption for the optimality claim.
domain assumption One ScBS can trade NRE with other ScBSs free of charge (ideal case, Remark 1).
The grid-energy expenditure model (9) assumes free energy sharing among ScBSs, which the paper acknowledges is ideal.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Cross-Layer Scheduling and Beamforming in Smart Grid Powered Small-Cell Networks." pith.science (2026). https://pith.science/paper/P5OAR3JN

@misc{pith2026190804887,
  author       = {Pith},
  title        = {Pith review of: Cross-Layer Scheduling and Beamforming in Smart Grid Powered Small-Cell Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/P5OAR3JN}},
  note         = {Machine review of arXiv:1908.04887}
}

read the original abstract

In the small-cell networks (SCNs) with multiple small-cell base stations (ScBSs), the joint design of beamforming vectors, user scheduling and ScBS sleeping is investigated with the constraints on proportional rate. A long-term grid-energy expenditure minimization problem is formulated for the considered SCNs, which are powered by the smart grid and natural renewable energy. Since the scheduled user indicators are coupled with the beamforming vectors, the formulated problem is challenging to handle. In order to decouple the beamforming vectors from the scheduled user indicators, the Lyapunov optimization technique is used. As a result, a practical two-scale algorithm is proposed to allocate the user scheduling indicators and ScBS sleeping variables at the coarse-grained granularity (frame) as well as obtain the beamforming vectors at the fine-grained granularity (slot). Numerical results are used to verify the performance of the proposed two-scale algorithm.

Figures

Figures reproduced from arXiv: 1908.04887 by the authors.

**Figure 2.** Variation of the annualized electricity expenditure with the [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 20 canonical work pages

[1]

Cisco, Cisco Visual Networking Index: Forecast and Methodology, 2016–2021, Sept. 2017

work page 2016
[2]

Improving network capacity scaling law in ultra-dense small cell networks,

J. Liu, M. Sheng, and J. Li, “Improving network capacity scaling law in ultra-dense small cell networks,” IEEE Trans. Wireless Commun. , vol. 17, no. 9, pp. 6218–6230, Sept. 2018

work page 2018
[3]

The global footprint of mobile communications: The ecological and economic perspective,

A. Fehske, G. Fettweis, J. Malmodin, and G. Biczok, “The global footprint of mobile communications: The ecological and economic perspective,” IEEE Commun. Mag. , vol. 49, no. 8, pp. 55–62, Aug. 2011

work page 2011
[4]

An overview of sustainable green 5G networks,

Q. Wu, G. Y . Li, W. Chen, D. W. K. Ng, and R. Schober, “An overview of sustainable green 5G networks,” IEEE Wireless Commun. , vol. 24, no. 4, pp. 72–80, Aug. 2017

work page 2017
[5]

Coordinated beamforming for the multicell multi-antenna wireless system,

H. Dahrouj and W. Yu, “Coordinated beamforming for the multicell multi-antenna wireless system,” IEEE Trans. Wireless Commun., vol. 9, no. 5, pp. 1748–1759, May 2010

work page 2010
[6]

Transmit power minimization in small cell networks under time average QoS con- straints,

S. Lakshminarayana, M. Assaad, and M. D ´ebbah, “Transmit power minimization in small cell networks under time average QoS con- straints,” IEEE J. Sel. Areas Commun. , vol. 33, no. 10, pp. 2087–2103, Oct. 2015

work page 2015
[7]

Leakage-aware energy- efﬁcient beamforming for heterogeneous multicell multiuser systems,

S. He, Y . Huang, H. Wang, S. Jin, and L. Yang, “Leakage-aware energy- efﬁcient beamforming for heterogeneous multicell multiuser systems,” IEEE J. Sel. Areas Commun., vol. 32, no. 6, pp. 1268–1281, June 2014

work page 2014
[8]

When the smart grid meets energy-efﬁcient communications: Green wireless cellular networks powered by the smart grid,

S. Bu, F. R. Yu, Y . Cai, and X. P. Liu, “When the smart grid meets energy-efﬁcient communications: Green wireless cellular networks powered by the smart grid,” IEEE Trans. Wireless Commun. , vol. 11, no. 8, pp. 3014–3024, Aug. 2012

work page 2012

Show all 21 references

[9]

A hybrid energy sharing framework for green cellular networks,

M. J. Farooq, H. Ghazzai, A. Kadri, H. ElSawy, and M.-S. Alouini, “A hybrid energy sharing framework for green cellular networks,” IEEE Trans. Commun., vol. 65, no. 2, pp. 918–934, Feb. 2017

2017
[10]

Dynamic cross- layer beamforming in hybrid powered communication systems with harvest-use-trade strategy,

Y . Dong, M. J. Hossain, J. Cheng, and V . C. M. Leung, “Dynamic cross- layer beamforming in hybrid powered communication systems with harvest-use-trade strategy,” IEEE Trans. Wireless Commun. , vol. 16, no. 12, pp. 8011–8025, Dec. 2017

2017
[11]

Dynamic energy management for smart-grid-powered coordinated multipoint systems,

X. Wang, Y . Zhang, T. Chen, and G. B. Giannakis, “Dynamic energy management for smart-grid-powered coordinated multipoint systems,” IEEE J. Sel. Areas Commun., vol. 34, no. 5, pp. 1348–1359, May 2016

2016
[12]

Smart grid enabled mobile networks: Jointly optimizing BS operation and power distribution,

X. Huang, T. Han, and N. Ansari, “Smart grid enabled mobile networks: Jointly optimizing BS operation and power distribution,” IEEE/ACM Trans. Netw., vol. 25, no. 3, pp. 1832–1845, June 2017

2017
[13]

Joint optimization of caching and association in energy-harvesting-powered small-cell networks,

F. Guo, H. Zhang, X. Li, H. Ji, and V . C. M. Leung, “Joint optimization of caching and association in energy-harvesting-powered small-cell networks,” IEEE Trans. Veh. Technol., vol. 67, no. 7, pp. 6469–6480, July 2018

2018
[14]

Two-scale stochastic control for integrated multipoint communication systems with renewables,

X. Wang, X. Chen, T. Chen, L. Huang, and G. B. Giannakis, “Two-scale stochastic control for integrated multipoint communication systems with renewables,” IEEE Trans. Smart Grid , vol. 9, no. 3, pp. 1822– 1834, May 2018

2018
[15]

Power-delay tradeoff with predictive scheduling in integrated cellular and Wi-Fi networks,

H. Yu, M. H. Cheung, L. Huang, and J. Huang, “Power-delay tradeoff with predictive scheduling in integrated cellular and Wi-Fi networks,” IEEE J. Sel. Areas Commun. , vol. 34, no. 4, pp. 735–742, Apr. 2016

2016
[16]

A general utility optimiza- tion framework for energy-harvesting-based wireless communications,

H. Li, J. Xu, R. Zhang, and S. Cui, “A general utility optimiza- tion framework for energy-harvesting-based wireless communications,” IEEE Commun. Mag. , vol. 53, no. 4, pp. 79–85, Apr. 2015

2015
[17]

Pro- portional fairness-based beamforming and signal splitting for MISO- SWIPT systems,

Y . Dong, X. Ge, M. J. Hossain, J. Cheng, and V . C. M. Leung, “Pro- portional fairness-based beamforming and signal splitting for MISO- SWIPT systems,” IEEE Commun. Lett. , vol. 21, no. 5, pp. 1135–1138, May 2017

2017
[18]

M. J. Neely, Stochastic Network Optimization with Application to Communication and Queueing Systems . San Rafael, USA: Morgan & Claypool, 2010

2010
[19]

Robust energy efﬁcient beamforming in MISOME-SWIPT systems with proportional secrecy rate,

Y . Dong, M. J. Hossain, J. Cheng, and V . C. M. Leung, “Robust energy efﬁcient beamforming in MISOME-SWIPT systems with proportional secrecy rate,” IEEE J. Sel. Areas Commun., vol. 37, no. 1, pp. 202–215, Jan. 2019

2019
[20]

CVX: Matlab software for disciplined convex programming, version 2.1,

M. Grant and S. P. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” http://cvxr.com/cvx, Mar. 2014

2014
[21]

1.28 Mcps TDD home nodeb radio frequency,

3GPP, “1.28 Mcps TDD home nodeb radio frequency,” 3GPP TR 25.968 version 15.0.0 Release 15 , June 2018

2018

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

Cisco, Cisco Visual Networking Index: Forecast and Methodology, 2016–2021, Sept. 2017

work page 2016

[2] [2]

Improving network capacity scaling law in ultra-dense small cell networks,

J. Liu, M. Sheng, and J. Li, “Improving network capacity scaling law in ultra-dense small cell networks,” IEEE Trans. Wireless Commun. , vol. 17, no. 9, pp. 6218–6230, Sept. 2018

work page 2018

[3] [3]

The global footprint of mobile communications: The ecological and economic perspective,

A. Fehske, G. Fettweis, J. Malmodin, and G. Biczok, “The global footprint of mobile communications: The ecological and economic perspective,” IEEE Commun. Mag. , vol. 49, no. 8, pp. 55–62, Aug. 2011

work page 2011

[4] [4]

An overview of sustainable green 5G networks,

Q. Wu, G. Y . Li, W. Chen, D. W. K. Ng, and R. Schober, “An overview of sustainable green 5G networks,” IEEE Wireless Commun. , vol. 24, no. 4, pp. 72–80, Aug. 2017

work page 2017

[5] [5]

Coordinated beamforming for the multicell multi-antenna wireless system,

H. Dahrouj and W. Yu, “Coordinated beamforming for the multicell multi-antenna wireless system,” IEEE Trans. Wireless Commun., vol. 9, no. 5, pp. 1748–1759, May 2010

work page 2010

[6] [6]

Transmit power minimization in small cell networks under time average QoS con- straints,

S. Lakshminarayana, M. Assaad, and M. D ´ebbah, “Transmit power minimization in small cell networks under time average QoS con- straints,” IEEE J. Sel. Areas Commun. , vol. 33, no. 10, pp. 2087–2103, Oct. 2015

work page 2015

[7] [7]

Leakage-aware energy- efﬁcient beamforming for heterogeneous multicell multiuser systems,

S. He, Y . Huang, H. Wang, S. Jin, and L. Yang, “Leakage-aware energy- efﬁcient beamforming for heterogeneous multicell multiuser systems,” IEEE J. Sel. Areas Commun., vol. 32, no. 6, pp. 1268–1281, June 2014

work page 2014

[8] [8]

When the smart grid meets energy-efﬁcient communications: Green wireless cellular networks powered by the smart grid,

S. Bu, F. R. Yu, Y . Cai, and X. P. Liu, “When the smart grid meets energy-efﬁcient communications: Green wireless cellular networks powered by the smart grid,” IEEE Trans. Wireless Commun. , vol. 11, no. 8, pp. 3014–3024, Aug. 2012

work page 2012