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

Authors:
Hon Sun Chiu;Kwan L. Yeung;King-Shan Lui
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, PRC;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, PRC;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, PRC
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 10
Cited 2

Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Reconsidering wireless systems with multiple radios

ACM SIGCOMM Computer Communication Review
Maximum Lifetime Broadcasting in Wireless Networks

IEEE Transactions on Computers
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay

IEEE Transactions on Mobile Computing
Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks

WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
J-CAR: an efficient joint channel assignment and routing protocol for IEEE 802.11-based multi-channel multi-interface mobile ad hoc networks

IEEE Transactions on Wireless Communications
Bandwidth-guaranteed multicast in multi-channel multi-interface wireless mesh networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On the complexity and distributed construction of energy-efficient broadcast trees in wireless ad hoc networks

IEEE Transactions on Wireless Communications
Multicast: wired to wireless

IEEE Communications Magazine

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

IEEE Transactions on Wireless Communications
Realizing and benchmarking broadcast algorithms in wireless mesh networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Widest 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.