Computing Along Routes via Gossiping

Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY, USA
IEEE Transactions on Signal Processing (Impact Factor: 3.2). 07/2010; DOI: 10.1109/TSP.2010.2045421
Source: IEEE Xplore

ABSTRACT 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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The focus of this paper is modeling what we call a Social Radar, i.e. a method to estimate the relative influence between social agents, by sampling their opinions and as they evolve, after injecting in the network stubborn agents. The stubborn agents opinion is not influenced by the peers they seek to sway, and their opinion bias is the known input to the social network system. The novelty is in the model presented to probe a social network and the solution of the associated regression problem. The model allows to map the observed opinion onto system equations that can be used to infer the social graph and the amount of trust that characterizes the links.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Though capillary sensor networks have the advantage of reporting punctual estimations of their sensed quantity, it is often useful for the nodes to know the overall average value of the same quantity. This is required, for example, when the network can make autonomous decisions. Several algorithms exist for solving the averaging problem in a distributed manner. Their efficiency can be measured by the number of iterations needed to converge to the average sensed value. In this paper, we consider two point-to-point and one point-to-multipoint distributed averaging algorithms that can be seen as variants of the same averaging solution. We define a set of analytical tools to evaluate the performance of these algorithms and to optimize their parameters in such a way to accelerate convergence. We also provide a performance assessment, based on numerical simulations, aimed at verifying the results of the analytical treatment and at comparing the considered schemes.
    International Journal of Distributed Sensor Networks 01/2011; 2011:-. DOI:10.1155/2011/428290 · 0.92 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.
    Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2009 3rd IEEE International Workshop on; 01/2010

Full-text (2 Sources)

Available from
May 29, 2014