Provided by: Institute of Electrical and Electronics Engineers
With the increasing popularity of Wireless Mesh Networks (WMNs), broadcasting traffic (e.g. IP-TV) will contribute a large portion of network load. In this paper, the authors consider a multi-channel multi-interface WMN with real time broadcast call arrivals. Aiming at maximizing the call acceptance rate of the network, an efficient broadcast tree construction algorithm, called Schedule-based Greedy Expansion (S-Expand), is designed. Unlike the existing time fraction approach, which focuses on assigning time fractions to tree links to guarantee the existence of a feasible schedule, they follow the approach of joint routing and scheduling.