In-Network Analytics for Ubiquitous Sensing
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.
Unable to display preview. Download preview PDF.
- 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.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.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
- 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
- 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.Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)Google Scholar
- 17.Luenberger, D.G.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley Publishing Company, Inc. (1984)Google Scholar
- 18.Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific (1999)Google Scholar