TY - GEN
T1 - Widest spanning tree for multi-channel multi-interface wireless mesh networks
AU - Chiu, Hon Sun
AU - Wu, Bin
AU - Yeung, Kwan L.
AU - Lui, King Shan
PY - 2008
Y1 - 2008
N2 - Efficient 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.
AB - Efficient 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.
KW - Multiple channels
KW - Multiple interfaces
KW - Widest spanning tree
KW - Wireless mesh network
UR - http://www.scopus.com/inward/record.url?scp=51649125996&partnerID=8YFLogxK
U2 - 10.1109/wcnc.2008.388
DO - 10.1109/wcnc.2008.388
M3 - Conference contribution
AN - SCOPUS:51649125996
SN - 9781424419968
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 2194
EP - 2199
BT - WCNC 2008 - IEEE Wireless Communications and Networking Conference, Conference Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE Wireless Communications and Networking Conference, WCNC 2008
Y2 - 31 March 2008 through 3 April 2008
ER -