2016 IEEE Global Communications Conference (GLOBECOM) 2016
DOI: 10.1109/glocom.2016.7841551
|View full text |Cite
|
Sign up to set email alerts
|

A Stochastic Stability Characterization of the Foschini-Miljanic Algorithm in Random Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…This last property is particularly appealing because it incorporates elements of both stability and optimality (and hence robustness): the former because the proposed algorithms converge almost surely to a fixed constant power vector (despite the persistent, random fluctuations in the network); the latter because the algorithm's end state is an optimal solution of the network's power management problem with respect to the network's mean value. This comes in sharp contrast to the FM algorithm which, when the channel is feasible on average, may fail to converge altogether -or, at best, only converges in distribution to a power profile that is not optimal in any way (Zhou et al 2016).…”
Section: Our Contributions and Related Workmentioning
confidence: 85%
See 2 more Smart Citations
“…This last property is particularly appealing because it incorporates elements of both stability and optimality (and hence robustness): the former because the proposed algorithms converge almost surely to a fixed constant power vector (despite the persistent, random fluctuations in the network); the latter because the algorithm's end state is an optimal solution of the network's power management problem with respect to the network's mean value. This comes in sharp contrast to the FM algorithm which, when the channel is feasible on average, may fail to converge altogether -or, at best, only converges in distribution to a power profile that is not optimal in any way (Zhou et al 2016).…”
Section: Our Contributions and Related Workmentioning
confidence: 85%
“…In a stochastic and time-varying channel, the power iterates generated by FM will be random variables and may fail to converge altogether. Even when FM does converge, it will at best, under uncertain conditions of the channel, converge to a stationary distribution (Zhou et al (2016)), as opposed to a deterministic power vector, which is more desirable. This reveals two main drawbacks of FM.…”
Section: Motivation Of the Papermentioning
confidence: 99%
See 1 more Smart Citation
“…One foremost power control method in such a distributed wireless network was developed by Foschini and Miljanic (FM) [3]. Since its development, the FM algorithm has proved applicable and stable in far more general environments than originally considered [4]. As a clean and polished control scheme which possesses several strong and useful convergence properties, the FM algorithm has heavily inspired subsequent research in the field [5], [6], [7].…”
Section: Introductionmentioning
confidence: 99%