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

Proceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 2560-2564Widest 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.published_or_final_versio