2008
DOI: 10.1109/jsac.2008.080912
|View full text |Cite
|
Sign up to set email alerts
|

Joint Channel and Power Allocation in Wireless Mesh Networks: A Game Theoretical Perspective

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
48
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 86 publications
(48 citation statements)
references
References 24 publications
0
48
0
Order By: Relevance
“…Smaller implies that the smart pumps are more willing to choose a suboptimal action to explore, whereas higher implies that they are prone to choose the best response action. Therefore, it is advisable that, at the beginning phase, the value of is set to small number and it keeps increasing as the optimization iterates [19,20]. ΔQ is the supply-demand difference.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Smaller implies that the smart pumps are more willing to choose a suboptimal action to explore, whereas higher implies that they are prone to choose the best response action. Therefore, it is advisable that, at the beginning phase, the value of is set to small number and it keeps increasing as the optimization iterates [19,20]. ΔQ is the supply-demand difference.…”
Section: Problem Formulationmentioning
confidence: 99%
“…It is easy to verify that all identical interest games have at least one pure NE, which will represent any action profile that maximizes U network (Θ, P) [14,32]. We analyze a cooperative power minimization algorithm (COPMA) which can converge to the optimal NE with arbitrarily high probability.…”
Section: Cooperative Power Minimization Using Beamformingmentioning
confidence: 99%
“…Motivated by Song et al [32], } to the updating node pair m. Finally, the mth node pair will decide whether the new transmit beamformer should be kept or changed with some probability which depends on p current and p updated which are the total transmit power in the network prior to and after the random change of the transmit beamformer, respectively. Note that since p current and p updated are calculated by each node pair independently, the unique ID of each node provides a checklist to accurately add up transmit powers.…”
Section: Cooperative Power Minimization Using Beamformingmentioning
confidence: 99%
See 1 more Smart Citation
“…This approach was based on global optimization, while the competition among different MRs was not considered. In [18], the throughput maximization problems in a WMN for both cooperative and non-cooperative scenarios were analyzed, and a linear pricing scheme was proposed to combat the selfish behavior of non-cooperative MRs. However, the strategy to relay traffic was not considered.…”
Section: Introductionmentioning
confidence: 99%