2017
DOI: 10.1109/tgcn.2017.2715349
|View full text |Cite
|
Sign up to set email alerts
|

Distributed User Association in Energy Harvesting Small Cell Networks: An Exchange Economy With Uncertainty

Abstract: We consider a distributed user association problem in the downlink of a small cell network, where small cells obtain the required energy for providing wireless services to users through ambient energy harvesting. Since energy harvesting is opportunistic in nature, the amount of harvested energy is a random variable, without a priori known characteristics. We model the network as a competitive market with uncertainty, where self-interested small cells, modeled as consumers, are willing to maximize their utility… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 18 publications
(18 citation statements)
references
References 46 publications
0
18
0
Order By: Relevance
“…(q q q, t t t) due to nonconvex objective function (27a) and constraints (27b)-(27c). Before solving problem (27), we have the following theorem. (27) is a convex problem w.r.t.…”
Section: B Joint Power Control and Time Allocation Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…(q q q, t t t) due to nonconvex objective function (27a) and constraints (27b)-(27c). Before solving problem (27), we have the following theorem. (27) is a convex problem w.r.t.…”
Section: B Joint Power Control and Time Allocation Algorithmmentioning
confidence: 99%
“…Proof: Please refer to Appendix E. According to the IPCTA-NOMA algorithm, the major complexity lies in solving the convex problem (27) with fixed τ τ τ . Considering that the dimension of the variables in problem…”
Section: Convergence and Complexity Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…As conventional, we assume the existence of a noiseless control channel, implying that the signals arrive error-free at CPSs and/or the auctioneer. Such an assumption is justified by the existence of coding schemes that reduce the transmission error probability to almost zero [41]; therefore, it is widely used in game theory and networks literature (see [23] and [42], among many others). While the analysis of the problem with noisy communication channel is beyond the scope of our work, there are some research works that study such setting.…”
Section: Implementing the Strong Sequential Core: Walras' Tatonmentioning
confidence: 99%