<figure><img src="image_1.png" /></figure>

HAL
open science

# Distributed Quality-Aware Resource Allocation for Video Transmission in Wireless Networks

Chao He, Zhidong Xie, Chang Tian

► To cite this version:

Chao He, Zhidong Xie, Chang Tian. Distributed Quality-Aware Resource Allocation for Video Transmission in Wireless Networks. 16th IFIP International Conference on Network and Parallel Computing (NPC), Aug 2019, Hohhot, China. pp.56-65, 10.1007/978-3-030-30709-7_5 . hal-03770523

HAL Id: hal-03770523

https://inria.hal.science/hal-03770523v1

Submitted on 6 Sep 2022

**HAL** is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_2.png" /></figure>

Distributed under a Creative Commons CC BY 4.0 - Attribution - International License
<figure><img src="image_3.png" /></figure>

ifip

International Federation for Information Processing

This document is the original author manuscript of a paper submitted to an IFIP
conference proceedings or other IFIP publication by Springer Nature. As such, there
may be some differences in the official published version of the paper. Such
differences, if any, are usually due to reformatting during preparation for publication or
minor corrections made by the author(s) during final proofreading of the publication
manuscript.
# Distributed Quality-aware Resource Allocation for Video Transmission in Wireless Networks*

Chao He¹,², Zhidong Xie¹,²✉, and Chang Tian¹

¹ College of Communications Engineering, Army Engineering University of PLA, Nanjing 210007, China

² National Innovation Institute of Defense Technology, Academy of Military Sciences of PLA, Beijing 100071, China
xzd313@163.com

**Abstract.** The rapid development of wireless networks makes it more convenient for people to enjoy high quality multimedia. However, video applications are throughput-demanding, and relatively, radio resource always seems insufficient. Hence, a distributed algorithm is designed in this paper to allocate the limited wireless resource among multiple users for video streaming. In order to specify multimedia service from other ordinary data transmission, the QoE-oriented utility function is considered first. Then, a potential game model is formulated and all the video receivers can update their rate strategies with very little information exchange. By this kind of updating, the bandwidth allocation could be achieved intelligently. The algorithm converges to a set of correlated equilibria. Numeric simulation results indicate that it brings remarkable benefits to both the resource provider and the video users.

**Keywords:** Distributed algorithm · Resource allocation · QoE · Potential game.

## 1 Introduction

The massive layout of different wireless networks makes handheld devices more and more pervasive. Meanwhile, High Definition(HD) and Ultra High Definition(UHD) multimedia gradually bring people high-grade visual experience. When delivered in wireless network, high definition videos need more available bandwidth. Although they have been greatly compressed by video coding algorithms, such as H.265/HEVC, wireless networks still can not afford the burdens when users become abundant. Thus, it's very crucial to properly allocate the limited bandwidth resource to different video terminals.

Some literatures solved the rate allocation problems by improving the Quality of Service(QoS) and formulating them as optimization problems[1, 7, 18]. Meanwhile, we can find that game theory has been widely used in tackling with these issues and gotten very good effects. [17] established a two-level game

* This work was funded by the Project of Natural Science Foundations of China (No. 91738201 and 61401507).
framework, with an evolutionary game for underlying service and a differential game for upper bandwidth selection. [9] proposed a Stackelberg dynamic game model to get the optimal allocated resources. [4] modeled resource competition as the process of replicator dynamics and formulated a decentralized way to deal with task offloading. However, some of them were not about video transmission, or some of the utility functions could not effectively describe the Quality of Experience(QoE) of video application. Some others [3, 5, 11, 13] studied the QoE and solved the allocation problems of handing off and interface selection, etc. Compared with game theory, they often followed a traditional optimization-based approach. [16] formulated the issue as a cooperative bargaining problem of game theory. It also took both the QoE and fairness into account. But they need a proxy server to allocate the bandwidth collaboratively. Thus, the robust of the system may mainly depend on the server which could be invaded and influenced easily.

In this paper, we propose a distributed rate allocation framework and con-
struct a potential game model so that the bandwidth can be allocated in a
reasonable and efficient way. The total utility of all users is our primary consid-
eration and we fully consider the users' experience. After several iteration, the
algorithm will converge to correlated equilibria and each receiver will choose and
keep a proper transmission rate. The rest of this paper is organized as follows.
In Section 2, we describe the system in detail and discuss our preliminary goal.
Also, the utility function is introduced here. In Section 3, we model the problem
as a potential game and prove the existence of correlated equilibrium. Section 4
follows the way of regret-matching to solve the model. The experimental results
and some discussions are settled in Section 5. And we draw the conclusions in
Section 6.

2 System Model and Utility Function

## 2.1 System Model

Fig.1 presents the typical scenario we discuss. There are N Unmanned Aerial Vehicles(UAV) flying in the coverage of the same access point(AP) and all of them are equipped with Wireless Cameras(WC). Thus, the UAV platforms have the functions of recording and compressing videos, and then, they send the encoded videos to the Video Processing Center(VPC) via the wireless network. All videos are finally edited there together for all kinds of commercial purposes. Because the AP is owned by a Network Service Provider(NSP), as the receiver of the communication, the VPC should lease the wireless channels from the NSP. In order to gain good total video experience, the limited wireless resource should be allocated properly among the UAVs.

Suppose *Cband* is the total constant throughput provided by the AP. *r*<sub>*i*</sub> denotes the channel rate for the *i*-th WC (*WC*<sub>*i*</sub>), which varies from the minimum rate constraint *R*<sub>*i*</sub><sup>min</sup> to the maximum one *R*<sub>*i*</sub><sup>max</sup>, *i* = 1, 2, ..., *N*. *R* = [*r*<sub>1</sub>, *r*<sub>2</sub>, ..., *r*<sub>*N*</sub>] denotes the rate vector of the *N* WCs and the utility function vector is *U* = [*u*<sub>1</sub>, *u*<sub>2</sub>, ..., *u*<sub>*N*</sub>],
<figure><img src="image_4.png" /><figcaption>Fig. 1: Video transmission network</figcaption></figure>

correspondingly. In order to send back high quality video, each WC intends to magnify their own utilities:

$$
\begin{align}
\max \quad & u_i \nonumber \\
\text{s.t.} \quad & R_i^{\min} \le r_i \le R_i^{\max} \nonumber \\
& 0 \le \sum_{i=1}^{N} r_i \le C_{band} \tag{1}
\end{align}
$$

2.2 QoE-based Utility

In ordinary data transmission, the utility is always formulated as the function of
QoS. However, users and service providers focus more on the QoE. Peak Signal
to Noise Ratio(PSNR) is a typical video quality assessment (VQA) metric based
on the error statistics of pixel domain. Some studies regarded the mapping rela-
tion between PSNR and Mean Opinion Score(MOS) as a straight line[8][15]. But
figures in [10] and [14] show that the mapping is closer to a sigmoid function.
Anyhow, an effective expression of PSNR could properly describe the variation
trend of video MOS. Furthermore, PSNR has the lowest complexity among many
evaluation methods[10], which makes it more convenient to use in real-time ser-
vices. In this paper, we adopt the formula in [2] and the utility of video of WC<sub>i</sub>
can be expressed as

$$
\begin{align}
u_i &= PSNR(r_i) - P(r_i) \nonumber \\
    &= a + b \cdot \sqrt{\frac{r_i}{c}} \left(1 - \frac{c}{r_i}\right) - P(r_i) \tag{2}
\end{align}
$$

where $P(r_i)=\theta \cdot \frac{r_i}{C_{band}}$ is the price the VPC pays for the channel leasing of WC$_i$
and $\theta$ is the price constant.
### 3 Potential Game Based Resource Allocation

From the view of individual, the WC$_i$ intends to maximize its channel rate so that its QoE will be favorable. However, it's not allowed too much channel occupation, because the whole bandwidth the NSP can provide is limited and the VPC has to concentrate on maximizing the total utility rather than the single ones. This makes the problem complex. In this paper, we regard it as decentralized process and model the problem as a potential game. The game is denoted as $G = [\Omega, \{R_i\}_{i \in \Omega}, \{U_i\}_{i \in \Omega}]$, where $\Omega = \{1, 2, ..., N\}$ is the set of players. $R_i$ represents the strategy of the i-th player and $U_i$ is the utility correspondingly. It's hoped that, by very little information exchange, everyone can choose proper strategy and no one will break the equilibrium.

In this section, we construct a potential function as: $I = \sum_{i=1}^{N} u_i$ and the problem can be presented as:

$$ 
\begin{array}{ll}
\max & I = \sum_{i=1}^{N} \{a + b \cdot \sqrt{\frac{r_i}{c}}(1 - \frac{c}{r_i})\} - P(\sum_{i=1}^{N} r_i) \\
\text{s.t.} & R_i^{\min} \le r_i \le R_i^{\max} \\
& 0 \le \sum_{i=1}^{N} r_i \le Cband
\end{array}
\qquad (3) $$

where $P(\sum_{i=1}^{N} r_i) = \theta \cdot \frac{\sum_{i=1}^{N} r_i}{Cband}$ means the price the VPC pays for all the N channel leasing. The more the bandwidth is occupied in the AP, the more the VPC should pay for it, which will cut its benefits in another way. On the other hand, NSP can also effectively guarantee the quality of the network and avoid congestion by changing the price.

**Proposition 1.** Each WC selfishly switches its rate strategy will lead to a near optimal solution to the whole utility of the VPC and the game G we propose is a standard potential game.

*Proof.* We set another rate strategy for WC$_i$ as $r'_i$. Because the potential function I is the sum of the single utilities, we can get

$$ \Delta I = I(r_i) - I(r'_i) = u(r_i) - u(r'_i) = \Delta u \qquad (4) $$

The variation of the potential function equals to the difference value of the utility function. According to [12], we know that game G is a standard potential game.

**Proposition 2.** The correlated equilibrium uniquely exists in this model.

*Proof.* From equation (3), we can get the partial derivative of the potential function

$$ \frac{\partial I(r_i)}{\partial r_i} = \frac{b}{2\sqrt{cr_i}} + \frac{b\sqrt{c}}{2\sqrt{r_i^3}} - \frac{\theta}{Cband} \qquad (5) $$
As $\frac{b}{2\sqrt{c}r_i} + \frac{b\sqrt{c}}{2\sqrt{r_i^3}} > 0$ and $\frac{\theta}{Cband} > 0$, there exists $r_i=\tilde{r}_i$, which makes equation (5) identically equal to zero.

Then, we get the second-order partial derivative of equation (3) at $r_i=\tilde{r}_i$

$$ \left. \frac{\partial^2 I(r_i)}{\partial r_i^2} \right|_{r_i=\tilde{r}_i} = - \frac{b}{4\sqrt{c}\sqrt{\tilde{r}_i^3}} - \frac{3b\sqrt{c}}{4\sqrt{\tilde{r}_i^5}} \quad (6) $$

Because $\frac{b}{4\sqrt{c}\sqrt{\tilde{r}_i^3}} > 0$ and $\frac{3b\sqrt{c}}{4\sqrt{\tilde{r}_i^5}} > 0$, we can get $\left. \frac{\partial^2 I(r_i)}{\partial r_i^2} \right|_{r_i=\tilde{r}_i} < 0$. The results show that, if WC$_i$ doesn't choose the data rate $\tilde{r}_i$, a higher total utility will not be obtained.

# 4 Resource Allocation Algorithm

Literature [6] discussed a simple adaptive procedure leading to correlated equilibrium and provided the way of "regret-matching". According to this method, and also on the basis of the game model we build above, a distributed algorithm can be obtained to reach correlated equilibrium as follows:

**Initialization:** At the initial time when $t=1$, each WC can get the minimum rate of the video to start its strategy. As a matter of fact, the rate can be selected arbitrarily within the range. Meanwhile, a strategy space {$R$-space} is formulated.

**Iterative Update Process:**

**Strategy Update:** At the time $t \ge 2$, each WC calculates the utility of the current strategy $r_i$ and the utility for choosing another strategy $r'_i$. The average difference between $r_i$ and $r'_i$ needs to be calculated as:

$$ L_i^t(r_i, r'_i) = \frac{\lambda}{t} L_i^\lambda(r_i, r'_i) + \frac{1}{t} [u_i^t(r'_i) - u_i^t(r_i)] \quad (7) $$

where $\lambda$ denotes for time and $\lambda \le t$. Then $R_i^t(r_i, r'_i) = \max\{L_i^t(r_i, r'_i), 0\}$ and it's a measure of "regretting" [6].

**Strategy Decision:** Suppose $r_i$ is chosen by player $i$ at time $t$. Then, at time $t+1$, the strategy will be reconsidered and it will follow the probability distribution:

$$ \left\{ \begin{array}{l} \pi_i^{t+1}(r'_i) = \frac{1}{\mu} R_i^t(r_i, r'_i) \quad \forall r'_i \neq r_i \\ \pi_i^{t+1}(r_i) = 1 - \sum_{r'_i \neq r_i} \pi_i^{t+1}(r'_i) \end{array} \right. \quad (8) $$

where $\mu > 0$ is large enough. According to the distribution, we can choose a more proper strategy within the space {$R$-space} who has a higher possibility. After multiple iterations, the results won't be changed and the equilibrium will be achieved.
# 5 Simulation Results and Analyses

We conduct some simulations to evaluate the scheme we propose. It's assumed that 3 UAVs fly in the AP's coverage area as Fig.1. They shoot and record independently and send back 3 different compressed videos, Carphone, Coastguard and Football to the VPC. The minimum and maximum rates are shown in Table 1 and their different styles are also listed.

<table><caption>Table 1: Parameters of different videos</caption><thead><tr><td></td><td>R<sub>i</sub><sup>min</sup>(kb/s)</td><td>R<sub>i</sub><sup>max</sup>(kb/s)</td><td>Style</td></tr></thead><tbody><tr><td>Carphone</td><td>20.2554</td><td>322.0153</td><td>medium motion and smooth scene</td></tr><tr><td>Coastguard</td><td>28.4987</td><td>878.8011</td><td>medium motion and complex scene</td></tr><tr><td>Football</td><td>286.311</td><td>1720</td><td>fast or complex motion</td></tr></tbody></table>

Fig.2 plots the real-time video transmission rates and the total utilities of the three when the channel adopts two different bandwidth values. We can find that when $Cband = 20Mbps$, which means the channel can offer sufficient bandwidth, each video can be encoded and transmitted at the maximum of their rates. The faster and the complexer the videos are, the more resource they will occupy. While the resource is insufficient, $Cband = 2Mbps$, video Carphone and Coastguard should decrease their rates correspondingly, so that the whole utility can still maintain at a proper level. The utility of our distributed algorithm is very close to the optimal one who takes the global information exchanges. From Fig.2 we also find that after about 20 iterations, all the curves become smooth and steady, which means the system converges to the equilibrium in a very short time by our scheme.

The total bandwidth of the channel can obviously affect the results of resource allocation. Fig.3 shows the final results at different values of $Cband$. From the aspect of different video styles, we can find that the slight insufficiency of bandwidth will first influence the videos which are fast and complex, while the medium and smooth videos are affected relatively less. When the channel condition becomes much worse, less than 1Mbps, all the videos have to reduce their rates. Correspondingly, the total utility increases along with the total bandwidth and the results of our scheme are very close to the optimal solutions at different rates.

Not only the bandwidth of the channel, but also the price parameter $θ$ can influence the results. In Fig.4, we vary the price factor $θ$ and keep the total channel bandwidth at 3Mbps. When $θ$ increases, the rate of Football decreases obviously. When it's greater than 3.5, Coastguard's rate also reduces. From the total utility curves, we can find the decrease, too. Thus, the NSP, as the resource provider, can easily control both the bandwidth allocation and the robust of the network by adjusting the price parameter.
<figure><img src="image_5.png" /><figcaption>Fig. 2: Number of iterations versus flow rate and total utility</figcaption></figure>

<figure><img src="image_6.png" /><figcaption>Fig. 3: The influence of total bandwidth $Cband$</figcaption></figure>
<figure><img src="image_7.png" /><figcaption>Fig. 4: The influence of price parameter θ</figcaption></figure>

## 6 Conclusion

Both the dramatic growth of mobile users and the improvement of video quality has made the bandwidth competition of wireless network much fiercer. In this paper, a distributed algorithm was designed to allocate the limited resource among multiple users in order to gain a better total QoE utility of all videos. A model based on potential game theory was constructed and a distributed algorithm was leveraged to solve it. The results could rapidly converge to a set of correlated equilibria. Simulation implied that the proposed strategy could provide a favorable way to solve the resource allocation problem for video transmission.
Bibliography

[1] Bai, X., Li, Q., Tang, Y.: A low-complexity resource allocation algorithm for indoor visible light communication ultra-dense networks. Appl. Sci. 9(7) (2019)

[2] Choi, L.U., Ivrlac, M.T., Steinbach, E., Nossek, J.A.: Sequence-level models for distortion-rate behaviour of compressed video. In: IEEE International Conference on Image Processing 2005. vol. 2, pp. II-486 (Sep 2005). http-s://doi.org/10.1109/ICIP.2005.1530098

[3] Deng, Z., Liu, Y., Liu, J., Zhou, X., Ci, S.: Qoe-oriented rate allocation for multipath high-definition video streaming over heterogeneous wireless access networks. IEEE Syst. J. 11(4), 2524-2535 (Dec 2017). http-s://doi.org/10.1109/JSYST.2015.2430893

[4] Dong, C., Wen, W.: Joint optimization for task offloading in edge computing: An evolutionary game approach. Sensors 19 (2019)

[5] Elgabli, A., Elghariani, A., Aggarwal, V., Bell, M.: Qoe-aware resource allocation for small cells. In: 2018 IEEE Global Communications Conference (GLOBECOM). pp. 1-6 (Dec 2018). http-s://doi.org/10.1109/GLOCOM.2018.8647828

[6] Hart, S., Mas-Colell, A.: A simple adaptive procedure leading to correlated equilibrium. Econometrica 68(5), 1127-1150 (2000)

[7] Jiang, Q., Leung, V.C.M., Tang, H., Xi, H.: Qos-guaranteed adaptive bandwidth allocation for mobile multiuser scalable video streaming. IEEE Wireless Commun. Lett. pp. 1-1 (2018). http-s://doi.org/10.1109/LWC.2018.2889078

[8] Khan, S., Duhovnikov, S., Steinbach, E., Kellerer, W.: Mos-based multiuser multiapplication cross-layer optimization for mobile multimedial communication. Adv. MultiMedia 2007(1), 6-6 (Jan 2007). http-s://doi.org/10.1155/2007/94918, http://dx.doi.org/10.1155/2007/94918

[9] Liu, B., Xu, H., Zhou, X.: Stackelberg dynamic game-based resource allocation in threat defense for internet of things. Sensors 18 (2018)

[10] Moorthy, A.K., Seshadrinathan, K., Soundararajan, R., Bovik, A.C.: Wireless video quality assessment: A study of subjective scores and objective algorithms. IEEE Transactions on Circuits and Systems for Video Technology 20(4), 587-599 (April 2010). http-s://doi.org/10.1109/TCSVT.2010.2041829

[11] Sarma, A., Chakraborty, S., Nandi, S.: Deciding handover points based on context-aware load balancing in a wifi-wimax heterogeneous network environment. IEEE Trans. Veh. Technol. 65(1), 348-357 (Jan 2016). http-s://doi.org/10.1109/TVT.2015.2394371

[12] Scutari, G., Barbarossa, S., Palomar, D.P.: Potential games: A framework for vector power control problems with coupled constraints. In: 2006 IEEE International Conference on Acoustics Speech and Sig-
nal Processing Proceedings. vol. 4, pp. IV–IV (May 2006). http-
s://doi.org/10.1109/ICASSP.2006.1660950

[13] Senouci, M.A., Souihi, S., Hoceini, S., Mellouk, A.: Qoe-based net-
work interface selection for heterogeneous wireless networks: A sur-
vey and e-health case proposal. In: 2016 IEEE Wireless Commu-
nications and Networking Conference. pp. 1–6 (April 2016). http-
s://doi.org/10.1109/WCNC.2016.7564979

[14] Seshadrinathan, K., Soundararajan, R., Bovik, A.C., Cormack, L.K.: S-
tudy of subjective and objective quality assessment of video. IEEE
Transactions on Image Processing 19(6), 1427–1441 (June 2010). http-
s://doi.org/10.1109/TIP.2010.2042111

[15] Thakolsri, S., Kellerer, W., Steinbach, E.: Qoe-based cross-layer optimiza-
tion of wireless video with unperceivable temporal video quality fluctuation.
In: 2011 IEEE International Conference on Communications (ICC). pp. 1–6
(June 2011). https://doi.org/10.1109/icc.2011.5963296

[16] Yuan, H., Wei, X., Yang, F., Xiao, J., Kwong, S.: Cooperative bargaining game-based multiuser bandwidth allocation for dynamic adaptive streaming over http. IEEE Trans. Multimedia 20(1), 183–197 (Jan 2018). http-s://doi.org/10.1109/TMM.2017.2724850

[17] Zhu, K., Niyato, D., Wang, P.: Optimal bandwidth allocation with dynamic service selection in heterogeneous wireless networks. In: 2010 IEEE Global Telecommunications Conference GLOBECOM 2010. pp. 1–5 (Dec 2010). https://doi.org/10.1109/GLOCOM.2010.5683238

[18] Zhu, L., Zhan, C., Hu, H.: Transmission rate allocation for reliable video transmission in aerial vehicle networks. In: 2018 14th International Wireless Communications Mobile Computing Conference (IWCMC). pp. 30–35 (June 2018). https://doi.org/10.1109/IWCMC.2018.8450454