By Topic

Jointly Optimal Rate Control and Relay Selection for Cooperative Wireless Video Streaming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhangyu Guan ; School of Information Science and Engineering, Shandong University, China ; Tommaso Melodia ; Dongfeng Yuan

Physical-layer cooperation allows leveraging the spatial diversity of wireless channels without requiring multiple antennas on a single device. However, most research in this field focuses on optimizing physical-layer metrics, with little consideration for network-wide and application-specific performance measures. This paper studies cross-layer design techniques for video streaming over cooperative networks. The problem of joint rate control, relay selection, and power allocation is formulated as a mixed-integer nonlinear problem, with the objective of maximizing the sum peak signal-to-noise ratio (PSNR) of a set of concurrent video sessions. A global optimization algorithm based on the branch and bound framework and on convex relaxation of nonconvex constraints is then proposed to solve the problem. The proposed algorithm can provide a theoretical upper bound on the achievable video quality and is shown to provably converge to the optimal solution. In addition, it is shown that cooperative relaying allows nodes to save energy without leading to a perceivable decrease in video quality. Based on this observation, an uncoordinated, distributed, and localized low-complexity algorithm is designed, for which we derive conditions for convergence to a Nash equlibrium (NE) of relay selection. The distributed algorithm is also shown to achieve performance comparable in practice to the optimal solution.

Published in:

IEEE/ACM Transactions on Networking  (Volume:21 ,  Issue: 4 )