Download Now Free registration required
The authors consider the problem of finding the maximum directed packet flow that can be sustained in an infinite wireless multi-hop network. This ability of the network to relay traffic is called the forwarding capacity, and the problem appears when the spatial scales corresponding to the end-to-end paths (routing) and the neighboring nodes (forwarding) are strongly separated in a massively dense network. They assume a Boolean interference model. The infinite network is approximated with a finite but large network where the node locations form a spatial Poisson process. They study two constructive approaches to tighten the lower bound for the forwarding capacity by a significant amount.
- Format: PDF
- Size: 435.1 KB