Abstract
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.
This research was supported by the Intel Collaborative Research Institute for Computational Intelligence (ICRI-CI), the Israeli Ministry of Trade and Labor Rescue Consortium, the Sidney Goldstein Research Fund, the Israeli Science Foundation, the Arlene & Arnold Goldstein Center at the Technion Autonomous Systems Program, a Technion Fellowship, two Andrew and Erna Finci Viterbi fellowships, the Lady Davis Fellowship Trust, and the Hasso-Plattner Institute for Software Systems Engineering.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chong, C., Kumar, S.: Sensor networks: Evolution, opportunities, and challenges. Proceedings of the IEEE 91(8), 1247–1256 (2003)
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)
Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm. Theoretical Computer Science 410(6-7), 514–532 (2009)
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)
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)
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)
Tsitsiklis, J., Bertsekas, D., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Transactions on Automatic Control 31(9), 803–812 (1986)
Nedic, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Transactions on Automatic Control 54(1), 48–61 (2009)
Srivastava, K., Nedic, A.: Distributed asynchronous constrained stochastic optimization. IEEE Journal of Selected Topics in Signal Processing 5(4), 772–790 (2011)
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)
Nedic, A., Ozdaglar, A., Parrilo, P.: Constrained consensus and optimization in multi-agent networks. IEEE Transactions on Automatic Control 55(4), 922–938 (2010)
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)
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)
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)
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)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)
Luenberger, D.G.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley Publishing Company, Inc. (1984)
Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific (1999)
Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of Optimization Theory and Applications 109(3), 475–494 (2001)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eyal, I., Keidar, I., Patterson, S., Rom, R. (2013). In-Network Analytics for Ubiquitous Sensing. In: Afek, Y. (eds) Distributed Computing. DISC 2013. Lecture Notes in Computer Science, vol 8205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41527-2_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-41527-2_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41526-5
Online ISBN: 978-3-642-41527-2
eBook Packages: Computer ScienceComputer Science (R0)