A joint routing and scheduling algorithm for efficient broadcast in wireless mesh networks

Hon Sun Chiu, Kwan L. Yeung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

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, we 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, we follow the approach of joint routing and scheduling. The proposed S-Expand algorithm packs non-interfering transmissions to use the same time slots; this would allow more flexibility in accepting future calls. Simulation results show that S-Expand achieves higher call acceptance rate than the traditional time fraction approach.

Original languageEnglish
Title of host publication2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings
DOIs
Publication statusPublished - 2010
EventIEEE Wireless Communications and Networking Conference 2010, WCNC 2010 - Sydney, NSW, Australia
Duration: 18 Apr 201021 Apr 2010

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

ConferenceIEEE Wireless Communications and Networking Conference 2010, WCNC 2010
Country/TerritoryAustralia
CitySydney, NSW
Period18/04/1021/04/10

Keywords

  • Broadcast
  • Joint routing and schedule
  • Multiple channels
  • Multiple interfaces
  • Wireless mesh network

Fingerprint

Dive into the research topics of 'A joint routing and scheduling algorithm for efficient broadcast in wireless mesh networks'. Together they form a unique fingerprint.

Cite this