Matrix analysis
Multicast routing in a datagram internetwork
Multicast routing in a datagram internetwork
Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Introduction to Linear Optimization
Introduction to Linear Optimization
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Scale-free aggregation in sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed sensor localization in random environments using minimal number of anchor nodes
IEEE Transactions on Signal Processing
Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
Order-optimal consensus through randomized path averaging
IEEE Transactions on Information Theory
Coding With Side Information for Rate-Constrained Consensus
IEEE Transactions on Signal Processing - Part I
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow
IEEE Transactions on Information Theory
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
| Hi-index | 35.68 |
In this paper, we study a class of distributed computing problems where a group of nodes (destinations) is interested in a function of data which are stored by another group of nodes (sources). We assume that the function of interest is separable, i.e.,it can be decomposed as a sum of functions of local variables, a case that subsumes several interesting types of queries. One approach to solve this problem is to route raw information from the sources to the interested destinations by either unicasting or multicasting. The second approach is to compute the function of interest along some routes while propagating the information from the sources to the destinations. Considering the second scenario,the goal of this paper is to examine how information should be forwarded to the intended recipients, computing along the routes by gossiping with selected neighbors. Unlike efficient unicasting/multicasting problems, nodes are interested in a specific function of the data, rather than the raw data themselves. Moreover, unlike standard gossiping problems, in our case, the information needs to flow in a specific direction. Given the underlying network connectivity and the source-destination sets, we provide necessary and sufficient conditions on the update weights (referred to as codes) so that the destination nodes converge to the desired function of the source values.We show that the evolution of the source states does not affect the feasibility of the problem, and we provide a detailed analysis on the spectral properties of the feasible codes. We also study the problem feasibility under some specific topologies and provide guidelines to determine infeasibility. We also formulate different strategies to design codes, and compare the performance of our solution with existing alternatives.