DocumentCode :
2945879
Title :
Worst-case asymmetric distributed source coding
Author :
Agnihotri, Samar ; Jamadagni, H.S.
Author_Institution :
CEDT, Indian Inst. of Sci., Bangalore
fYear :
2008
fDate :
23-26 Sept. 2008
Firstpage :
653
Lastpage :
660
Abstract :
We consider the asymmetric distributed source coding problem, where the recipient interactively communicates with N correlated informants to gather their data. We are mainly interested in minimizing the worst-case number of informant bits required for successful data-gathering at recipient, but we are also concerned with minimizing the number of rounds as well as the number of recipient bits. We provide two algorithms, one that optimally minimizes the number of informant bits and other that trades-off the number of informant bits to efficiently reduce the number of rounds and number of recipient bits.
Keywords :
source coding; asymmetric distributed source coding; data-gathering; informant bit minimisation; recipient bits; Computer networks; Distributed computing; Energy consumption; Information analysis; Performance analysis; Probability distribution; Protocols; Source coding; Turbo codes; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Conference_Location :
Urbana-Champaign, IL
Print_ISBN :
978-1-4244-2925-7
Electronic_ISBN :
978-1-4244-2926-4
Type :
conf
DOI :
10.1109/ALLERTON.2008.4797620
Filename :
4797620
Link To Document :
بازگشت