@article{FDTT-CGCWNPT-07,
Title = {Closing the gap in the capacity of wireless networks via percolation theory},
Author = {Franceschetti, Massimo and Dousse, Olivier and Tse, David N.C. and Thiran, Patrick},
Pages = {1009–1018},
Year = {2007},
Issn = {0018-9448},
Doi = {http://dx.doi.org/10.1109/TIT.2006.890791},
Journal = {IEEE Transactions on Information Theory},
Volume = {53},
Number = {3},
Month = {March},
Note = {See http://infoscience.epfl.ch/record/112054 for the correction of a typo.},
Abstract = {An achievable bit rate per source-destination pair in a wireless network of {\it n} randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same {\it 1/√(n)} transmission rate of arbitrarily located nodes. This contrasts with previous results suggesting that a {\it 1/√(n log n)} reduced rate is the price to pay for the randomness due to the random location of the nodes. The network operation strategy to achieve the result corresponds to the transition region between order and disorder of an underlying percolation model. If nodes are allowed to transmit over large distances, then paths of connected nodes that cross the entire network area can be easily found, but these generate excessive interference. If nodes transmit over short distances, then such crossing paths do not exist. Percolation theory ensures that crossing paths form in the transition region between these two extreme scenarios. Nodes along these paths are used as a backbone, relaying data for other nodes, and can transport the total amount of information generated by all the sources. A lower bound on the achievable bit rate is then obtained by performing pairwise coding and decoding at each hop along the paths, and using a time division multiple access scheme.},
Url = {http://www.net.t-labs.tu-berlin.de/papers/FDTT-CGCWNPT-07.pdf},
Categories = {tlabs_yes, group_feldmann},
Projectname = {thisisimportant}
}