File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Widest spanning tree for multi-channel multi-interface wireless mesh networks

TitleWidest spanning tree for multi-channel multi-interface wireless mesh networks
Authors
KeywordsMultiple channels
Multiple interfaces
Widest spanning tree
Wireless mesh network
Issue Date2008
PublisherIEEE.
Citation
Ieee Wireless Communications And Networking Conference, Wcnc, 2008, p. 2194-2199 How to Cite?
AbstractEfficient broadcast schemes are essential in wireless mesh networks (WMNs) for minimizing the content update time. In this paper, we consider the widest spanning tree problem in a multi-channel multi-interface WMN, where the width of a tree is determined by the bottleneck link bandwidth. To the best of our knowledge, we present the first effort in solving the widest spanning tree problem using mathematical formulation. In our model, we jointly consider and solve the problems of channel assignment, routing, scheduling and server/root placement. Unlike other spanning tree approaches, we allow WMN nodes to have heterogeneous number of network interface cards (NICs), and multiple NICs of a node can share the same assigned set of channels. To find a practical schedule, we also introduce the channel conflict graph and NIC constraint graph, and show that the associated scheduling problem is equivalent to the classic graph coloring problem. © 2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99124
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChiu, HSen_HK
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorLui, KSen_HK
dc.date.accessioned2010-09-25T18:16:50Z-
dc.date.available2010-09-25T18:16:50Z-
dc.date.issued2008en_HK
dc.identifier.citationIeee Wireless Communications And Networking Conference, Wcnc, 2008, p. 2194-2199en_HK
dc.identifier.issn1525-3511en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99124-
dc.description.abstractEfficient broadcast schemes are essential in wireless mesh networks (WMNs) for minimizing the content update time. In this paper, we consider the widest spanning tree problem in a multi-channel multi-interface WMN, where the width of a tree is determined by the bottleneck link bandwidth. To the best of our knowledge, we present the first effort in solving the widest spanning tree problem using mathematical formulation. In our model, we jointly consider and solve the problems of channel assignment, routing, scheduling and server/root placement. Unlike other spanning tree approaches, we allow WMN nodes to have heterogeneous number of network interface cards (NICs), and multiple NICs of a node can share the same assigned set of channels. To find a practical schedule, we also introduce the channel conflict graph and NIC constraint graph, and show that the associated scheduling problem is equivalent to the classic graph coloring problem. © 2008 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE Wireless Communications and Networking Conference, WCNCen_HK
dc.subjectMultiple channelsen_HK
dc.subjectMultiple interfacesen_HK
dc.subjectWidest spanning treeen_HK
dc.subjectWireless mesh networken_HK
dc.titleWidest spanning tree for multi-channel multi-interface wireless mesh networksen_HK
dc.typeConference_Paperen_HK
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.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-51649125996en_HK
dc.identifier.hkuros140161en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51649125996&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage2194en_HK
dc.identifier.epage2199en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChiu, HS=7401986712en_HK
dc.identifier.scopusauthoridWu, B=24605804500en_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