In-Network Analytics for Ubiquitous Sensing

  • Ittay Eyal
  • Idit Keidar
  • Stacy Patterson
  • Raphi Rom
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8205)


We address the problem of in-network analytics for data that is generated by sensors at the edge of the network. Specifically, we consider the problem of summarizing a continuous physical phenomenon, such as temperature or pollution, over a geographic region like a road network. Samples are collected by sensors placed alongside roads as well as in cars driving along them. We divide the region into sectors and find a summary for each sector, so that their union is a continuous function that minimizes some global error function. We designate a node (either virtual or physical) that is responsible for estimating the function in each sector. Each node computes its estimate based on the samples taken in its sector and information from adjacent nodes.

The algorithm works in networks with bounded, yet unknown, latencies. It accommodates the addition and removal of samples and the arrival and departure of nodes, and it converges to a globally optimal solution using only pairwise message exchanges between neighbors. The algorithm relies on a weakly-fair scheduler to implement these pairwise exchanges, and we present an implementation of such a scheduler. Our scheduler, which may be of independent interest, is locally quiescent, meaning that it only sends messages when required by the algorithm. It achieves quiescence on every link where the algorithm ceases to schedule pairwise exchanges; in particular, if the algorithm converges, it globally quiesces.


Road Network Dual Problem Shared Variable Convex Optimization Problem Virtual Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chong, C., Kumar, S.: Sensor networks: Evolution, opportunities, and challenges. Proceedings of the IEEE 91(8), 1247–1256 (2003)CrossRefGoogle Scholar
  2. 2.
    Gilbert, S., Lynch, N., Mitra, S., Nolte, T.: Self-stabilizing mobile robot formations with virtual nodes. In: Kulkarni, S., Schiper, A. (eds.) SSS 2008. LNCS, vol. 5340, pp. 188–202. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm. Theoretical Computer Science 410(6-7), 514–532 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Fernandess, Y., Malkhi, D.: K-clustering in wireless ad hoc networks. In: Proceedings of the Second ACM International Workshop on Principles of Mobile Computing, pp. 31–37. ACM (2002)Google Scholar
  5. 5.
    Lee, D.Y., Lam, S.S.: Efficient and accurate protocols for distributed Delaunay triangulation under churn. In: IEEE International Conference on Network Protocols, pp. 124–136 (2008)Google Scholar
  6. 6.
    Eyal, I., Keidar, I., Patterson, S., Rom, R.: Global estimation with local communication. Technical Report CCIT 809, EE Pub. No. 1766, Technion, Israel Institute of Technology (May 2012)Google Scholar
  7. 7.
    Tsitsiklis, J., Bertsekas, D., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Transactions on Automatic Control 31(9), 803–812 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Nedic, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Transactions on Automatic Control 54(1), 48–61 (2009)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Srivastava, K., Nedic, A.: Distributed asynchronous constrained stochastic optimization. IEEE Journal of Selected Topics in Signal Processing 5(4), 772–790 (2011)CrossRefGoogle Scholar
  10. 10.
    Ram, S., Nedic, A., Veeravalli, V.: A new class of distributed optimization algorithms: Application to regression of distributed data. Optimization Methods and Software 27(1), 71–88 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Nedic, A., Ozdaglar, A., Parrilo, P.: Constrained consensus and optimization in multi-agent networks. IEEE Transactions on Automatic Control 55(4), 922–938 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Johansson, B., Rabi, M., Johansson, M.: A randomized incremental subgradient method for distributed optimization in networked systems. SIAM Journal on Optimization 20(3), 1157–1170 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Ram, S., Nedic, A., Veeravalli, V.: Asynchronous gossip algorithms for stochastic optimization. In: Proceedings of the 48th IEEE Conference on Decision and Control, pp. 3581–3586 (2009)Google Scholar
  14. 14.
    Elad, M., Matalon, B., Zibulevsky, M.: Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization. Applied and Computational Harmonic Analysis 23, 346–367 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Bradley, J.K., Kyrola, A., Bickson, D., Guestrin, C.: Parallel coordinate descent for l1-regularized loss minimization. In: Proceedings of the 28th International Conference on Machine Learning, pp. 321–328 (2011)Google Scholar
  16. 16.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)Google Scholar
  17. 17.
    Luenberger, D.G.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley Publishing Company, Inc. (1984)Google Scholar
  18. 18.
    Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific (1999)Google Scholar
  19. 19.
    Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of Optimization Theory and Applications 109(3), 475–494 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Tzeng, C., Jiang, J., Huang, S.: A self-stabilizing (δ+ 4)-edge-coloring algorithm for planar graphs in anonymous uniform systems. Information Processing Letters 101(4), 168–173 (2007)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ittay Eyal
    • 1
  • Idit Keidar
    • 2
  • Stacy Patterson
    • 2
  • Raphi Rom
    • 2
  1. 1.Department of Computer ScienceCornellUSA
  2. 2.Department of Electrical EngineeringTechnionIsrael

Personalised recommendations