# Rate Allocation for Wireless Multimedia Sensor Networks Using Pricing Mechanism

Authors: Zhang Jian Ming; Wang YI; Xie Ze Ming; Tang Shi Yi; Ou Hao Yuan
Journal: Journal of Sensors
 (2015)

---

## Abstract

A bandwidth allocation algorithm for wireless multimedia sensor networks is proposed in this paper. On the premise ofInitial allocation algorithm based on distortion and congestion model to provide an efficient system performance, the allocation algorithm based on pricing mechanism we proposed balances the real-time requirement of different users by adjusting the bandwidth price in each network and each slot. Simulation results show that the proposed algorithm balances the bandwidth ratio of different users according to the video complexity, and it can provide a good system performance guaranteeing the fairness among the users.


---

## Body

## 1. Introduction

In recent years, the growing interest in the wireless sensor network (WSN) has resulted in thousands of peer-reviewed publications. Most of this research is concerned with scalar sensor networks that measure physical phenomena, such as temperature, pressure, humidity, or location of objects that can be conveyed through low-bandwidth and delay-tolerant data streams. Recently, the focus is shifting toward research aimed at revisiting the sensor network paradigm to enable delivery of multimedia content, such as audio and video streams and still images, as well as scalar data [1]. WMSNs (wireless multimedia sensor networks) technology has emerged also due to the production of cheap CMOS (complementary metal oxide semiconductor) cameras and microphones, which can acquire rich media content from the environment like images and videos. WMSNs can be defined as networks of wirelessly interconnected sensor nodes equipped with multimedia devices, such as cameras that are capable of retrieving video and audio streams, images, and scalar sensor data [2].Now the availability of complementary metal oxide semiconductor (CMOS) camera and small microphones makes the development of WMSNs capable of gathering the multimedia information from the surrounding environment possible. Its physical layer technologies can be classified based on the modulation scheme and bandwidth consideration [3] into three groups: narrow band, spread spectrum, and ultrawide band (UWB) technologies. Also they can be classified based on standard protocols into IEEE 802.15.4 ZigBee, IEEE 802.15.1 Bluetooth, IEEE 802.11 WiFi, IEEE 802.16 WiMAX, and 802.15.3a UWB.Furthermore, WMSNs can perform online processing of the retrieved information and react to it by combining technologies from diverse disciplines such as wireless communications and networking, signal processing, computer vision, control, and robotics. There are mainstream algorithms coming from two theoretic methods: centralized method and decentralized method. In many cases, the algorithms are based on game theoretic model [4] (centralized method), where all of the users need to communicate their individual videos information to decide the bit-rate allocation at each slot. This information is so complicated which will put extra burdens on the networks. Instead of using game theoretic system, a number of algorithms based on optimum theory [5, 6] are proposed to improve the overall video quality. However the high overall quality comes at the expense of lowering the quality of some videos and may affect their real-time data transmission.Compared with previous algorithms [4–6], we present a multiuser video streaming rate allocation algorithm in wireless multimedia sensor networks based on supply and demand model [7] with pricing mechanism [8]. This algorithm only requires simpler information to be exchanged and does not require a heavy computational burden, whereas that burden will occur on a central controller. This scheme is modeled on price-guided procedures discussed in the economics literature that are characterized as decentralized, as various video users (senders) only communicate their bit-rate demands in response to the bit-rate price announced by a bit-rate allocator in a slot. In our decentralized procedure, the allocator adjusts the user’s demands to equalize the aggregate allocation to the available supply and announces the price for the next slot. With this price-guided allocation scheme, instead of using bits at a constant rate, users will increase their demand in slots during which their videos are more complex (e.g., high motion) and reduce their demand in slots of low complexity. Permitting the amount of bit rate used in each slot to vary increases the efficiency of each user’s total bit rate by giving more of the resource when it is most valuable (in terms of lowering MSE (mean square error)) and less when it is less valuable. The use of a price to guide users’ choices of demand reflects the relative scarcity of available bit rate in each network and each slot. When all users request more bits than the average, scarcity is greater and the price is higher, thus moderating the demands. Our simulation results show that each user benefits from this price-based decentralized bit-rate allocation mechanism compared with the equal bit-rate allocation to all users (absolute fairness in users). The performance of this algorithm is comparable to the centralized bit-rate allocation introduced in [9], where all users send their RD (rate/distortion) curves to the allocator. In the centralized approach, the computations grow exponentially with the number of users and the central controller is responsible for all of the computations. In the decentralized approach, the computational complexity remains constant for the allocator and is independent of the number of users. Each user makes the bit-rate demand calculations independently. The pricing-based method proposed in [8] is similar to ours but only considers that all multiuser video streams are sharing a common transmission channel, and it cannot be applied to heterogeneous networks for WMSNs.The rest of the paper is organized as follows. Section2 describes theinitial allocation algorithm based on distortion and congestion model. Section 3 describes the proposed rate allocation algorithm and its process. Simulation results are given in Section 4, and Section 5 concludes the paper.


## 2. Initial Allocation Algorithm

In this section, we first briefly describe the network model and rate distortion model and then provide theinitial allocation algorithm in detail.Figure1 shows a topology of heterogeneous network simulation, supposing that there are I users sharing the available bandwidth in N networks. The video stream is divided into time slots. For user i, let R
i
,
n denote its bit rate in network n and R
i
U represent the total bit rate of user i:
(1)
R
i
U
=
∑
n
=
1
N
R
i
,
n
,
i
=
1,2
⋯
I
.Figure 1
Topology for heterogeneous network simulations.As for networkn, the total bit rate of all users is
(2)
R
n
N
=
∑
i
=
1
I
R
i
,
n
,
n
=
1,2
⋯
N
.LetC
n be the available bandwidth of network n and e
n the remaining bandwidth. Their relations can be expressed as
(3)
e
n
=
C
n
-
∑
i
=
1
I
R
i
,
n
=
C
n
-
R
n
N
,
n
=
1,2
⋯
N
.On the basis of above, we denote the congestion by the traffic flows over the network. Following the M/M/1 queuing model, the network congestion can be expressed as(4)
X
R
i
,
n
=
∑
n
=
1
N
∑
i
=
1
I
R
i
,
n
C
n
-
∑
i
=
1
I
R
i
,
n
.LetD
(
R
i
U
) denote the MSE distortion at a rate R
i
U. As given in [10], the RD curve can be fitted by
(5)
D
R
i
U
=
a
i
+
b
i
R
i
U
+
d
i
,
where the parameters a
i, b
i, and d
i are the coefficients of user i which depend on the encoding strategy and INTRA rate β
i [5]; they can be estimated by the nonlinear regression techniques. This model is widely used for RD curve fitting.As we know, the average latency of the networkn is related to its allocated rate R
n
N; increasing R
n
N would contribute to the network congestion. Meanwhile, decreasing the allocated rate would lower the congestion, but the videos would suffer extra distortion during encoding. Considering the two objectives above and the constraint of maximum rate R
i
max
⁡ and minimum R
i
min
⁡, the optimization problem can be expressed as
(6)
min
⁡
{
R
i
U
,
R
i
,
n
}
∑
i
=
1
I
a
i
+
b
i
R
i
U
+
d
i
+
k
∑
n
=
1
N
∑
i
=
1
I
R
i
,
n
C
n
-
∑
i
=
1
I
R
i
,
n
(7)
s
.
t
.
R
i
min
⁡
≤
R
i
U
≤
R
i
max
⁡
,
i
=
1,2
⋯
I
(8)
R
n
N
≤
C
n
,
n
=
1,2
⋯
N
,
where k is the weighting factor of congestion and distortion.Allowing for the fairness of allocated bandwidth in different network, the relation betweenR
i
,
n and R
i
Ucan be expressed as
(9)
R
i
,
n
=
ρ
i
,
n
R
i
U
,
n
=
1,2
⋯
N
.
In (9), the allocation ratio parameter ρ
i
,
n is a design choice to make sure that the allocated bandwidth is proportional to the observed bandwidth. As given in [5], following the weighted proportional fairness in different networks, ρ
i
,
n can be calculated as
(10)
ρ
i
,
n
=
C
i
,
n
∑
n
=
1
N
C
i
,
n
=
C
n
∑
n
=
1
N
C
n
=
ρ
n
,
where ρ
n is the proportion of C
n in the total available bandwidth.Using (4), then (9) can be derived as
(11)
R
i
,
n
=
ρ
i
,
n
R
i
U
=
ρ
n
R
i
U
.Using (11), (8) can be expressed as
(12)
∑
i
=
1
I
R
i
U
≤
∑
n
=
1
N
C
n
.Using (11) in (9), then the optimization problem becomes
(13)
min
⁡
{
R
i
U
}
∑
i
=
1
I
a
i
+
b
i
R
i
U
+
d
i
+
k
∑
n
=
1
N
∑
i
=
1
I
R
i
U
∑
n
=
1
N
C
n
-
∑
i
=
1
I
R
i
U
i
=
1,2
⋯
I
,
n
=
1,2
⋯
N
,
subject to the constraint
(14)
R
i
min
⁡
≤
R
i
U
≤
R
i
max
⁡
,
i
=
1,2
⋯
I
,
∑
i
=
1
I
R
i
≤
∑
n
=
1
N
C
n
,
i
=
1,2
⋯
I
,
n
=
1,2
⋯
N
.As given in [11], we adopt the parallel hybrid recollection algorithm to calculate theinitial allocated bandwidth.


## 3. Pricing Mechanism Allocation Algorithm

At time slott, we set the transfer rate of user i as R
i
U
t. Denote U
i
,
t
R
i
U
t to be the utility of user i at the rate of R
i
U
t. As given in [4], it can be expressed as the negative of the MSE distortion:
(15)
U
i
,
t
R
i
U
t
=
-
D
R
i
U
t
=
-
a
i
,
t
+
b
i
,
t
R
i
U
t
+
d
i
,
t
.
We set per unit of bandwidth a price, and it will fluctuate according to the supply and demand of bandwidth. At each slot, the transmitted video stream will spend an amount of wealth based on the allocated bandwidth and current bandwidth price. Before entering the system, the users will be allocated an initial wealth based on the length of the video and the initial allocated bandwidth. Therefore, as for the user, the optimization problem for the real-time rate allocation is to maximize his utility while the expended wealth over all slots is no more than the initial wealth.For useri, the transmission starts at slot T
S and ends at slot T
E. Therefore, the initial wealth W
i
,
T
S can be expressed as
(16)
W
i
,
T
S
=
T
E
-
T
S
+
1
*
R
i
U
T
S
*
p
¯
T
S
,
where p
¯
T
S is the initial bandwidth price and normalizes as p
¯
T
S
=
1 and R
i
U
T
S is the initial allocation bandwidth.Consider the optimization objective and the utility model as given, at slott
m, within the limitations of remaining wealth W
i
,
t
m; when the rate of user i reaches his maximum, his utility goes to the maximum at the same point:
(17)
max
⁡
{
R
i
U
t
}
∑
t
=
t
m
T
E
U
i
,
t
(
R
i
U
t
)
s
.
t
.
∑
t
=
t
m
T
E
p
t
*
R
i
U
t
≤
W
i
,
t
m
,
where p
t represents the bandwidth price of slot t
m.However, in the real-time transmission, the coefficients for overall future slots are unknown. Thus, we divide the overall waiting slots into two parts, the current slot and the future slots, and the optimization problem becomes(18)
max
⁡
R
i
,
t
m
req
,
R
-
i
.
t
m
req
⁡
-
a
i
,
t
m
+
b
i
,
t
m
R
i
,
t
m
req
+
d
i
,
t
m
-
T
E
-
t
m
*
a
-
i
,
t
m
+
b
-
i
,
t
m
R
-
i
,
t
m
req
+
d
-
i
,
t
m
s
.
t
.
p
t
m
*
R
i
,
t
m
req
+
T
E
-
t
m
*
p
¯
t
m
*
R
¯
i
,
t
m
req
≤
W
i
,
t
m
,
where a
¯
i
,
t
m, b
¯
i
,
t
m, and d
¯
i
,
t
m are the future average coefficients and p
¯
t
m represents the future average bandwidth price. Suppose that the future slots are stable and predictable; then the future average coefficients can be estimated by a number of slots stored in the buffer. As given in [11], considering the convex-concave feature, we use Lagrange multiplier approach to calculate the request bandwidth as follows:
(19)
R
i
,
t
m
req
=
b
i
,
t
m
p
t
m
+
W
i
,
t
m
+
p
t
m
*
d
i
,
t
m
+
T
E
-
t
m
*
p
¯
t
m
*
d
¯
i
,
t
m
p
t
m
*
b
i
,
t
m
+
T
E
-
t
m
*
p
¯
t
m
*
b
¯
i
,
t
m
-
d
i
,
t
m
,
i
=
1,2
⋯
I
.
As the stationary of video stream, we can set p
¯
t
m
=
1.Since the request bandwidth of all users will not be equal to the available bandwidth, the central controller will normalize the total request bandwidth to allocate available bandwidth as the supply and demand(20)
R
i
U
t
m
=
∑
n
=
1
N
C
n
,
t
m
*
R
i
,
t
m
req
∑
i
=
1
I
R
i
,
t
m
req
and adjust the bandwidth price of the next slot:
(21)
p
t
m
+
1
=
p
t
m
+
μ
p
∑
i
=
1
I
R
i
,
t
m
req
-
∑
n
=
1
N
C
n
,
t
m
∑
n
=
1
N
C
n
,
t
m
.Users encode the video streams according to the allocated bandwidthR
i
U
t
m and transmit through different networks as the allocation ratio parameter ρ
i
,
n:
(22)
R
i
,
t
m
n
=
ρ
i
,
n
R
i
U
t
m
.
Then, update the remaining wealth of slot t
m
+
1 by the cost:
(23)
W
i
,
t
m
+
1
=
W
i
,
t
m
-
p
t
m
*
R
i
U
t
m
.
Here, we will represent the algorithm flow.Step 1 (initialization).
According to the coefficients of different video streams, the central controller calculates the initial allocated bandwidth by using (13), and by (16), each user calculates his initial wealth separately.Step 2 (request bandwidth calculation).
At slott
m, each user calculates his request bandwidth by (19) and transfers to the central controller.Step 3 (bandwidth allocation and price adjustment).
According to the request bandwidth ratio of different users, central controller calculates the allocated bandwidth by (20) and uses (21) to adjust the bandwidth price of slot t
m
+
1.Step 4 (transmission and remaining wealth updating).
Using (22), users allocate the bit rate to different networks and update their remaining wealth of slot t
m
+
1 by using (23).Step 5 (judgment).
Repeat Step2 to Step 4 until all videos are transferred.


## 4. Simulation Results

Simulation results are performed in a heterogeneous network which consists of three different multimedia sensor networks. The number of users is three and the coefficients of the videos are shown in Table1.Table 1
Video coefficients of three users.
β
i
R
i
min
⁡
R
i
max
⁡
U
1
0.0409
0.4998 Mbps
7.1134 Mbps
U
2
0.0025
3.0692 Mbps
22.3412 Mbps
U
3
0.0021
2.4581 Mbps
15.0274 MbpsTo start with, we chose 6 increasing available bandwidth scenarios (Table2) to simulate theinitial allocation algorithm and compare with absolute-fairness-among-users (AFU) and absolute-fairness-in-distortion (AFD) algorithms.Table 2
Available bandwidth scenarios.
C
1
C
2
C
3
C
1 + C
2 + C
3
1
21.2 Mbps
10.5 Mbps
3.2 Mbps
45.6 Mbps
2
24.7 Mbps
11.9 Mbps
3.5 Mbps
52.9 Mbps
3
29.4 Mbps
14.1 Mbps
3.9 Mbps
62.7 Mbps
4
33.1 Mbps
15.9 Mbps
4.5 Mbps
70.7 Mbps
5
37.1 Mbps
17.7 Mbps
5.6 Mbps
79.8 Mbps
6
40.9 Mbps
19.7 Mbps
5.8 Mbps
87.6 MbpsIn Figure2, we compare the PSNR (peak signal-to-noise ratio) of the three algorithms. It can be noticed that the initial allocation leads to much higher PSNR compared with the other algorithms. This is because the initial allocation considers the distortion of all video streams and seeks to improve the overall performance of PSNR. The AFU treats the flows with equal importance and takes no consideration of the source characteristics, which may lead to the unused bandwidth in simple videos and the increased distortion in complex videos due to the insufficient bit rate. Under the smaller bandwidth scenarios, the AFD performs close to the initial allocation. However, as the bandwidth is increasing, the gap is widening. This is because AFU just considers the absolute distortion rate and takes no account of the overall performance, which would have a limited improvement when bandwidth increases.Figure 2
PSNR comparison under 6 available bandwidth scenarios.Figure3 compares the average delivery delay under scenario 1 and scenario 4. In AFU and AFD algorithms, the average delivery delay would be higher; that is because allocated bit rates are reduced only after the congestion has been detected, and the congestion is lasting for a while. Theinitial allocation algorithm, on the other hand, considers the network latency and tries to avoid overcongestion by using a proactive strategy in the optimizing model, which significantly lower the average delay.Average delivery delay comparison under scenarios 1 and 4.
(a)
Scenario 1{
C
1
=
21.2 Mbps, C
2
=
10.5 Mbps, C
3
=
3.2 Mbps}
(b)
Scenario 4{
C
1
=
33.1 Mbps, C
2
=
15.9 Mbps, C
3
=
4.5 Mbps}In the second stage, we simulate the real-time allocation algorithm under the same environment and compare it to AFU and media-aware algorithm [6]. As given in [12], we chose the FORWARD and BACKWARD prediction to estimate the future coefficients and calculate the request bandwidth.In Figure4, we notice that the overall PSNR of media-aware algorithm and our algorithm are very close and much higher than AFU. That is, both of the two methods consider the overall MSE distortion and provide good overall performance.Figure 4
PSNR comparison under 6 available bandwidth scenarios.As for the users, we compare their PSNR separately in Figure5; it is shown that, as for the simple videos, the proposed allocation algorithm gets a little bit lower PSNR than media-aware algorithm does, while being significantly higher for the complex videos. It is because the objective of media-aware method is to allocate the bandwidth prior to simple videos and to get the maximum of the PSNR. It does better in improving the total PSNR than our method; however, not all users improve their video quality, especially on the condition of small bandwidth; some complex videos suffer worse PSNR compared with AFU (as shown in Figure 5(c)). As given in [13], this allocated result would have no improvement in video quality and make an impact on the normal use. In contrast, our method balances the bandwidth ratio between simple video and complex video; so all users are better than AFU and guarantee their video qualities. In general, under the similar total PSNR conditions, considering the fairness among users, our proposed method guarantees all users improve their quality, which is better than media-aware algorithm.PSNR comparison for different users under 6 available bandwidth scenarios.
(a)
PSNR comparison of user 1
(b)
PSNR comparison of user 2
(c)
PSNR comparison of user 3


## 5. Conclusion

In this paper, considering the overall video performance in wireless multimedia sensor networks and the fairness among the users, we have proposed a bit-rate allocation algorithm for multiuser video streaming based on pricing mechanism.As the simulation results show, on the premise ofinitial allocation algorithm based on distortion and congestion model to provide a good overall video performance and money limitation, the real-time allocation algorithm proposed utilizes the fluctuation of bandwidth price to adjust the rate of different users, which balances the bandwidth ratio of different users in different networks according to the video complexity. In comparison with existing methods [6], our method improves the overall system performance and guarantees the individual video quality among the users, whereas previous methods, focusing on improving the overall quality only, make some users improve at the expense of others.



---

*Source: 738565-2015-01-22.xml*