Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

An achievable bit rate per source-destination pair in a wireless network of 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 1/radicn transmission rate of arbitrar...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2007-03, Vol.53 (3), p.1009-1018
Main Authors: Franceschetti, M., Dousse, O., Tse, D.N.C., Thiran, P.
Format: Article
Language:English
Subjects:
Ad-hoc networks
Applied sciences
Bit rate
Capacity
Coding, codes
Data transmission
Decoding
Exact sciences and technology
Information theory
Information, signal and communications theory
Interference
Networks
Percolation
Percolation theory
Physics
Probability
Relaying
Relays
scaling laws
Scattering
Signal and communications theory
Spine
Strategy
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Theory
throughput
Time division multiple access
Transmission and modulation (techniques and equipments)
Wireless communication
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An achievable bit rate per source-destination pair in a wireless network of 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 1/radicn transmission rate of arbitrarily located nodes. This contrasts with previous results suggesting that a 1/radicnlogn reduced rate is the price to pay for the randomness due to the 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
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2006.890791