File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2009.5198777
- Scopus: eid_2-s2.0-70449474295
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Bandwidth-guaranteed multicast in multi-channel multi-interface wireless mesh networks
Title | Bandwidth-guaranteed multicast in multi-channel multi-interface wireless mesh networks |
---|---|
Authors | |
Keywords | Broadcast Multicast Multiple channels Multiple interfaces Wireless mesh network |
Issue Date | 2009 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104 |
Citation | Ieee International Conference On Communications, 2009 How to Cite? |
Abstract | We consider multi-channel multi-interface wireless mesh networks with a schedule-based MAC protocol, where conflict-free transmission is ensured by requiring links assigned with the same channel and within the mutual interference range of each other to be active at different time slots. When a (point-to-multipoint) multicast call arrives, the call is accepted if a multicast distribution tree can be established for connecting the source node with all the receiving nodes, and with sufficient bandwidth reserved on each link. Otherwise, the call is rejected. To maximize the call acceptance rate, the multicast tree must be constructed judiciously upon each call arrival. Aiming at minimizing the carried load on the most-heavily loaded channel, and maximizing the residual capacity of the most heavily loaded node, an integer linear program (ILP) is formulated for multicast tree construction. Since solving ILP can be time-consuming, an efficient heuristic algorithm is then proposed. We compare the two tree construction algorithms by simulations. We found that both algorithms give comparable call acceptance rate, but the heuristic algorithm requires much shorter running time. ©2009 IEEE. |
Description | Proceedings of the IEEE International Conference on Communications, 2009, p. 1-5 |
Persistent Identifier | http://hdl.handle.net/10722/62018 |
ISBN | |
ISSN | 2023 SCImago Journal Rankings: 0.861 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hon, SC | en_HK |
dc.contributor.author | Yeung, KL | en_HK |
dc.contributor.author | Lui, KS | en_HK |
dc.date.accessioned | 2010-07-13T03:52:13Z | - |
dc.date.available | 2010-07-13T03:52:13Z | - |
dc.date.issued | 2009 | en_HK |
dc.identifier.citation | Ieee International Conference On Communications, 2009 | en_HK |
dc.identifier.isbn | 978-1-4244-3435-0 | - |
dc.identifier.issn | 0536-1486 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/62018 | - |
dc.description | Proceedings of the IEEE International Conference on Communications, 2009, p. 1-5 | en_HK |
dc.description.abstract | We consider multi-channel multi-interface wireless mesh networks with a schedule-based MAC protocol, where conflict-free transmission is ensured by requiring links assigned with the same channel and within the mutual interference range of each other to be active at different time slots. When a (point-to-multipoint) multicast call arrives, the call is accepted if a multicast distribution tree can be established for connecting the source node with all the receiving nodes, and with sufficient bandwidth reserved on each link. Otherwise, the call is rejected. To maximize the call acceptance rate, the multicast tree must be constructed judiciously upon each call arrival. Aiming at minimizing the carried load on the most-heavily loaded channel, and maximizing the residual capacity of the most heavily loaded node, an integer linear program (ILP) is formulated for multicast tree construction. Since solving ILP can be time-consuming, an efficient heuristic algorithm is then proposed. We compare the two tree construction algorithms by simulations. We found that both algorithms give comparable call acceptance rate, but the heuristic algorithm requires much shorter running time. ©2009 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104 | - |
dc.relation.ispartof | IEEE International Conference on Communications | en_HK |
dc.rights | ©2009 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.subject | Broadcast | en_HK |
dc.subject | Multicast | en_HK |
dc.subject | Multiple channels | en_HK |
dc.subject | Multiple interfaces | en_HK |
dc.subject | Wireless mesh network | en_HK |
dc.title | Bandwidth-guaranteed multicast in multi-channel multi-interface wireless mesh networks | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-1-4244-3435-0 &volume=&spage=1&epage=5&date=2009&atitle=Bandwidth-guaranteed+multicast+in+multi-channel+multi-interface+wireless+mesh+networks | - |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_HK |
dc.identifier.email | Lui, KS:kslui@eee.hku.hk | en_HK |
dc.identifier.authority | Yeung, KL=rp00204 | en_HK |
dc.identifier.authority | Lui, KS=rp00188 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/ICC.2009.5198777 | en_HK |
dc.identifier.scopus | eid_2-s2.0-70449474295 | en_HK |
dc.identifier.hkuros | 163995 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-70449474295&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 1 | - |
dc.identifier.epage | 5 | - |
dc.identifier.scopusauthorid | Hon, SC=35148016600 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.scopusauthorid | Lui, KS=7103390016 | en_HK |
dc.identifier.issnl | 0536-1486 | - |