File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Interface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networks

TitleInterface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networks
Authors
KeywordsInterface placement
Multiple channels
Multiple interfaces
Widest spanning tree
Wireless mesh network
Issue Date2009
PublisherIEEE Communications Society.
Citation
Ieee Wireless Communications And Networking Conference, Wcnc, 2009 How to Cite?
AbstractWidest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms jointly consider channel assignment, routing and scheduling while assuming the number of network interface cards (NICs) at each node is given. In this paper, we treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given. By properly placing more NICs to more "critical" nodes, the bandwidth of the spanning tree can be further increased. To this end, a new Integer Linear Programming (ILP) is formulated for solving the widest spanning tree problem based on joint optimization of interface placement, channel assignment, routing and scheduling. Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found. © 2009 IEEE.
DescriptionProceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 2560-2564
Persistent Identifierhttp://hdl.handle.net/10722/61922
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChiu, HSen_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorLui, KSen_HK
dc.date.accessioned2010-07-13T03:50:15Z-
dc.date.available2010-07-13T03:50:15Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee Wireless Communications And Networking Conference, Wcnc, 2009en_HK
dc.identifier.issn1525-3511en_HK
dc.identifier.urihttp://hdl.handle.net/10722/61922-
dc.descriptionProceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 2560-2564en_HK
dc.description.abstractWidest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms jointly consider channel assignment, routing and scheduling while assuming the number of network interface cards (NICs) at each node is given. In this paper, we treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given. By properly placing more NICs to more "critical" nodes, the bandwidth of the spanning tree can be further increased. To this end, a new Integer Linear Programming (ILP) is formulated for solving the widest spanning tree problem based on joint optimization of interface placement, channel assignment, routing and scheduling. Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE Communications Society.-
dc.relation.ispartofIEEE 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©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.subjectInterface placementen_HK
dc.subjectMultiple channelsen_HK
dc.subjectMultiple interfacesen_HK
dc.subjectWidest spanning treeen_HK
dc.subjectWireless mesh networken_HK
dc.titleInterface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1525-3511&volume=&spage=2560&epage=2564&date=2009&atitle=Interface+placement+in+constructing+widest+spanning+tree+for+multi-channel+multi-interface+wireless+mesh+networks-
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/WCNC.2009.4917760en_HK
dc.identifier.scopuseid_2-s2.0-70349181006en_HK
dc.identifier.hkuros163991en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70349181006&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage2560-
dc.identifier.epage2564-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChiu, HS=7401986712en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats