Protocols for asymmetric communication channels
Journal of Computer and System Sciences
On the interdependence of routing and data compression in multi-hop sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Improved bounds for asymmetric communication protocols
Information Processing Letters
Infranet: Circumventing Web Censorship and Surveillance
Proceedings of the 11th USENIX Security Symposium
DCC '03 Proceedings of the Conference on Data Compression
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Compression with Side Information Using Turbo Codes
DCC '02 Proceedings of the Data Compression Conference
Slepian-Wolf Coding of Multiple M-ary Sources Using LDPC Codes
DCC '04 Proceedings of the Conference on Data Compression
Design of Slepian-Wolf Codes by Channel Code Partitioning
DCC '04 Proceedings of the Conference on Data Compression
On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding
DCC '04 Proceedings of the Conference on Data Compression
DCC '04 Proceedings of the Conference on Data Compression
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Lower bounds for asymmetric communication channels and distributed source coding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On optimal communication cost for gathering correlated data through wireless sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Dynamic asymmetric communication
Information Processing Letters
Distributed function computation in asymmetric communication scenarios
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Adaptive data collection in sensor networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Dynamic asymmetric communication
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Randomized algorithms and probabilistic analysis in wireless networking
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
| Hi-index | 0.00 |
A fundamental problem in the study of sensor networks is collecting data to a central server from a set of k distributed sensor nodes. A considerable amount of recent research in this area attempts to reduce the number of bits sent by the nodes by taking advantage of correlations between the data items collected from different nodes. In this paper, we study this problem in the following model: let D be a probability distribution over k binary strings of length n. A sample &Xmacr; is drawn from D and the k strings of &Xmacr; are revealed to the nodes, one string per node. The goal is to inform the server of all k strings of &Xmacr;. Our primary objective is to minimize the total number of bits sent by the nodes, but we also seek to minimize both the bits sent by the server and the number of rounds required. This problem is a natural parallelization of the model introduced in [2], and is also well motivated by recent work on distributed source coding for sensor networks. Our main result is a protocol that allows the server to correctly determine &Xmacr;. In this protocol, the nodes send O(H(D) + k) bits in expectation, where H(D) is the binary entropy of D; this is asymptotically optimal. The server sends O(kn + H(D) log n) bits in expectation, and the number of rounds is O(1 + log[H(D)]) in expectation. We also demonstrate that if the server is allowed to produce an incorrect result with probability up to Δ, then the expected number of bits sent by the server can be reduced to O(k log(nk/Δ) + H(D) log n), without increasing the other measures of performance.