From LINC

Downloads
PDF
PowerPoint

This paper appeared in the proceedings for Allerton 2006.

Abstract

We investigate the transport capacity, or the distance-weighted sum of rates, of wireless erasure networks. These memoryless networks are characterized by independent erasure channels between the nodes, and a wireless broadcast requirement that each node must send the same signal on all of its outgoing channels. Our innovation to the model involves introducing a dependence between the probability of an erasure event over a channel and the physical, geometric distance between the two nodes connected by that channel. We show, under a minimum node separation constraint and for three different models for erasure probability as a function of distance, that transport capacity is upperbounded by a constant multiplied by n, the total number of nodes. Thus, transport capacity can grow no faster than linearly in the number of nodes.

Citation

Brian Smith and Sriram Vishwanath . "Asymptotic Transport Capacity of Wireless Erasure Networks." Proc. 44th Allerton Conf. on Commun., Control and Computing.

BibTeX

@inproceedings{ {{{bitex cite}}},
  author = "Brian Smith and Sriram Vishwanath",
  title = { Asymptotic Transport Capacity of Wireless Erasure Networks },
  booktitle = { Proc. 44th Allerton Conf. on Commun., Control and Computing }
}