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.
| Original language | English |
|---|---|
| DOIs | |
| Publication status | Published - 2009 |
| Event | 2009 IEEE Wireless Communications and Networking Conference, WCNC 2009 - Budapest, Hungary Duration: 5 Apr 2009 → 8 Apr 2009 |
Conference
| Conference | 2009 IEEE Wireless Communications and Networking Conference, WCNC 2009 |
|---|---|
| Country/Territory | Hungary |
| City | Budapest |
| Period | 5/04/09 → 8/04/09 |
Keywords
- Interface placement
- Multiple channels
- Multiple interfaces
- Widest spanning tree
- Wireless mesh network