000112054 001__ 112054
000112054 005__ 20190316234036.0
000112054 037__ $$aARTICLE
000112054 245__ $$aClosing the gap in the capacity of random wireless networks via percolation theory
000112054 269__ $$a2007
000112054 260__ $$c2007
000112054 336__ $$aJournal Articles
000112054 520__ $$aAn 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/\sqrt{n} transmission rate of arbitrarily located nodes. This contrasts with previous results suggesting that a 1/\sqrt{nlogn} 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.
000112054 6531_ $$aWireless networks
000112054 6531_ $$aad-hoc networks
000112054 6531_ $$acapacity
000112054 6531_ $$athroughput
000112054 6531_ $$ascaling laws
000112054 6531_ $$apercolation theory
000112054 6531_ $$aNCCR-MICS
000112054 6531_ $$aNCCR-MICS/CL1
000112054 700__ $$aFranceschetti, Massimo
000112054 700__ $$aDousse, Olivier
000112054 700__ $$aTse, David N C
000112054 700__ $$0240373$$aThiran, Patrick$$g103925
000112054 773__ $$j53$$k3$$q1009-1018$$tIEEE Transactions on Information Theory
000112054 8564_ $$s777985$$uhttps://infoscience.epfl.ch/record/112054/files/FDTT07.pdf$$zn/a
000112054 8564_ $$s100112$$uhttps://infoscience.epfl.ch/record/112054/files/typo_FDTT07.pdf$$zn/a
000112054 909C0 $$0252614$$pLCA$$xUS00024
000112054 909C0 $$0252454$$pLCA3$$xU10431
000112054 909CO $$ooai:infoscience.tind.io:112054$$pIC$$particle$$qGLOBAL_SET
000112054 937__ $$aLCA-ARTICLE-2007-017
000112054 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000112054 980__ $$aARTICLE