TY - GEN
T1 - Efficient scheduling for multicasting multimedia data with adaptive random liner network coding in relay-aided network
AU - Li, Bin
AU - Ban, Dengke
AU - Zhang, Ruonan
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/6/17
Y1 - 2015/6/17
N2 - Random liner network coding (RLNC) is an efficient coding scheme to improve the performance of the wireless multicast networks. However, traditional RLNC comes with a sacrifice in service delay because if the users are not able to collect a full size of the encoding packets, the useful information can not be recovered under the wireless fading channel. This effect is more severe for transmitting the hard deadline constrained prioritized (HDCP) data due to the limited delivery time and data interdependencies. On the other hand, relay scheme provides a useful way to overcome the fading problem in wireless network. Accordingly, we propose a BS-relay competitive scheduling algorithm (BRCS) which introduced adaptive RLNC in the rely-aided wireless network to deliver the HDCP data, to overcome the problem above. BRCS fully considered the property of the multimedia data and design a scheduling scheme, in which BS and relay compete with other to choose the best encoding packet for transmission so as to maximize the network throughput for the given hard deadline. Moreover, to show the performance of BRCS, we compared with other scheduling schemes and the simulation results are provided to corroborate the effectiveness of the proposed technique.
AB - Random liner network coding (RLNC) is an efficient coding scheme to improve the performance of the wireless multicast networks. However, traditional RLNC comes with a sacrifice in service delay because if the users are not able to collect a full size of the encoding packets, the useful information can not be recovered under the wireless fading channel. This effect is more severe for transmitting the hard deadline constrained prioritized (HDCP) data due to the limited delivery time and data interdependencies. On the other hand, relay scheme provides a useful way to overcome the fading problem in wireless network. Accordingly, we propose a BS-relay competitive scheduling algorithm (BRCS) which introduced adaptive RLNC in the rely-aided wireless network to deliver the HDCP data, to overcome the problem above. BRCS fully considered the property of the multimedia data and design a scheduling scheme, in which BS and relay compete with other to choose the best encoding packet for transmission so as to maximize the network throughput for the given hard deadline. Moreover, to show the performance of BRCS, we compared with other scheduling schemes and the simulation results are provided to corroborate the effectiveness of the proposed technique.
KW - adaptive scheduling
KW - HDCP data
KW - multicast
KW - Multimedia
KW - random network coding
KW - relay-aided
UR - http://www.scopus.com/inward/record.url?scp=84938719062&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2015.7127704
DO - 10.1109/WCNC.2015.7127704
M3 - 会议稿件
AN - SCOPUS:84938719062
T3 - 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
SP - 1584
EP - 1589
BT - 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
Y2 - 9 March 2015 through 12 March 2015
ER -