File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleA joint routing and scheduling algorithm for efficient broadcast in wireless mesh networks
Authors
KeywordsBroadcast
Joint routing and schedule
Multiple channels
Multiple interfaces
Wireless mesh network
Issue Date2010
PublisherIEEE Communications Society.
Citation
The 2010 IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, 18-21 April 2010. In Proceedings of WCNC, 2010, p. 1-6 How to Cite?
AbstractWith 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. ©2010 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/140249
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChiu, HSen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2011-09-23T06:09:18Z-
dc.date.available2011-09-23T06:09:18Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 2010 IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, 18-21 April 2010. In Proceedings of WCNC, 2010, p. 1-6en_HK
dc.identifier.issn1525-3511en_HK
dc.identifier.urihttp://hdl.handle.net/10722/140249-
dc.description.abstractWith 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. ©2010 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE Communications Society.-
dc.relation.ispartofProceedings of the IEEE Wireless Communications and Networking Conference, WCNCen_HK
dc.rightsIEEE Wireless Communications and Networking Conference. Proceedings. Copyright © IEEE Communications Society.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectBroadcasten_HK
dc.subjectJoint routing and scheduleen_HK
dc.subjectMultiple channelsen_HK
dc.subjectMultiple interfacesen_HK
dc.subjectWireless mesh networken_HK
dc.titleA joint routing and scheduling algorithm for efficient broadcast in wireless mesh networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/WCNC.2010.5506548en_HK
dc.identifier.scopuseid_2-s2.0-77955020732en_HK
dc.identifier.hkuros195083en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77955020732&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage6-
dc.publisher.placeUnited Statesen_HK
dc.description.otherThe 2010 IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, 18-21 April 2010. In Proceedings of WCNC, 2010, p. 1-6-
dc.identifier.scopusauthoridChiu, HS=7401986712en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats