Download Now Free registration required
In a large multi-hop wireless network, nodes are preferable to make distributed link-scheduling decisions with information exchange only among a small number of neighbors. However, for a slowly-decaying channel and densely-populated interfering nodes, a small size neighborhood often results in nontrivial link outages and is thus insufficient for making optimal scheduling decisions. A question arises how to incorporate the information outside a neighborhood in distributed link-scheduling. In this paper, the authors develop joint approximation of information and distributed link scheduling.
- Format: PDF
- Size: 532.68 KB