Profit Maximization through Online Advertising Scheduling for a Wireless Video Broadcast Network

被引:18
作者
Ji, Wen [1 ]
Chen, Yingying [2 ]
Chen, Min [3 ]
Chen, Bo-Wei [4 ]
Chen, Yiqiang [1 ]
Kung, Sun-Yuan [4 ]
机构
[1] Chinese Acad Sci, Beijing Key Lab Mobile Comp & Pervas Device, Inst Comp Technol, Beijing 100190, Peoples R China
[2] Stevens Inst Technol, Dept Elect & Comp Engn, Hoboken, NJ 07030 USA
[3] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China
[4] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
中国国家自然科学基金;
关键词
Video; broadcasting; profit; polymatroid; advertisement; RESOURCE-ALLOCATION; CODED MULTICAST; JOINT SOURCE; SYSTEMS; MIMO; TRANSMISSION; OPTIMIZATION; TRADEOFF; RELAYS; WIMAX;
D O I
10.1109/TMC.2015.2485984
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we address the problem of how to make the wireless service provider (WSP) earn profits in a wireless video broadcast network with consideration of advertisement insertion. At the beginning, this study examines the profit components by analyzing traffic provision and advertisement insertion. This study considers using two components for profit maximization-one is the function for allocating video rates, and the other is the function for inserting advertisement duration. The maximum achievable profit depends on joint optimization of optimal video-rate vectors and advertisement-duration vectors, which are usually computationally intensive. To resolve such a complexity problem, this work also proposes an effective algorithm for joint optimization. First, the overall profit is formulated as the solution of four local optimization problems through horizontal and vertical decomposition. Second, a theoretic polymatroidal framework is introduced in our work for optimization as this framework is proved effective in profit maximization of multiuser systems. Third, this study shows that the overall profit can be maximized by finding the optimal profit points on the boundary of the rate and duration regions. As a result, the optimum points and the total profit can be obtained through a hierarchical greedy algorithm. Experimental results demonstrate that the proposed method is capable of making maximum profits for WSPs in a wide range of broadcasting rates.
引用
收藏
页码:2064 / 2079
页数:16
相关论文
共 36 条
[1]   Layered Wireless Video Multicast Using Relays [J].
Alay, Oezgue ;
Korakis, Thanasis ;
Wang, Yao ;
Erkip, Elza ;
Panwar, Shivendra S. .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2010, 20 (08) :1095-1109
[2]  
[Anonymous], 2013, White Paper
[3]   Scalable joint source and channel coding of meshes [J].
Cernea, Dan C. ;
Munteanu, Adrian ;
Alecu, Alin ;
Cornelis, Jan ;
Schelkens, Peter .
IEEE TRANSACTIONS ON MULTIMEDIA, 2008, 10 (03) :503-513
[4]   Scheduling Algorithms for Broadcasting Media with Multiple Distortion Measures [J].
Chan, Carri W. ;
Bambos, Nick ;
Wee, Susie ;
Apostolopoulos, John .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (08) :4188-4199
[5]  
Dunstan F. D., 1973, Mathematical Programming, V5, P338
[6]  
Edmonds J., 1969, P CALG INT C COMB ST, P69
[7]   A general model for matroids and the greedy algorithm [J].
Faigle, Ulrich ;
Fujishige, Satoru .
MATHEMATICAL PROGRAMMING, 2009, 119 (02) :353-369
[8]   Energy-Efficiency Optimization for MIMO-OFDM Mobile Multimedia Communication Systems With QoS Constraints [J].
Ge, Xiaohu ;
Huang, Xi ;
Wang, Yuming ;
Chen, Min ;
Li, Qiang ;
Han, Tao ;
Wang, Cheng-Xiang .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2014, 63 (05) :2127-2138
[9]  
Ha S., 2012, P SIGCOMM AUG, V2, P247
[10]   Scalable Video Multicast in Hybrid 3G/Ad-Hoc Networks [J].
Hua, Sha ;
Guo, Yang ;
Liu, Yong ;
Liu, Hang ;
Panwar, Shivendra S. .
IEEE TRANSACTIONS ON MULTIMEDIA, 2011, 13 (02) :402-413