Abstract
Scalable video coding (SVC) is a promising technology for video multicast to users with different available transmission capacities. On the other hand, adaptive modulation and coding (AMC) schemes provide an efficient way to better utilize wireless network resources. However, the resource-allocation problem to support SVC multicast over wireless relay networks is a challenging one due to the existence of relay stations (RSs). We simplify the resource-allocation problem in this paper by assuming that the modulation and coding schemes (MCSs) assigned to lower video layers have equal or better coverage area than that assigned to higher video layers at each base station (BS)/RS. We discuss the optimal solution to the simplified problem and its relation with the orienteering problem (OP). Then, we propose a tabu search (TS)-based metaheuristic algorithm for dealing with the problem, which has been proven to be an effective and efficient algorithm for OP. The simulation results reveal that the proposed algorithm outperforms other algorithms under the assumptions of two-hop wireless relay networks or separated transmissions for the relay and access links, and it maintains a good approximation to the optimal results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
