Download Now Free registration required
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, the authors treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given.
- Format: PDF
- Size: 328.2 KB