DocumentCode :
3616949
Title :
Scaling laws for correlated data gathering
Author :
R. Cristescut;B. Beferull-Lozano;M. Vetterlit
Author_Institution :
Ecole Polytech. Fed. de Lausanne, Switzerland
fYear :
2004
fDate :
6/26/1905 12:00:00 AM
Firstpage :
471
Abstract :
Consider a set of correlated sources located at the nodes of a network, and a sink to which the data from all the sources have to arrive. We address the minimization of a separable joint communication cost function given by the product [rate] o [edge weight]. We present two possible approaches for rate allocation, namely Slepian-Wolf coding, and coding by explicit communication, and compare asymptotically (large networks) the associated total costs by finding their corresponding scaling laws and analyzing the ratio between them. We also provide the specific conditions on the correlation structure which determine the different cases of asymptotic behaviors
Keywords :
"Cost function","Collaboration","Relays","Electronic mail","Joining processes","Entropy","Mobile communication","Sampling methods"
Publisher :
ieee
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
Type :
conf
DOI :
10.1109/ISIT.2004.1365509
Filename :
1365509
Link To Document :
بازگشت