File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Maximizing multicast call acceptance rate in multi-channel multi-interface wireless mesh networks

TitleMaximizing multicast call acceptance rate in multi-channel multi-interface wireless mesh networks
Authors
Keywordsbandwidth-guaranteed multicast tree
load balancing
Wireless mesh network
Issue Date2010
PublisherIEEE
Citation
IEEE Transactions On Wireless Communications, 2010, v. 9 n. 8, p. 2622-2631 How to Cite?
AbstractIn this paper, we consider the problem of constructing bandwidth-guaranteed multicast tree in multi-channel multi-interface wireless mesh networks. We focus on the scenario of dynamic multicast call arrival, where each call has a specific bandwidth requirement. A call is accepted if a multicast tree with sufficient bandwidth on each link can be constructed. Intuitively, if the carried load on both the most-heavily loaded channel and the most-heavily loaded node is minimized, the traffic load in the network will be balanced. If the network load is balanced, more room will be available for accommodating future calls. This would maximize the call acceptance rate in the network. With the above notion of load balancing in mind, an Integer Linear Programming (ILP) formulation is formulated for constructing bandwidth-guaranteed tree. We show that the above problem is NP-hard, and an efficient heuristic algorithm called Largest Coverage Shortest-Path First (LC-SPF) is devised. Simulation results show that LC-SPF yields comparable call acceptance rate as the ILP formulation, but with much shorter running time. © 2010 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/139277
ISSN
2015 Impact Factor: 2.925
2015 SCImago Journal Rankings: 2.340
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChiu, HSen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2011-09-23T05:47:50Z-
dc.date.available2011-09-23T05:47:50Z-
dc.date.issued2010en_HK
dc.identifier.citationIEEE Transactions On Wireless Communications, 2010, v. 9 n. 8, p. 2622-2631en_HK
dc.identifier.issn1536-1276en_HK
dc.identifier.urihttp://hdl.handle.net/10722/139277-
dc.description.abstractIn this paper, we consider the problem of constructing bandwidth-guaranteed multicast tree in multi-channel multi-interface wireless mesh networks. We focus on the scenario of dynamic multicast call arrival, where each call has a specific bandwidth requirement. A call is accepted if a multicast tree with sufficient bandwidth on each link can be constructed. Intuitively, if the carried load on both the most-heavily loaded channel and the most-heavily loaded node is minimized, the traffic load in the network will be balanced. If the network load is balanced, more room will be available for accommodating future calls. This would maximize the call acceptance rate in the network. With the above notion of load balancing in mind, an Integer Linear Programming (ILP) formulation is formulated for constructing bandwidth-guaranteed tree. We show that the above problem is NP-hard, and an efficient heuristic algorithm called Largest Coverage Shortest-Path First (LC-SPF) is devised. Simulation results show that LC-SPF yields comparable call acceptance rate as the ILP formulation, but with much shorter running time. © 2010 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE-
dc.relation.ispartofIEEE Transactions on Wireless Communicationsen_HK
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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectbandwidth-guaranteed multicast treeen_HK
dc.subjectload balancingen_HK
dc.subjectWireless mesh networken_HK
dc.titleMaximizing multicast call acceptance rate in multi-channel multi-interface wireless mesh networksen_HK
dc.typeArticleen_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/TCOMM.2010.062310.091323en_HK
dc.identifier.scopuseid_2-s2.0-77955710387en_HK
dc.identifier.hkuros195080en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77955710387&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume9en_HK
dc.identifier.issue8en_HK
dc.identifier.spage2622en_HK
dc.identifier.epage2631en_HK
dc.identifier.isiWOS:000283063400026-
dc.publisher.placeUnited Statesen_HK
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