Table 1 Parameters used in the proposed algorithm
From: Dynamic position changeable Stackelberg game for user-provided network control algorithms
Notations | Explanation |
|---|---|
B | The set of eNBs where B = {B 1…B n } |
G | The set of UEs where E = {E 1…E y } |
G h | The subset of hosts G h ⊂ G |
\( {G}_k^h \) | The k th host where \( {G}_k^h\in {\mathbf{G}}^{\boldsymbol{h}} \) |
G c | The subset of clients G c ⊂ G |
\( {G}_i^c \) | The i th client where \( {G}_i^c\in {\mathbf{G}}^{\boldsymbol{c}} \) |
G n | The subset of UEs, which temporarily give up service requests where G n ⊂ G |
\( {G}_l^n \) | The l th UE where \( {G}_l^n\in {\mathbf{G}}^{\boldsymbol{n}} \) |
\( {\boldsymbol{S}}_h^G \) | The set of host’s strategies |
\( {s}_j^h \) | The j th price level for client’s communications where \( {s}_j^h\in {\boldsymbol{S}}_h^G \) |
\( {\boldsymbol{S}}_c^G \) | The set of client’s available strategies |
\( {U}_h^G \) | The payoff received by the host |
\( {U}_c^G \) | The payoff received by the client |
\( {L}_G^s \) | The learning value for the host’s strategy s |
\( {\boldsymbol{N}}_{G_k^h} \) | The set of \( {G}_k^h \)’s neighboring hosts |
\( {P}_h^{G_k^h}\left(\cdotp \right) \) | The price function to clients |
\( {C}_h^{G_k^h}\left(\cdotp \right) \) | The cost function of \( {G}_k^h \), |
\( {D}_h^{G_k^h}\left(\cdotp \right) \) | The expense function of \( {G}_k^h \) |
\( {r}_c^{G_i^c} \) | The bandwidth amount of \( {G}_i^c \)’s UPN service |
\( {F}^s\left(\cdotp \right) \) | The G’s UPN price strategy per bit where \( {F}^s\left(\cdotp \right)\in {\boldsymbol{S}}_h^G \) |
α | The connected eNB’s minimum charge |
\( {\Theta}^B\left(\cdotp \right) \) | The current bandwidth utilization |
\( {m}_h^{G_k^h} \) | The \( {G}_k^h \)’s the expense factor per bit of UPN services |
\( {U}_c^{G_i^c}\left(\cdotp \right) \) | The utility function of the client \( {G}_i^c \) |
\( {Q}_c^{G_i^c}\left(\cdotp \right) \) | The outcome function of \( {G}_i^c \) |
\( I\left(\cdotp \right) \) | The charge function of \( {G}_i^c \) |
\( {K}_c^{G_i^c}\left(\cdotp \right) \) | The expense function of \( {G}_i^c \) |
\( {\psi}_c^{G_i^c} \) | \( {G}_i^c \)’s satisfaction factor per bit of UPN service |
\( {\zeta}_c^{G_i^c} \) | \( {G}_i^c \)’s expense factor per bit of UPN service |
\( {PS}_B\left(\cdotp \right) \) | The B’s price strategy |
\( {\phi}_{H_t}^{G_k}\left({B}_j\right) \) | The allocated RU amount for the G k at time H t in the B j , |
\( {\vartheta}_{H_t}^{G_k} \) | The amount of RU requested by the G k at time H t |
\( {R}_{H_t}^{B_j} \) | The available RU amount of B j |
A(B j ) | The set of UEs, which request new RUs from the B j |
\( {\gamma}_{H_t}^{G_l} \) | The G l ’s bargaining power at time H t |
\( {\mathcal{E}}_{H_t}^{G_l} \) | The entropy for the G l at the time H t |
\( {F}_{G_l} \) | The set of the neighboring UEs of G l |
O(G l , G f ) | The relative mobility among two G l and G f |
x | The learning rate that models how the L-values are updated |
Λ(B g ) | The set of hosts, which are connected to the B g |
v | The individual value |
w | The social learning value |
β | The control factor for the weighted average between different learning approaches |
P | The strategy selection distribution for each host |
\( {p}_{s_j^h}^{G_k^h}\left({H}_t\right) \) | The \( {s}_j^h \) strategy selection probability by the \( {G}_k^h \) at time H t |
Îş | The service success ratio in the UPN system |
Ď„ | The delay rate in the UPN system |
\( \mathcal{z} \) | The UPN system throughput |