Download Now Free registration required
The focus of this paper is on routing in Wireless Mesh Networks (WMNs) that results in Spatial TDMA (STDMA) schedules with minimum frame length. In particular, the emphasis is on spanning tree construction; and the authors formulate the joint routing, power control, and scheduling problem as a Mixed Integer Linear Program (MILP). Since this is an NP-complete problem, they propose a low-complexity iterative pruning-based routing scheme that utilizes scheduling information to construct the spanning tree. A randomized version of this scheme is also discussed and numerical investigations reveal that the proposed iterative pruning algorithms outperform previously proposed routing schemes that aim to minimize the transmitted power or interference produced in the network without explicitly taking into account scheduling decisions.
- Format: PDF
- Size: 1519.7 KB