Abstract
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is no designated fusion center; instead sensors exchange messages on the associated communication graph to obtain a global estimate. We propose an asynchronous distributed algorithm based on local fusion between neighboring sensors. The algorithm differs from other related schemes such as gossip algorithms in that after each local fusion one of the associated sensors ceases its activity until it is re-activated by reception of messages from a neighboring sensor. This leads to substantial gains in energy expenditure over existing local ad-hoc messaging algorithms such as gossip and belief propagation algorithms. Our results are general and we focus on some explicit graphs, namely geometric random graphs, which have been successfully used to model wireless networks, and d-dimensional lattice torus with n nodes, which behave exactly like mesh networks as n gets large. We quantify the time, message and energy scaling of the algorithm, where the analysis is built upon the coalescing random walks. In particular, for the planar torus the completion time of the algorithm is Θ(n log n) and energy requirement per sensor node is O((log n)2) and for 3-d torus these quantities are Θ(n) and O(log n) respectively. The energy requirement of the algorithm is thus scalable, and interestingly there appears little practical incentive to consider higher dimensions. Furthermore, for the planar torus the algorithm exhibits a very favorable tradeoff relative to gossip algorithms whose time and energy requirements are shown here to be Ω(n). Also, the proposed algorithm can be generalized to robustify against packet losses and permanent node failures without entailing significant energy overhead. The paper concludes with numerical results.
This research was supported by Presidential Early Career Award N00014-02-100362, NSF CAREER Programs ANI-0238397, ECS-0449194 and NSF programs CCF-0430983, and CNS-0435353.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Savas, O., Alanyali, M., Saligrama, V.: Randomized Sequential Algorithms for Data Aggregation in Sensor Networks, CISS, Princeton (2006)
Alanyali, M., Saligrama, V., Savas, O., Aeron, S.: Distributed bayesian hypothesis testing in sensor networks. In: American Control Conference, Boston, MA (July 2004)
Saligrama, V., Alanyali, M., Savas, O.: Distributed detection in sensor networks with packet losses and finite capacity links. IEEE Transactions on Signal Processing (to appear, 2005)
Alanyali, M., Saligrama, V.: Distributed target tracking on multi-hop networks. In: IEEE Statistical Signal Processing Workshop, Bordeaux, France (July 2005)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: Proceedings of IEEE INFOCOM 2005 (2005)
F.R.K. ChungSpectral Graph Theory. American Mathematical Society (1997)
Bertsekas, D., Gallager, R.: Data Networks. Pearson Education (1991)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs (1989)
Chamberland, J.F., Veeravalli, V.V.: Decentralized detection in sensor networks. IEEE Transactions on Signal Processing (2003)
Cox, J.T.: Coalescing random walks and voter model consensus times on the torus in ℤd. The Annals of Probability 17(4), 1333–1366 (1989)
Giridhar, A., Kumar, P.R.: Computing and communicating functions over sensor networks. In: IEEE JSAC Special Issue on Self-Organizing Distributed Collaborative Sensor Networks, p. 23 (2005)
Hero, A.O., Blatt, D.: Sensor network source localization via projection onto convex sets(pocs). In: IEEE International Conference on Acoustics, Speech, and Signal Processing, Philadelphia, PA (March 2005)
Olfati-Saber, R., Murray, R.M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions On Automatic Control 49, 1520–1533 (2004)
Rabbat, M.G., Nowak, R.D.: Distributed optimization in sensor networks. In: Third International Symposium on Information Processing in Sensor Networks, Berkeley, CA (April 2004)
Scherber, D.S., Papadopoulos, H.C.: Distributed computation of averages over ad hoc networks. IEEE Journal on Selected Areas in Communications 23(4) (2005)
Tavaré, S.: Line-of-descent and genealogical processes, and their applications in population genetics models. Theoret. Population Biol. 26, 119–164 (1984)
Tsitsiklis, J.N.: Decentralized detection. In: Poor, H.V., Thomas, J.B. (eds.) Advances in Statistical Signal Processing, vol. 2 (1993)
Gupta, P., Kumar, P.: The capacity of wireless networks. IEEE Trans. on Information Theory 46(2), 388–404 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Savas, O., Alanyali, M., Saligrama, V. (2006). Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds) Distributed Computing in Sensor Systems. DCOSS 2006. Lecture Notes in Computer Science, vol 4026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776178_16
Download citation
DOI: https://doi.org/10.1007/11776178_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35227-3
Online ISBN: 978-3-540-35228-0
eBook Packages: Computer ScienceComputer Science (R0)