
In this chapter, we look at the key issue of power allocation (PA) where the target is the competitive maximization of the information throughput sustained by each link over the network. More specifically, we focus on the concept of hierarchy which exists between different radios/systems sharing the same resources. This paradigm therefore requires a new design and framework aiming towards distributed approaches. For this reason, Game theory (GT) is used as a tool to model the interaction between several players and predict the outcome of the PA game. In particular, a special branch called hierarchical games is adopted wherein radios interact to maximize their respective payoffs following a leader-follower approach. The presented results corroborate the fact that the overall efficiency of the network is thereby improved.
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
