Separating distributed source coding from network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Algorithmic aspects of the time synchronization problem in large-scale sensor networks
Mobile Networks and Applications
Network coding theory: single sources
Communications and Information Theory
A Cross-Layer Framework for Exploiting Virtual MISO Links in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Information fusion for wireless sensor networks: Methods, models, and classifications
ACM Computing Surveys (CSUR)
LDGM codes for channel coding and joint source-channel coding of correlated sources
EURASIP Journal on Applied Signal Processing
Sequential and parallel deficit scaling algorithms for minimum flow in bipartite networks
WSEAS Transactions on Computers
A parallel algorithm for the minimum flow problem in bipartite networks
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
The wave preflow algorithm for the minimum flow problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
About minimum cost flow problem in networks with node capacities
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
About flow problems in networks with node capacities
WSEAS Transactions on Computers
Source and channel coding for correlated sources over multiuser channels
IEEE Transactions on Information Theory
Amplify and forward for correlated data gathering over hierarchical sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Universal source coding over generalized complementary delivery networks
IEEE Transactions on Information Theory
Correlation, coding, and cooperation in wireless sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Collaborating with correlation for energy efficient WSN
Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
Approximate decoding approaches for network coded correlated data
Signal Processing
In-Network Computations of Machine-to-Machine Communications for Wireless Robotics
Wireless Personal Communications: An International Journal
Hi-index | 754.96 |
Consider the following network communication setup, originating in a sensor networking application we refer to as the "sensor reachback" problem. We have a directed graph G=(V,E), where V={v0v1...vn} and E⊆V×V. If (vi,vj)∈E, then node i can send messages to node j over a discrete memoryless channel (DMC) (Xij,pij(y|x),Yij), of capacity Cij. The channels are independent. Each node vi gets to observe a source of information Ui(i=0...M), with joint distribution p(U0U1...UM). Our goal is to solve an incast problem in G: nodes exchange messages with their neighbors, and after a finite number of communication rounds, one of the M+1 nodes (v0 by convention) must have received enough information to reproduce the entire field of observations (U0U1...UM), with arbitrarily small probability of error. In this paper, we prove that such perfect reconstruction is possible if and only if H(Us | US(c)) i∈S,j∈S(c) for all S⊆{0...M},S≠O,0∈S(c). Our main finding is that in this setup, a general source/channel separation theorem holds, and that Shannon information behaves as a classical network flow, identical in nature to the flow of water in pipes. At first glance, it might seem surprising that separation holds in a fairly general network situation like the one we study. A closer look, however, reveals that the reason for this is that our model allows only for independent point-to-point channels between pairs of nodes, and not multiple-access and/or broadcast channels, for which separation is well known not to hold. This "information as flow" view provides an algorithmic interpretation for our results, among which perhaps the most important one is the optimality of implementing codes using a layered protocol stack.