期刊论文

Chang, Yanan

英文

Computers & Electrical Engineering

0045-7906

2015

48

214-225

10.1016/j.compeleceng.2015.07.002

In this section, we present a three-step method to minimize the length of the time frame Tf. We first define the a routing metric called per receiver delay to build the broadcast routing tree. Then, we do fine adjustment of the tree structure to reduce the interference. Last, we propose a scheduling method by computing the maximum weighted independent set of the conflict graph constructed based on the obtained routing tree in the first step.

本校为第一且通讯机构

In this paper, we address the problem of broadcast routing and scheduling of video streaming for delay-sensitive applications in backbone wireless mesh networks. Given a source node and a set of destinations, we aim to build a broadcast tree and compute an optimal schedule such that the throughput for the source to broadcast streaming data to all the destinations is maximized. We divide the whole period for video broadcast into identical time frames and prove that maximizing the throughput can be converted into minimizing the length of a time f...