Open Access

An Optimization Theoretic Framework for Video Transmission with Minimal Total Distortion over Wireless Networks

  • Pejman Goudarzi1Email author,
  • MohammadHesam Tadayon1 and
  • Mahmoud Mousavinejad1
EURASIP Journal on Wireless Communications and Networking20092009:598063

Received: 17 February 2008

Accepted: 10 January 2009

Published: 24 February 2009


Optimization theoretic-based rate allocation strategies can be used for the aim of allocating some optimal rates to the competing users in wireless ad hoc networks. By considering different objective functions (such as congestion level, total packet loss, etc.), the researchers propose some optimization framework by which the problem can be solved. Due to the rapid increase in the development of different video applications in such environments and the existence of difficulties in satisfying the prespecified QoS limits, increasing the perceived video quality can be considered as an important and challenging issue. The quality of the received video stream is inversely proportional to the amount of distortion which is being imposed on the video stream by the network packet loss and the video encoder. The main contribution of the current paper is to introduce an optimization theoretic framework in which by optimal rate allocation to some competing video sources, the aggregate distortion associated with all of the sources can be minimized. The numerical results verify the claims.

1. Introduction

Convex optimization theory is an important tool for many rate allocation algorithms in wireline or wireless networks. Wireless ad hoc networks are computer networks in which the communication links are wireless. The network is ad hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. This is in contrast to wired network technologies in which some designated nodes, usually with custom hardware (variously known as routers, switches, hubs, and firewalls), perform the task of switching and forwarding the data. Ad hoc networks are also in contrast to managed wireless networks, in which a special node known as an access point manages communication among other nodes. Ad hoc networks can form a network without the aid of any pre-established infrastructure [1].

The requirements of a specific set of QoS parameters (delay, jitter, packet loss, etc.) must be guaranteed for each real-time application. However, for most real-time applications of wireless ad hoc networks, intrinsic time-varying topological changes provide challenging issues in guaranteeing these stringent QoS requirements.

Due to dynamic nature of these networks, traditional routing protocols are useless. So, special proactive/reactive multihop routing protocols such as DSDV/AODV are developed. Some of these routing protocols introduce more than one feasible path for a source-destination pair. These categories of routing algorithms are called multipath routing algorithms [2]. Multipath routing schemes can reduce interference, improve connectivity, and allow distant nodes to communicate efficiently [2]. In multipath routing, multiple multihop routes or paths are used to send data to a given destination. This allows a higher spatial diversity gain and throughput between source and destination nodes. On the other hand, it is obvious that inherent load balancing feature of the multipath routing algorithms has the capability of reducing the congestion as well as increasing the throughput of the user traffic in multihop wireless ad hoc networks. Moreover, using multiple paths between any source-destination pair can improve the important reliability and availability features of the routing strategy.

Multipath routing can provide both diversity and multiplexing gain between source and destination. However, multihop and multipath routing can also increase the total packet loss between the source and destination, especially if there is congestion in the paths or if the bit error rate of the paths is high due to the bad wireless link conditions (existence of high noise or interference levels). Therefore, supporting multimedia data with stringent maximum loss requirement over multihop ad hoc networks with multipath routing can be considered as an important and challenging research area.

Sending multimedia traffic over wireless ad hoc networks is a challenging issue, and many active research areas exist that all try to propose a solution to the problem from different points of view.

Some researchers such as those in [3, 4] try to use adaptive link layer techniques for throughput optimization. The authors in [4] propose a mathematical framework in which they vary adaptively the constellation size of an MQAM modulator in order to maximize the single user throughput.

In [5, 6] a congestion-minimized stream routing approach is adopted. In [6] the authors analyze the benefits of an optimal multipath routing strategy which seeks to minimize the congestion, on the video streaming, in a bandwidth limited ad hoc wireless network. They also predict the performance in terms of rate and distortion, using a model which captures the impact of quantization and packet loss on the overall video quality.

Some researchers such as Agarwal [7], Adlakha [8], and Zhu [9] follow some congestion-aware and delay-constrained rate allocation strategies. Agarwal and Goldsmith [7] introduce a mathematical constrained convex optimization framework by which they can jointly perform both rate allocation and routing in a delay-constrained wireless ad hoc environment. Adlakha et al. extend the conventional-layered resource allocation approaches by introducing a novel cross-layer optimization strategy in order to more efficiently perform the resource allocation across the protocol stack and among multiple users. They showed that their proposed method can support simultaneous multiple delay-critical application sessions such as multiuser video streaming [8].

For multipath video streaming over ad hoc wireless networks, received video quality is influenced by both the encoder performance and the delayed packet arrivals due to limited bandwidth. Hence, Zhu et al. propose a rate allocation scheme to optimize the expected received video quality based on simple models of encoder rate-distortion performance and network rate-congestion trade-offs [9]. As the quality of wireless link varies, video transmission rate needs to be adapted accordingly.

In [6], Setton et al. analyzed the benefits of optimal multipath routing on video streaming in a bandwidth-limited ad hoc network. They show that in such environments the optimal routing solutions which seek to minimize the congestion are attractive as they make use of the resources efficiently. For low-latency video streaming, they propose to limit the number of routes to overcome the limitations of such solutions. To predict the performance in terms of rate and distortion, they develop a model which captures the impact of quantization and packet loss on the overall video quality.

In [10], measurements of packet transmission delays at the MAC layer are used to select the optimal bit rate for video, subsequently enforced by a transcoder. The benefit of cross-layer signaling in rate allocation has also been demonstrated in [11], where adaptive rate control at the MAC layer is applied in conjunction with adaptive rate control during live video encoding. The authors in [12] propose a media-aware multiuser rate allocation algorithm in multihop wireless mesh networks that can adjust the video rate adaptively based on both video content and network congestion and show the benefits of their work with respect to the well-known TCP friendly rate control (TFRC) [13].

In the current work, a similar approach such as [7] is being adopted by which a constrained optimization framework is introduced for optimal rate allocation to the real-time video applications. In [6], the authors do a similar optimization but they take the average congestion of the overall network as the QoS criterion and minimize it to find the optimal solution for rate allocation on the available paths using simulations. In [14], the authors propose a distributed rate allocation algorithm which minimizes the total distortion of all video streams. Based on the subgradient method, their proposed scheme only requires link price updates at each relay node based on local observations and rate adaptations at each source node derived from rate-distortion (RD) models of the video. They show by simulation that their proposed scheme can achieve the same optimal rate allocation as that obtained from exhaustive search.

The presented work in this paper differs from that of [14] in that, in our work, we have assumed that each video source may use multipath routing for partitioning and transmission of the total video traffic. On the other hand, we have included the effect of the packet loss in the perceived video distortion. Our work differs from [6, 7] in that we have used the total distortion as an objective Quality of Experience (QoE) measure in place of the QoS criterion used in [6, 7]. In order to compute the total distortion, we have assumed that multiple video sources use the same wireless ad hoc medium for transmission, and their associated distortions are additive [6]. On the other hand, the presented work differs from [7] in considering more than one (and possibly interfering) multipath-routed video sources which compete for the available bandwidth in a bandwidth-limited wireless ad hoc network.

The paper's objective is to develop an optimal rate allocation framework bases on which the overall distortion of all the video sources is minimized. We also have used a penalty function approach for finding an iterative solution algorithm for the proposed constrained optimization problem such as those introduced in [15, 16].

The rest of the paper is organized as follows. In Section 2 the relationship between the allocated rate and the resulting distortion is introduced. In Section 3 the proposed optimization framework has been developed in detail. Section 4 is devoted to the numerical analysis, and finally in Section 5 some concluding remarks are presented.

2. Video Distortion Model

For smooth playback of a live video, transmitted packets must meet maximum allowed delay constraint. Therefore, the packets with a greater delay are useless so that they are supposed as packet loss. On the other hand, the total distortion of decoded video is the superposition of the distortion caused by video encoder ( ) and the distortion caused by packet loss or late arrivals during the transmission ( ) [6].

According to [17], considering Mean Squared Error (MSE) criterion and assuming that and are uncorrelated, the overall distortion can be written as follows:
The empirical Rate-Distortion (R-D) model in [17] is used to represent :
where is the rate of encoded video, and the parameters , , and are calculated empirically from R-D curves. Again, based on [17], we assume a linear relationship between the total packet error rate (PER) and :
where is the PER, and the scaling factor depends on the encoding structure. Assuming that the video encoder uses the maximum allocated channel capacity, the rate of encoded video can be computed as follows [6]:

where is the number of paths in a multipath-routed source-destination pair, and is the rate allocated to the th path. The above assumption is achievable by using adaptive source rate control algorithms such as those mentioned in [1820].

3. Proposed Optimization Framework

Consider the multihop wireless ad hoc network depicted in Figure 1. Assume that there exist video sources, and the existing multipath routing protocol (e.g., DSDV) introduces disjoint multihop paths between each source-destination pair ( ) periodically ( ). Each path is associated with a traffic flow, and these multiplexed flows are aggregated in the destination node to produce the initial source-generated traffic stream. The number is selected based on the assumption of availability of the current paths throughput information for the video source node and the sufficiency of the aggregate-estimated throughput for the traffic's minimum bandwidth requirements.
Figure 1

A typical multihop wireless ad hoc network.

Each path related to the source contains wireless links from source to destination for and . We assume that the total capacity of the wireless link between the nodes and is denoted by and is derived as follows [6]:
where is the Signal to Noise Ratio between the nodes and and can be written as follows:

In the above calculations it is assumed that by a properly designed MAC protocol, there exist no collisions so that the inter node interference (INI) can be neglected. is the distance between node and node , denotes the path loss exponent, represents the power spectral density of the noise, is the system bandwidth, and is the coding gain. It is also assumed that the transmission power is equal at all nodes. In the following, we will assume that the nodes are static with . While this is a simplified model for the wireless ad hoc network, the analysis we present can easily be extended to the more sophisticated link capacity calculations.

We assume a simple strong line of sight (LOS) with BPSK signaling for node's wireless transmissions and also neglect the interfering effect of wireless transmissions between different paths [1]. We have used the Independent Basic Service Set (IBSS) setup (DCF mode) for implementing the MAC layer of the 802.11 WLAN standard which enforces the WLAN network in the ad hoc mode. It is assumed that BPSK DSSS is used in the physical layer. As the Bit Error Rate (BER) performance of the BPSK spread spectrum system in an AWGN environment is identical to that of conventional coherent BPSK system [21], it is sufficient to calculate the latter performance for evaluating the BER of the proposed system.

We also assume that the transmitted data is fragmented in equal length packets of length bits enabled with FEC error correction capability up to bits, and this leads to the coding gain .

In the current paper, our objective is to minimize the total distortion associated with multiple video sources. Thus, a mathematical formulation must be presented to express the distortion of each video source in terms of its allocated rate. According to (3), this distortion is a function of the PER associated with each video source. In the following paragraphs, the packet error rate computation method is presented.

The bit error rate (BER) of the link in the th path of the th video source can be represented for a simple strong LOS propagation model with BPSK signaling as follows [1]:

where is a physical constant, is the (nonempty) set of wireless links associated with the th flow of the th video source, and and are the transmitted power and the total transmission rate associated with the th link in the th flow of the th source, respectively. As it is said before, we assume that is fixed during transmission and therefore does not depend on the transmission data rate .

Assume that can be partitioned in two disjoint subsets. One subset is associated with those wireless links that are common between more than one video sources which we denote by (it is assumed that this subset is not empty for at least one ), and the other set contains noncommon wireless links which we denote by . So, we can write

We represent the set cardinality operator by , so we have . We also assume that , and thus we have .

The consists of two components: one is the traffic rate allocated to the th flow of the th source which is denoted by , and the other part is associated with the time-varying th link's cross (background) traffic . Thus we have

So, the available capacity (throughput) is denoted by and is equal to , where is the capacity of the link in the th path of the th video source.

In some cases (as is depicted in Figure 2), two or more multipath video sources may compete for a common wireless link (in Figure 2 this link is shown by bold line). Therefore, the available capacity of the common link must be shared between the competing flows in an optimal manner.
Figure 2

Two competing multipath-routed video sources.

Assume that for each common link there exists an associated set which represents the set of all ordered pairs (path, source) that use the common link in the path of the source (e.g., in Figure 2, the path 1 of source 2 shares the common link with the path 2 of source 1). So the ingress and egress nodes associated with this common link are common between more than one flow.

For common links we assume that background traffic is composed only of those flows which are in , that is, we can write
With the assumption of independent links' bit error rate, the total bit error rate along the th path of the th source can be calculated as follows:

The total PER of the th path of the th video source is composed of the congestion-related and noncongestion-related (wireless link) losses which we denote by and , respectively.

If the FEC-induced error correction capability of a packet with length bits is bits and with the assumption of independent bit errors (lack of burst errors), the wireless link-related PER along the th path (flow) of the th source can be calculated as follows:

Now we are in a position that must compute the congestion-related part of the PER.

First, assume that the end-to-end queueing delay of the th path of the th source can be represented with a random variable with the probability density function (pdf) .

By adopting the same approach as in [7], it can be assumed that congestion-related packet loss occurs when the end-to-end queuing delay of the th path of the th source exceeds a predetermined threshold . In mathematical terms the mentioned fact can be represented as follows:

In the sequel, the distribution has been calculated based on some specific assumptions.

As in [7] simple M/M/1 queueing model and FIFO service discipline are adopted for the nodes. With the assumption of M/M/1 queueing model, the service time of each queue is an exponentially distributed random variable [22]. We also assume that this service times are independent. On the other hand, the end-to-end delay of each path belonging to the video source is equal to the sum of these independent random variables. Ignoring the source and destination nodes (hops), the total number of nodes in and the number of noncommon nodes in and common nodes in would be , , and , respectively, for each .

3.1. Definition

If traffic flows from node to node , the nodes and are called the ingress and egress nodes for the link , respectively.

Based on [23], for the nodes in , the delay distribution (pdf) can be represented by exponential distribution as follows:
where we can write for noncommon nodes associated with [8]:
Based on the value of and for ingress/egress nodes associated with common links in , we can write [8]
Thus the probabilistic distribution function of the end-to-end delay ( ) is the convolution of all these pdf's [22]. On the other hand, we can write

where is the number of nodes in , is the convolution operator, and are the pdf's associated with all of the nodes which reside in .

The total PER related to the th flow of the th source can be simply shown to be equal to
The total PER of the source-destination pair with the assumption of independent path packet losses can be written as follows:
We also define the total allocated rate to the source to be , and we have
As described in (1)–(4), we can formulate the distortion of each video source ( ) as follows [6]:
Based on the above facts, the formulation of the proposed total distortion minimization problem can be done as follows:
subject to

in which is the minimum required bandwidth for the th video source.

We must now remind our previous assumption that the parameter is assumed to be large enough such that the constraint (24) is met for all .

Suppose that the optimal solution vector of the system (23)–(25) is defined as follows:
Since the constraint set is convex, in order to make the constrained optimization problem (23)–(25) has a unique and optimal solution vector , it is necessary and sufficient that the following Lagrangian equation to have positive second derivatives with respect to all of the variables [16]:

where and are the Lagrange multipliers.

Theorem 1.

Consider a typical multihop wireless ad hoc network. Assume that the following assumption holds:
Then, there exists some such that the following holds:


From (13) we have
Similarly we can write
where we have for each the following:
From (12) and the definition of in (7), we can write for all the following:
and also
Based on (34)-(35) it can easily be shown that
We define
Also we can write
We also introduce

(a) Consider the case .

Based on (32) and (34)-(35), we can simplify to the following form:
By considering (38) and (42) for satisfying the inequality (29), it is sufficient that the following functional be positive for some :
By considering we can write
Thus, based on assumption (28) we can write
Hence, it can be concluded that

(b) Consider the case .

First, from assumption (28) and (44)-(45) it can be easily concluded that
As usually we have ; from (28) it can be concluded that . From (12) it can be easily concluded that , for all , and based on (7) we have
From (36), (40), (44)-(45), and (49) it can be concluded that

From (47) and (50) it can be deduced that, under assumption (28) and for , the theorem objective in relation (29) is satisfied.

Now, we propose another theorem based on which the existence and uniqueness of the solution vector of the system (23)–(25) that can be proved.

Theorem 2.

Assume that there exists one and only one congested link for each path of the video source , for all . Then, based on the assumption (28) in Theorem 1 and the following assumption, there exists a unique and optimal solution vector for the optimization problem (23)–(25):


First it must be shown that the Lagrangian (27) has positive second derivatives with respect to all of the variables. From (27) we can write the following:
Also we have
From the definition of in (21), we can write
Based on the definition of in (20), we can write
If we assume that the congestion-related and wireless-link losses are small enough, the equation (19) can be simplified as follows:
We also have
From (10), we have
In general, from congestion point of view, we can partition the wireless links in to two other disjoint sets. One set is related to the congested links associated with common nodes in which we denote by , and the other is associated with noncongested ones, that is, . For congested links we can write simply
But, for noncongested links we have
From chain rule, we can write
And also
From (60) and (61) we can write
From the definition of in (14), it can be shown that
Now, we show that under assumption (51) and the fact that we can write
From (18) we can rewrite the distribution as follows:
in which
But, based on the theorem assumption, as the congestion occurs only in one of the links in each path of the source and the ingress node associated with this congested link, works, and near the capacity region, from (16) and (17) we have
Equivalently, we can say that the delay distribution function (67) of each path of the source can be approximated by the convolution of a dominant exponential delay distribution associated with this congested node and some other negligible delay distributions which behave like weighted dirac delta functions as compared with the dominant distribution as follows:
Thus we have
Based on integral limits in (65), the theorem assumption (51), and the relation (70), we have
Based on (65) and (72), we can conclude that
From (58), (64), and (73) we can conclude that
Note that the first term of (55) is positive. Now, based on (74) it is easy to show that the second term of (55) is also positive. For proving the positiveness of the third term, we must show that
or equivalently
It is trivial that if path of the source is disjoint from path of the source , we have

So, from now on, we assume that path of the source is common with path of the source in some links.

Similar to (32) we can write

where and are defined as in (31) and (33), respectively.

Note that if , we have and we can write
On the other hand, if , we have
Similarly, if , we have and we can write
and also
If or , we have
If , we have
Similar to the results in Theorem 1 for , we have
And if or , we have
Similar to (63) we can write
If we define , then
Thus, from (85)–(88) we have
Similar to the steps in (65)–(73) we can write
Thus we can write
Now, from (91) we can conclude that the third term in (55) must be positive, and finally based on (55), (74), and (91), we have

From (92) and the convexity of the constraint set (24)-(25) and (51), it can be deduced that the constrained optimization problem (23) has a unique and optimal solution vector [16].

Theorem 3.

Assume and consider the general form of Theorem 2 in which there exists the possibility of multiple congested links in path of the video source . Based on the assumption (28) in Theorem 1 and the following assumption, there exists a unique and optimal solution vector for the optimization problem (23)–(25):
in which


It is clear that the delay distribution function of each node has exponential form. Equation (67) can be rewritten for as follows:
For we have
From preliminary calculus and the definition of in (15), the equation (95) can be simplified as follows:
in which
and for we have
in which
for we have
in which
It can be deduced from (15) and (100) that is not a function of . So, in order for (65) to be positive and based on (97), it is sufficient that we have
By taking derivatives and considering the fact that , for proving the positiveness of (103), it is sufficient that
Since , it is sufficient that

which is valid when assumption (93) is true and also .

The rest of the proof is the same as that of Theorem 2.

3.2. Corollary A

In the special case of equal delay distribution function for all of the nodes in path of the source , it can be easily shown that the assumption (93) can be simplified as follows:

It can be verified that the assumption (51) is a special case of the condition (106) for .

3.3. Corollary B

It can also be easily verified that, in the special case of equal delay distribution function for all of the nodes in path of the source , the distribution (97) reduces to the well-known gamma form [23] as follows:
Many iterative methods have been proposed which lead to the optimal solution of constrained optimization problem (23)–(25) with the additional assumptions in (28) and (51) or (93) [16]. From these methods we have selected the penalty function approach. A typical convex penalty function is depicted in Figure 3.
Figure 3

Typical penalty function.

For solving the previous constrained optimization problem, it is adequate to solve the following unconstrained one [16]:

Theorem 4.

Assume that (28) and (51) or (93) are true and consider the following update rule:

where is a small positive constant. Then, the function is a Lyapunov function for the mentioned system (109) to which all the trajectories converge.


First, we must show that is convex. From (92) and the convexity of function , we have
From (108)-(109) and the chain-rule, we can write

Thus, is a Lyapunov function for the continuous-time system (109), and the vector is an equilibrium point of the system (23)–(25) to which all of the trajectories converge.

As we can see from assumptions (28) and (51), for guaranteeing the uniqueness of the solution vector in optimization problem (23)–(25), it is necessary that the variables remain in the constraint set . So, we must solve a projected version of unconstrained optimization (108) [16]. The iterative gradient descent solution for solving the unconstrained problem (108) is as follows:

where is some positive and sufficiently small constant that guarantees the convergence [15].

The stability of the discrete-time iteration (112) can be proved in the same way as that proposed in [15].

3.4. Note

In reality, due to the nodes mobility, there may exist estimation errors or uncertainties in some of the parameters (e.g., link capacities) associated with constrained optimization problem (23)–(25). This may cause an optimal and unique solution that can hardly be derived or cannot be reached at all by the proposed iterative algorithm in (112). Hence, some modifications must be applied in the proposed method. In general, if it can be assumed that the estimation error in the link capacities is such that the resulting uncertain constraint set in (112) can be a subset of a given uncertainty set , then it can be shown that by adopting the robust convex optimization theory [24, 25], an optimal solution can still be found.

4. Numerical Analysis

Consider a sample scenario which is depicted in Figure 2. This scenario is consisted of two competing video sources and , and each video source is routed through two disjoint paths. Path 2 of the source 1 and path 1 of the source 2 are common in one wireless link. 16 nodes are randomly distributed in a area in this scenario. We have selected a simplified LOS propagation model for mobile nodes, and the nodes mobility has been neglected by the assumption of a static network topology. Some typical and parameters are listed in Tables 1 and 2, respectively, (note that, e.g., Path 21 in Table 2 denotes path 2 of the source 1). Although these parameters are chosen arbitrarily and may not be necessarily practical one selection of other values cannot change the optimality of the results because the proposed optimization framework leads to optimal resource allocation with minimal total distortion to the competing video sources independent of the selection of and parameters. , , , and are selected to be 128 Kbps. Path 1 of the source 1 and path 2 of the source 2's cross traffics are selected to be CBR sources with rates 20 Kbps and 50 Kbps, respectively, and other links' cross traffics are being neglected. We assume that the paths 1 and 2 of source 1 are consisted of 4 and 5 wireless links, respectively. Also assume that the paths 1 and 2 of source 2 are consisted of 5 and 4 wireless links, respectively. parameter is assumed to be 5 milliseconds for each because this value is typical for most practical video delivery applications. in iteration (112) is assumed to be 0.07.
Table 1

Values of the parameters .

Link 1

Link 2

Link 3

Link 4

Link 5

Path 1






Path 2






Path 3






Path 4





Table 2

Values of the link capacities (Kbps).

Link 1

Link 2

Link 3

Link 4

Link 5

Path 11






Path 21






Path 12






Path 22





The allocated rate to each path of the two video sources is shown in the Figure 4, and the aggregate-allocated rate to source-destination pairs is depicted in Figures 5 and 6. Note that, in Figures 5 and 6, the average aggregate rate of video sources 1 and 2 is above the threshold  Kbps (1283 Kbps and 129 Kbps, resp.). As it can be deduced from Figures 5 and 6, the aggregate-allocated rate to the video sources makes some fluctuations around the target rate  Kbps. This is the direct consequence of the competition process between the two video sources and the background traffic for consuming the network resources in the bottleneck links (link in Figure 2). This results in fast fluctuation of the background traffic patterns for each video source. As the result of these fluctuations, the constraint set in the problem (112) changes rapidly, and the iterative rate allocation algorithm (112) is not able to track the resulting fast variations in the constraint set; so it cannot converge to the optimal solution. One possible approach for faster convergence is the intelligent selection of the parameter in (112) (e.g., incorporating the fuzzy logic [26] or genetic algorithm [27] in the selection process) based on the capacity estimation methods such as those in [28, 29].
Figure 4

Rate allocation to different paths of the two sources. Path 11Path 21Path 12Path 22

Figure 5

Aggregate rate of source 1.

Figure 6

Aggregate rate of source 2.

In Figures 7 and 8, the distortion of the two sources is being depicted, and as the source 1 suffers from more packet loss, its distortion performance is worse than that of source 2. Finally in Figure 9 the total distortion of the proposed method is compared with an equal share scenario. In equal share scenario, equal rate allocation pattern exists for the two source, that is, path 1 of the source 1 and path 2 of the source 2 each achieves 103 Kbps, and path 2 of source 1 and path 1 of source 2 each achieves the remaining . As it can be easily checked, the total distortion of the proposed method is much less than that of the nonoptimal equal-share regime because the philosophy behind the resource allocation process in the equal-share scenario is far apart from that of the proposed distortion-minimal algorithm.
Figure 7

Distortion of source 1.

Figure 8

Distortion of source 2.

Figure 9

Total distortion comparison.

5. Conclusions

In the current work, an optimization framework is introduced by which the rate allocation to each path of a multipath wireless ad hoc network can be performed in such a way that the total distortion of multiple video sources resulting from the network congestion and wireless environment can be minimized.

Main application of such algorithms is in rate allocation to those subsets of real-time traffics which require a minimum level of total distortion. As we have used a simple LOS propagation model for the mobile nodes and ignored the mobility, a more powerful algorithm which can support more general multipath fading propagation models and the mobility can be considered for future research.



This work was supported by Iran Telecommunication Research Center (ITRC).

Authors’ Affiliations

Multimedia Group, IT Faculty, Iran Telecom Research Center (ITRC)


  1. Tonguz OK, Ferrari G: Ad Hoc Wireless Networks: A Communication-Theoretic Perspective. John Wiley & Sons, New York, NY, USA; 2006.View ArticleGoogle Scholar
  2. Royer E, Toh C-K: A review of current routing protocols for ad hoc mobile wireless networks. IEEE on Personal Communications 1999, 6(2):46-55. 10.1109/98.760423View ArticleGoogle Scholar
  3. Webb WT, Steele R: Variable rate QAM for mobile radio. IEEE Transactions on Communications 1995, 43(7):2223-2230. 10.1109/26.392965View ArticleGoogle Scholar
  4. Yoo T, Goldsmith A: Throughput optimization using adaptive techniques. Wireless Systems Lab, Stanford University, Stanford, Calif, USA; 2004.Google Scholar
  5. Setton E, Girod B: Congestion-distortion optimized scheduling of video over a bottleneck link. Proceedings of the 6th IEEE Workshop on Multimedia Signal Processing (MMSP '04), September-October 2004, Siena, Italy 179-182.Google Scholar
  6. Setton E, Zhu X, Girod B: Congestion-optimized multi-path streaming of video over ad hoc wireless networks. Proceedings of IEEE International Conference on Multimedia and Expo (ICME '04), June 2004, Taipei, Taiwan 3: 1619-1622.Google Scholar
  7. Agarwal R, Goldsmith A: Joint rate allocation and routing for multi-hop wireless networks with delay-constrained data. Wireless Systems Lab, Stanford University, Stanford, Calif, USA; 2004.Google Scholar
  8. Adlakha S, Zhu X, Girod B, Goldsmith AJ: Joint capacity, flow and rate allocation for multiuser video streaming over wireless ad-hoc networks. Proceedings of the IEEE International Conference on Communications (ICC '07), June 2007, Glasgow, Scotland 1747-1753.Google Scholar
  9. Zhu X, Han S, Girod B: Congestion-aware rate allocation for multipath video streaming over ad hoc wireless networks. Proceedings of the International Conference on Image Processing (ICIP '04), October 2004, Singapore 4: 2547-2550.Google Scholar
  10. van Beek P, Demircin MU: Delay-constrained rate adaptation for robust video transmission over home networks. Proceedings of IEEE International Conference on Image Processing (ICIP '05), September 2005, Genova, Italy 2: 173-176.Google Scholar
  11. Haratcherev I, Taal J, Langendoen K, Lagendijk R, Sips H: Optimized video streaming over 802.11 by cross-layer signaling. IEEE Communications Magazine 2006, 44(1):115-121.View ArticleGoogle Scholar
  12. Zhu X, Girod B: Media-aware multi-user rate allocation over wireless mesh network. Proceedings of the 1st Workshop on Operator-Assisted (Wireless-Mesh) Community Networks (OpComm '06), September 2006, Berlin, Germany 1-8.View ArticleGoogle Scholar
  13. Handley M, Floyd S, Padhye J, Widmer J: TCP friendly rate control (TFRC): protocol specification. University of Mannheim, Mannheim, Germany; 2003.Google Scholar
  14. Zhu X, Girod B: Distributed rate allocation for multi-stream video transmission over ad hoc networks. Proceedings of IEEE International Conference on Image Processing (ICIP '05), September 2005, Genova, Italy 2: 157-160.Google Scholar
  15. Kelly FP, Maulloo AK, Tan DKH: Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 1998, 49(3):237-252.View ArticleMATHGoogle Scholar
  16. Bertsekas DP, Tsitsiklis JN: Parallel and Distributed Computation. Prentice-Hall, Old Tappan, NJ, USA; 1989.MATHGoogle Scholar
  17. Stuhlmüller K, Färber N, Link M, Girod B: Analysis of video transmission over lossy channels. IEEE Journal on Selected Areas in Communications 2000, 18(6):1012-1032. 10.1109/49.848253View ArticleGoogle Scholar
  18. Chandramouli R, Subbalakshmi KP, Ranganathan N: Stochastic channel-adaptive rate control for wireless video transmission. Pattern Recognition Letters 2004, 25(7):793-806. 10.1016/j.patrec.2004.01.003View ArticleGoogle Scholar
  19. Feng P, Li Z, Lim K, Wu D, Yu R, Feng G: An adaptive rate control algorithm for video coding over personal digital assistants (pda). Proceedings of the IEEE International Conference on Multimedia and Expo (ICME '03), July 2003, Baltimore, Md, USA 2: 573-576.Google Scholar
  20. Chandramouli R, Kumar S, Ranganathan N: Joint optimization of quantization and on-line channel estimation for low bit-rate video transmission. Proceedings of the IEEE International Conference on Image Processing (ICIP '98), October 1998, Chicago, Ill, USA 1: 649-653.Google Scholar
  21. Feher K: Wireless Digital Communication: Modulation and Spread Spectrum Applications. Prentice-Hall, Old Tappan, NJ, USA; 1995.Google Scholar
  22. Papoulis A, Pillai SU: Probability, Random Variables and Stochastic Processes. McGraw-Hill, New York, NY, USA; 2002.Google Scholar
  23. Bertsekas D, Gallager R: Data Networks. Prentice-Hall, Old Tappan, NJ, USA; 1987.MATHGoogle Scholar
  24. Ben-Tal A, Nemirovski A: Robust convex optimization. Mathematics of Operations Research 1998, 23(4):769-805. 10.1287/moor.23.4.769MathSciNetView ArticleMATHGoogle Scholar
  25. Zhou K, Doyle JC: Essentails of Robust Control. Prentice-Hall, Old Tappan, NJ, USA; 1997.Google Scholar
  26. Goudarzi P, Sheikholeslam F:A fast fuzzy-based ( )-fair rate allocation algorithm. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS '05), April 2005, Denver, Colo, USA 25b.View ArticleGoogle Scholar
  27. Goudarzi P, Hassanzadeh R: A GA-based fuzzy rate allocation algorithm. Proceedings of the IEEE International Conference on Communications (ICC '06), June 2006, Istanbul, Turkey 1: 1-5.Google Scholar
  28. Ning L, Yan G, Li G: Fast capacity estimation algorithms for manets using directional antennas. Journal of Electronics 2007, 24(5):710-716. 10.1007/s11767-006-0217-zGoogle Scholar
  29. Zhang J, Cheng L, Marsic I: Models for non-intrusive estimation of wireless link bandwidth. Proceedings of the 8th International Conference on Personal Wireless Communications (PWC '03), September 2003, Venice, Italy, Lecture Notes in Computer Science 2775: 334-348.Google Scholar


© Pejman Goudarzi et al. 2009

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.