Media-Aware Multi-User Rate Allocation over Wireless Mesh Network

Transcription

1 Media-Aware Multi-User Rate Allocation over Wireless Mesh Network Xiaoqing Zhu and Bernd Girod Information Systems Laboratory, Stanford University, CA, U.S.A. Abstract When multiple video streams are transmitted in a wireless mesh network, each stream needs to adapt its rate to the time-varying traffic in the network. We propose a media-aware rate allocation algorithm that adjusts the video rate based on both video content and network congestion. This is combined with cross-layer information exchange: the video agent relies on estimated link state at each hop along the path, as well as accumulated congestion increment reported by the routing agent. We discuss in detail how the distributed optimization can be realized at each wireless node, and present simulations of the proposed rate allocation algorithm over an 8. wireless mesh network. Experimental results confirm that the proposed scheme can effectively adapt the allocated rate to the presence of new streams in the network in a congestion-distortion optimized manner. In comparison with TCP-Friendly Rate Control (TFRC), the proposed scheme can achieve a higher average video quality for all users while maintaining lower overall network congestion. I. INTRODUCTION A collection of wireless nodes can self-organize into a wireless mesh network. Each node can serve as a sender, a receiver, or a relay. Such a system can be deployed with low cost and high flexibility. Support of media streaming sessions over such a network is compelling for many applications, ranging from audiovisual communication in search-and-rescue operations, multi-camera wireless surveillance networks, to media streaming over wireless home networks or extended service area for broadband Internet access []. More recently, the potential of mesh networking among cellphone devices has also been explored for reducing the service cost of providing 3G multimedia contents to multiple users []. Realization of these applications in practice is still hindered by many technical challenges. Wireless channels may exhibit fluctuating link qualities caused by interference, multi-path fading and shadowing. The traffic patterns of compressed media streams change over time due to content variations and dynamic user behavior. Streaming applications usually have high data rate and stringent latency requirements, at odds with the limited bandwidth resources in a wireless network. Moreover, simultaneous streaming of multiple video sessions can easily lead to network congestion without careful rate allocation. As the video contents differ for each stream, the utility of the allocated rates is also different; the same increase in rate may have a greater impact on one stream than on another. We This work is partially supported by NSF Grant CCR therefore propose to perform multi-user rate allocation in a media-aware fashion, so as to maximize the total utility across all users in the network. The optimal allocated rate for each stream also needs to adapt to the time-varying wireless channel conditions and network congestion. In our work, this is achieved via crosslayer information exchange. Wireless link states are monitored at the MAC layer by logging packet arrival and departure events. Impact of the allocated rate on network congestion is collected along the path from source to destination by the routing agent at the network layer. All this information is passed along to the streaming agent at the application layer to determine the optimal video encoding rate. In addition, the proposed scheme performs both routing and rate allocation in a distributed manner so that computational burden can be shared among all nodes in the network. This avoids the traffic overhead introduced by collecting global network information in a centralized scheme. As each node performs the optimization based on local observations, the distributed scheme is also more responsive to variations in network conditions. Due to the CSMA/CA mechanism of 8. [3], contention among traffic over neighboring links will cause fluctuation in the observed effective link capacity, and in turn will affect the allocated rate. Since it is difficult to capture such interaction analytically in the network model, we study its impact on the behavior of our proposed scheme via network simulations. The rest of the paper is organized as follows. After a brief survey of related work in Section II, the overall architecture of the proposed cross-layer media-aware rate allocation scheme is presented in Section III. We then explain each component in our system across the protocol stacks: link state estimation in Section IV, congestion-minimized routing in Section V and congestion-distortion optimized rate allocation in Section VI. Simulation results for multi-user video streaming over wireless 8. mesh network are discussed in Section VII. II. RELATED WORK Rate allocation among multiple traffic streams over a common network is a well-studied problem. The mathematical formulation of the problem, as well as two classes of distributed rate control algorithms corresponding to the primal and dual decomposition of the optimization are explained in [4] and [5]. Application of such rate allocation algorithms has been investigated for elastic traffic over the Internet [6]. In a more

2 practical setting, a rate allocation algorithm combined with a packet partitioning algorithm are presented in [7] to support video streaming from multiple senders to a single receiver over the Internet. For video streaming over wireless networks, the problem of rate adaptation over a single link with fluctuating effective bandwidth has been formulated in the framework of stochastic dynamic programming, in [8] for rate control of live-encoded video and in [9] for pruning pre-encoded video packets. In the multi-user scenario, centralized cross-layer optimization of air time allocation among multiple wireless stations has also been studied []. In [], rate allocation among multiple potential media servers is jointly optimized with route selection for delivering a requested video stream over the wireless mesh network. In our own work, we have proposed distributed optimization algorithms for route selection and rate allocation, both for a simple network model assuming fixed link capacities [][3], and for wireless mesh network composed of 8. nodes [4]. III. S YSTEM OVERVIEW Consider simultaneously supporting multiple video streams over a common wireless mesh network. Each node consists of a link state monitor at the MAC layer, a congestion-minimized routing agent at the network layer, and a video streaming agent at the application layer. Traffic from different video sessions over neighboring links contend over the common wireless media for transmission opportunities. Effective bandwidth and existing traffic rate is estimated on-the-fly by the link state monitor. Source routing is used to reduce overhead of maintaining routing tables. Each video session may travel over multiple hops from source to destination along a path specified by the routing agent. The optimal path selection is carried out in a distributed manner among all potential relay nodes in the network. Rate allocation to each video stream is also performed in a decentralized fashion. Each source node determines the optimal rate for its video session to balance the competing objectives of improving encoded video quality and limiting incurred network congestion. Figure illustrates various components in such a system. Figure depicts the cross-layer information exchange among the agents. At Node n, the link state monitor collects effective link capacity Cn and existing traffic flow Fn. Such information is used by the routing agent to choose a relay node incurring minimum congestion increment Xn (Cn, Fn ) s over P the next hop. End-to-end congestion increment X = n P s Xn for Stream s is accumulated along the selected path P s by the routing agent, and fed back to the sender. Given the distortion-rate tradeoff D s (Rs ) for encoding its own video sequence, the streaming agent finds the optimal allocated rate Rs,opt to achieve a balance between decreasing encoded video distortion D s and increasing network congestion X s reported from the routing agent. Sender B Receiver A Relay Node Routing Agent Link State Monitor Source Node Video Streaming Agent Routing Agent Link State Monitor Receiver B Sender A Fig.. System of multi-user video streaming over wireless mesh network. Distortion-Rate (DR) characteristic Ds (Rs ) Allocated rate Congestion-Distortion Optimized Rate Allocation R s,opt Accumulated congestion increment 'X s 'X n n Ps Congestion-Minimized Source Routing Link state information Cn, Fn, 'Xn (Cn, Fn ) Link State Monitor Fig.. Cross-layer information exchange among the link state monitor, the routing agent and the application layer video streaming agent in a system with multi-user video streaming over wireless mesh network. each link by logging packet arrivals and departures at the MAC layer, assuming that the 8. protocol is used for wireless media access [3]. A. Estimation of capacity and flow For a given period of time Ttotal on each node, we denote Tbusy as the total time that the node spends for transmitting the packets, including MAC layer overhead such as RTS/CTS/ACK packets. Tblock records the average time during which the node is blocked from transmission either due to presence of other transmissions or due to the backoff procedure in the carrier sense and collision avoidance (CSMA/CA) mechanism. Tidle refers to the total time for which the node remains idle and is ready for transmitting the next packet: () IV. L INK S TATE E STIMATION Ttotal = Tbusy + Tblock + Tidle. In this Section, we describe how the link state monitor estimates the effective capacity and existing traffic rate over Figure 3 illustrates the three different time periods observed by one node in the network over multiple cycles of packet

3 3 A. New packet arrival B. Transmitting RTS, failed C. Backoff before next attempt D. Retransmitting RTS E. Receiving CTS F. Transmitting DATA packet, including MAC header A.B. C. D. E. F. G. H. I. J. K. RTS RTS CTS DATA ACK RTS T block T busy T idle T block T busy T total G. Receiving ACK H. Channel idle, no packet needs to be transmitted I. Channel blocked due to transmission at neighboring node J. New packet arrival, channel still blocked K. Start transmitting RTS for the new packet Fig. 3. Illustration of how to categorize observed channel state into T busy, T block and T idle on a wireless node following the 8. MAC protocol. transmission. By keeping a running average of T busy, T block and T idle, the flow rate for Stream s on Node n can be estimated as: F s n = T total Bs B s =, () T total T busy + T block + T idle where B s is the average video payload size from Stream s over the period. Total traffic rate over the node is F n = s F s n, and estimated bandwidth is : C n = s Bs T busy + T block, (3) which takes into account packets from all streams. As the effect of instantaneous bit-error-rates or collisions are captured by T total and the relative proportions of T busy, T block and T idle, our estimation of effective bandwidth C n is automatically updated according to the variations in wireless channel conditions. B. Estimation of available bandwidth For Stream s over Node n, the maximum supportable rate is given by: C s n = C n s s F s n, (4) where Fn s s denote existing traffic rates from all other streams on that node. The end-to-end available bandwidth corresponds to the bottleneck value along the path P s from source to destination: C s avail = min n P s Cs n, (5) and serves as an upper bound for the allocated rate for each stream. Due to the broadcast nature of the wireless medium, and the fact that traffic for different destinations share the same queue on a wireless terminal, we estimate the capacity for each node, instead of for each link, as the average service rate to the queue. C. Estimation of Link Congestion Congestion is defined as proportional to the average delay experienced by packets traveling over that link. Assuming the M/M/ queuing model for packet arrivals and departures, congestion over Node n can be estimated as [5]: X n = C n F n. (6) Consequently, the congestion increment caused by supporting an additional amount of traffic R over the same link can be derived as: X n (C n F n ) R n. (7) which increases nonlinearly as the traffic load approaches the effective link capacity. V. CONGESTION-MINIMIZED ROUTING The goal of congestion-minimized routing is to find one or multiple paths from source to destination so as to minimize the increase in network congestion introduced by the new video stream. Detailed descriptions of the scheme can be found in [] and [3]. For the completeness of this paper, a brief sketch of the routing algorithm is included in this section. Consider a network with N nodes, with observed effective capacity C n and flow F n on each node. Overall network congestion can be calculated as: X = N n= F n C n F n. (8) For Stream s, the congestion increment introduced by a small rate increment R s is shown to be: X s C n (C n F n ) Rs, (9) n P s along a chosen path P s. Therefore, the optimal path can be achieved by minimum-cost routing, where the total cost from source to destination n P C n/(c s n F n ) is independent of the amount of traffic to be routed R s. In fact, the link cost C n /(C n F n ), as the derivative of the function F/(C F ) with respect to F, can be interpreted as the the sensitivity of total network congestion to additional traffic rate on that link. This approximation holds when R s is small. Unlike in a network with fixed link capacities, distribution of traffic over multiple paths composed of 8. wireless nodes will not reduce network congestion. Traffic from neighboring links contend for common wireless resource, resulting in lower effective channel capacity at each link. Therefore, in this work, only a single path is selected for each video stream. As the allocated rate to the video stream increases by R(k) s at each step, the congestion increment need to be updated along the same path P s : X(k) s C n (C n F n k Rs (k), () k = Rs (k ) ) n P s Even though actual video traffic patterns do no necessarily behave like M/M/ queues, this assumption captures the nonlinear relationship between traffic load and capacity. It also allows analytical prediction of the congestion increment X introduced by traffic rate increment R.

4 4 Y Coordinate (m) Y Coordinate (m) X Coordinate (m) (a) X Coordinate (m) (b) Fig. 4. Initial (a) and final (b) routes selected by the proposed distributed congestion-minimized routing algorithm, when the third video stream Mother and Daughter enters the wireless mesh network simulated in Subsection VII- C. Routes for the Bus sequence are plotted in blue dotted lines. Red solid lines represent Foreman and pink dashed lines are used for Mother and Daughter. where R(k s ) s are the previously allocated rates for that stream. In practice, the protocol can be implemented by modifying the link cost measure of some minimum-hop-based ad-hoc routing protocols such as Dynamic Source Routing (DSR) [6]. As an illustration, Fig. 4 shows the initial and final routes when a third video stream enters the network in the simulation scenario described in Subsection VII-C. Decrease in encoded video distortion and increase in network congestion reported by the distributed routing agent are plotted in Fig. 5. VI. MEDIA-AWARE RATE ALLOCATION At the application layer, the video stream s is associated with a mean squared error (MSE) decoding distortion of D s when encoded at rate R s. The distortion-rate (DR) characteristic of each stream can be fitted to a parametric model [7]: D s (R s ) = D s θ s (R s R s ), () where the parameters D s, θ s and R s depend on the coding scheme and the video content. They can be estimated from Congestion Sensitivity (s/bit) Bus λ X/ R Foreman λ X/ R Mother and Daughter λ X/ R Bus D/ R Foreman D/ R Mother and Daughter D/ R Fig. 5. Video distortion reduction and network congestion increment (scaled by λ = 5) introduced by increasing allocated rate of each video stream in the wireless mesh network simulated in Subsection VII-C. three or more trial encodings using nonlinear regression techniques. The distortion reduction caused by increasing encoding rate by R s is therefore: D s θ s (R s R s ) Rs. () The objective of the rate allocation algorithm is to minimize the encoded video distortion of all users, while limiting the increase in network congestion. In [3], this is formulated into a convex optimization problem, the objective function being the Lagrangian cost of both terms: min R s,p s,s=,...,s s= S D s (R s ) + λx, (3) and the linear constraints being flow conservation of each stream. The readers are referred to the original paper for a discussion of both centralized and distributed solutions for the joint optimization of routing and rate allocation. In this work, the procedures for the distributed optimization of rate allocation are adopted, for video streaming over 8. wireless mesh network. At each time step k, the source node increases the allocated rate to the Stream s by R(k) s, and compares the congestion increment X(k) s reported by the routing agent as in Eq. (9), versus the video distortion reduction D(k) s as in Eq. (). The allocated rate can increase by R(k) s unless Ds (k) < λ X(k) s, i.e., when the benefit of distortion reduction is no longer worthwhile the increase in network congestion. Due to the convex nature of both D s and X, the initial distortion reductions are typically significant for small rate increments, whereas increase in network congestion starts out slowly. Therefore, the rate allocation algorithm can continue until it reaches the optimal rate that strikes a balance between the two tradeoff slopes. When multiple users are present in the network, they need to agree upon a common tradeoff factor λ, and take turns to optimize its own rate allocation, treating traffic rate from all other video streams as background. It is shown in [3] that, for a network with fixed link capacities and flow rates,

5 5 since the overall Lagrangian cost in Eq. (3) keeps decreasing after each user s optimization, the distributed algorithm is guaranteed to converge. Over an 8. wireless network, however, due to the underlying fluctuation of link capacity and flow rates, the optimal path chosen by the routing agent may oscillate among several alternatives, and the observed congestion increment over a given path may also fluctuate over time. Both phenomena lead to variations in the allocated video rates, as observed in our simulative study. Y Coordinate (m) A. Experimental setup VII. SIMULATION RESULTS To verify the effectiveness of the proposed distributed rate allocation scheme, experiments are carried out using ns- [8] for a simulated network consisting of static nodes randomly positioned in an m-by-m square area. Fig. 6 plots the positions of the wireless nodes. Receiver sensitivity parameters are adjusted so that the communication range of each node is 6m. Multi-hop transmission is therefore needed, and the RTS/CTS handshake mechanism in the 8. protocol is invoked to avoid the hidden terminal problem. Each link operates at a fixed data rate of 5.5 Mbps for payload and. Mbps for MAC-layer control packets. Three CIF video sequences of decreasing content complexity: Bus, Foreman and Mother and Daughter are considered for streaming between various source-destination pairs. The tradeoff between encoding rate and video quality is obtained by empirically encoding each stream using the H.64/AVC codec [9] at various quantization step sizes, with a frame rate of 3 fps and GOP length of 5. The experimental data points are then fitted with the parametric model in Eq. (), as plotted in Fig. 7. In the following, we first study the dynamic behavior of the proposed algorithm in the simple scenario of two contending video sessions over neighboring wireless links in Subsection VII-B. The more general case of three video streams each traveling over a multi-hop path is investigated in Subsection VII-C. Finally, performance of our proposed media-aware rate allocation scheme is compared with the conventional media-unaware approach, where the rate of each video stream is determined by the TCP-Friendly Rate Control (TFRC) agent at the transport layer []. Most experiments are carried out by sweeping the congestion-distortion tradeoff factor λ from 5 to 5. Re-optimization of routing and rate allocation is performed once every 4 seconds. B. Multiple streams over single-hop connections In this section, we consider the simple scenario of multi-user video streaming over single-hop connections. The Foreman sequence is streamed over a single hop from Node 7 to Node for the first 6 seconds, while the Mother and Daughter sequence from Node 6 to Node 4 becomes active 3 seconds later, and lasts for another 6 seconds. Note that even though the two video streams do not share any nodes for transmission, their traffic contend for the common wireless media via the 8. MAC protocol. This can be observed in Fig. 8. The Foreman sequence automatically adapts to the presence of the X Coordinate (m) Fig. 6. Wireless mesh network with nodes randomly positioned in an m-by-m square area. The wireless nodes are simulated in ns- following the 8. MAC protocol. Transmission range of each node is 6m and multi-hop delivery is needs for source-destination pairs outside of this range. PSNR (db) Bus, model Bus, experimental Foreman, model 5 Foreman, experimental Mother and Daughter, model Mother and Daughter, experimental 5 5 Fig. 7. Rate-PSNR performance of Bus, Foreman and Mother and Daughter CIF video sequences, all encoded using the H.64/AVC codec at 3 frames per second, with GOP length of 5. The experimental data points are fitted with the model curves using nonlinear regression techniques. second stream Mother and Daughter by gradually reducing its allocated rate. In this example, it is also interesting to note that unlike in a network with fixed capacity, the available bandwidth C avail estimated by the link state monitor at each 8. node changes with variations in the traffic load. When both video sequences are active, the estimated C avail of the first link for Foreman is indeed reduced due to contentions from traffic of the Mother and Daughter sequence. C. Multiple streams over multi-hop paths We now consider the more general case of supporting multiple video streams each over a multi-hop path, dynamically optimized by the congestion-minimized routing agent. The simulation lasts for 9 seconds, with the Bus (from Node 3 to Node 5), Foreman (from Node to Node 9) and Mother and Daughter (from Node 8 to Node ) sequences becoming active at the 5th, th and 4th second, respectively, each

6 6 5 Foreman C avail at Node 7 Mother and Daughter C avail at Node Bus Foreman Mother and Daughter Time (s) Time (s) Fig. 8. Estimated effective bandwidth and allocated rate for the Foreman and Mother and Daughter sequence, each traveling over a single-hop connection. In this experiment, λ = 5. Fig.. Allocated rate for Bus (blue dotted line), Foreman (red diamond markers) and Mother and Daughter black plus signs given a common tradeoff factor λ = 5 during the events depicted in Fig. 9. lasting for about 6 seconds. The simulation events are illustrated in Fig. 9. By this design, one can examine rate allocation results for various combinations of users sharing the network. Figure shows the trace of allocated rate for each sequence over time, given an intermediate tradeoff factor of λ = 5. As new streams join the network, the allocated rate of the existing streams are reduced gradually. During the period between 4s and 6s, when all three streams are present, their allocated rate reflect their relative complexity, i.e., the most complex stream Bus is allocated the highest rate while the sequence with the least motion Mother and Daughter is assigned the lowest rate. One can also observe the fluctuations in the allocated rates, due to reasons mentioned in Section VI. In Fig., the average and standard deviation of the allocated rate for each stream is plotted by varying the tradeoff factor λ from 5 to 5. When λ is small, the allocated rate to each stream is mainly limited by the end-to-end available bandwidth over the path. As λ increases, the constraint on network congestion becomes increasingly dominant, leading each user to backoff its video rate. The amount of fluctuation in rate allocation also decreases with a greater λ, as capacity and flow estimation tend to have more stable results over less congested links. D. Comparison with TFRC In this section, we compare the performance of our proposed scheme to the conventional media-unaware approach, where the encoding rate of each video stream is determined by the Allocated Bus Foreman Mother and Daughter (a) Duration of Bus Duration of Foreman Duration of Mother and Daughter Rate Deviation (kbps) Time (s) Fig. 9. Scheduled events for the simulation of multi-user video streaming over multi-hop paths. The Bus stream travels from Node 3 to Node 5, and is active from time 5.s to 6.s. Foreman travels from Node to Node 9, and is active from.s to 8.s. The Mother and Daughter session is between Node 8 and Node, starting at 4.s and finishing.s Tradeoff Factor (b) Fig.. Average and standard deviation of allocated rates for Bus, Foreman, and Mother and Daughter sequences over the a common wireless mesh network. The congestion-distortion tradeoff factor λ ranges from 5 to 5.

7 7 Media-Aware TFRC Media-Aware TFRC Bus Foreman Mother and Daughter Average PSNR (db) Bus Foreman Mother and Daughter Average Fig.. Average allocated rate using the proposed media-aware approach (λ = 5) versus conventional TFRC. TCP-Friendly Rate Control (TFRC) equation: R = ks RT T p. (4) where S, RT T, p and k denote the packet size, the round-triptime estimate, the loss rate estimate and a scaling constant respectively []. Figures, 3 and 4 compare the allocated rate, corresponding encoded video quality and end-to-end delay between the proposed media-aware scheme and TFRC. For the proposed scheme, the intermediate value of 5 is chosen for λ, leading to similar end-to-end delay performance as achieved by TFRC. Comparisons of the average rate, video quality 3 and delay are also included in the last column of the graphs. As shown in Fig., the proposed media-aware scheme tends to allocate more rate to the Bus sequence with more dynamic content, which needs to be encoded with greater rate to achieve a basic quality. The TFRC scheme, on the other hand, is unaware of the relative content complexity of the sequences, and somehow resulted in the reverse order of allocated rates among the sequences. Consequently, the proposed media-aware approach can achieve a higher average video quality while maintaining lower overall network congestion, as measured by the weighted average end-to-end delay of all three streams in Fig. 4. VIII. CONCLUSIONS In this work, we study the behavior of a media-aware distributed rate allocation scheme for multi-user video streaming over wireless mesh network. By taking advantage of cross-layer information exchange from the link state monitor and the congestion-minimized routing agent, the streaming agent at each user can adapt its video rate to changes in the network in a congestion-distortion optimized manner. Simulation results involving multiple video streams over a simulated mesh network with 8. wireless nodes confirm the effectiveness of the proposed scheme. Compared with the 3 Average video quality among all users is measured as the PSNR corresponding to the average MSE distortion of all encoded video sequences. Fig. 3. PSNR in db corresponding to the average encoded distortion of the video sequences Bus, Foreman and Mother and Daughter resulting from rate allocation using the proposed media-aware approach (λ = 5) versus conventional TFRC. PSNR values in the last column correspond to the average MSE encoded distortion of all three streams. Delay (s) Media-Aware Bus Foreman Mother and Daughter TFRC Weighted Average Fig. 4. Average end-to-end delay experienced by each video stream resulting from rate allocation using the proposed media-aware approach (λ = 5) versus conventional TFRC. The last column compares the average delay over the entire network, each user weighted by its rate. This measurement corresponds to the overall congestion in a network. conventional media-unaware approach such as TCP-Friendly Rate Control, the proposed scheme is shown to achieve higher average encoded video quality while maintaining lower overall network congestion. For future work, we intend to improve the convergence speed of the rate allocation procedure, and to investigate performance of the scheme in a network containing mobile nodes. REFERENCES [] S. Cass, Viva mesh vegas [mesh wireless network], IEEE Spectrum, vol. 4, no., pp , Jan. 5. [] S.-H. Chan M.-F. Leung and O. Au, Cosmos: Peer-to-peer collaborative streaming among mobiles, Proc. IEEE International Conference on Multimedia Expo (ICME 6), Toronto, Canada, July 6. [3] IEEE Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, P8., Nov [4] F. P. Kelly, Charging and rate control for elastic traffic, European Trans. on Telecommunications, vol. 8, no., pp , Jan. 997.

8 8 [5] F. Kelly, A. Maulloo, and D. Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of Operations Research Society, vol. 49, no. 3, pp. 37 5, 998. [6] R. J. La and V. Anantharam, Utility-based rate control in the internet for elastic traffic, IEEE Trans. on Networking, vol., no., pp. 7 85, Oct.. [7] T. Nguyen and A. Zakhor, Multiple sender distributed video streaming, IEEE Trans. on Multimedia, vol. 6, no., pp , Apr. 4. [8] J. Cabrera and A. Ortega, Stochastic rate control of video coders for wireless channels, IEEE Trans. on Circuits and Systems for Video Technology, vol., no. 6, pp , June. [9] Y. Li, A. Markopoulou, J. Apostolopoulos, and N. Bambos, Packet transmission and content-dependent playout for video streaming over wireless networks, Proc. IEEE International Workshop on Multimedia Signal Processing, Shanghai, China, Oct. 5. [] M. van Der Schaar and N. Sai Shankar, Cross-layer wireless multimedia transmission: challenges, principles, and new paradigms, IEEE Wireless Communications, vol., no. 4, pp. 5 58, Aug. 5. [] D. Li and Q. Zhang, Multi-source multi-path video streaming over wireless mesh networks, Proc. IEEE International Symposium on Circuit and Systems (ISCAS 6), Island of Kos, Greece, May 6. [] X. Zhu and B. Girod, A distributed algorithm for congestion-minimized multi-path routing over ad hoc networks, Proc. IEEE International Conference on Multimedia and Expo (ICME 5), Amsterdam, The Netherlands, pp , July 5. [3] X. Zhu, J. P. Singh, and B. Girod, Joint routing and rate allocation for multiple video streams in ad hoc wireless networks, Journal of Zhejiang University, Science A, vol. 7, no. 5, pp , May 6. [4] X. Zhu and B. Girod, Distributed rate allocation for multi-stream video transmission over ad hoc networks, Proc. IEEE International Conference on Image Processing (ICIP 5), Genoa, Italy, vol., pp. 57 6, Dec. 5. [5] L. Kleinrock, Queuing Systems, Volume II: Computer Applications, Wiley Interscience, New York, USA, 976. [6] D. B. Johnson, D. A. Maltz, and J. Broch, Dsr: The dynamic source routing protocol for multi-hop wireless ad hoc networks, in Ad Hoc Networking, Chapter 5, Charles E. Perkins, Ed., pp Addison- Wesley, 996. [7] K. Stuhlmüller, N. Färber, M. Link, and B. Girod, Analysis of video transmission over lossy channels, IEEE Journal on Selected Areas in Communications, vol. 8, no. 6, pp. 3, June. [8] NS-, [9] ITU-T and ISO/IEC JTC, Advanced Video Coding for Generic Audiovisual services, ITU-T Recommendation H.64 - ISO/IEC (AVC), 3. [] M. Handley and S. Floyd and J. Pahdye and J. Widmer, TCP Friendly Rate Control (TFRC): Protocol Specification, RFC 3448, Jan. 3.