Download now Free registration required
The authors address the problem of "Capacity Allocation" in Wireless Mesh Networks (WMNs). In the "Capacity Allocation" problem, the network topology (namely the desired wireless links) and routing are given. The problem then is to assign capacities to different links (which are carved out of the radio capacity of a wireless node) in such a way that the average network delay is minimized. This classic problem has been solved by Kleinrock for wired networks subject to a cost constraint.
- Format: PDF
- Size: 382.7 KB