Abstract
With the ever increasing scale of dynamic wireless networks (such as MANETs, WSNs, VANETs, etc.), there is a growing need for performing aggregate computations, such as online detection of network churn, via distributed, robust and scalable algorithms. In this paper we introduce the ChurnDetect algorithm, a novel solution to the distributed churn estimation problem. Our solution consists in a gossiping-based algorithm, which incorporates a periodic reset mechanism (introduced as DiffusionReset). The main difference with existing state-of-the-art is that ChurnDetect does not require nodes to advertise their departure from the network nor to detect neighbors leaving the network. In our solution, all the nodes are interacting with each other wirelessly, by using a gossip-alike approach, thus keeping the message complexity to a minimum. We only use easy accessible information (i.e., about new nodes joining the network) rather than presuming knowledge on nodes leaving the system since that is highly unfeasible for most distributed applications. We provide convergence proofs for ChurnDetect, and present a number of results based on simulations and implementation on our local testbed. We characterize the performance of the algorithm, showcasing its distributed light-weight characteristics. The analysis leads to the conclusion that ChurnDetect is an attractive alternative to existing work on online churn estimation for dynamic wireless networks.
Chapter PDF
References
Abelson, H., Allen, D., Coore, D., Hanson, C., Homsy, G., Knight Jr. T.F., Nagpal, R., Rauch, E., Sussman, G.J., Weiss, R.: Amorphous computing. Commun. ACM 43(5), 74–82 (2000)
Bettstetter, C.: International workshop on modeling analysis and simulation of wireless and mobile systems. In: MSWIM 2001, pp. 19–27 (2001)
Beutel, J., Römer, K., Ringwald, M., Woehrle, M.: Deployment techniques for sensor networks. In: Ferrari, G. (ed.) Sensor Networks. Signals and Communication Technology, pp. 219–248. Springer, Heidelberg (2009)
Binzenhöfer, A., Leibnitz, K.: Estimating churn in structured p2p networks. Managing Traffic Performance in Converged Networks, 630–641 (2007)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE/ACM Trans. Netw. 14(SI), 2508–2530 (2006)
Dimakis, A.D.G., Sarwate, A.D., Wainwright, M.J.: Geographic gossip: Efficient averaging for sensor networks. IEEE Transactions on Signal Processing 56(3), 1205–1216 (2008)
Dimakis, A.G., Sarwate, A.D., Wainwright, M.J.: Geographic gossip: efficient aggregation for sensor networks. In: Proceedings of IPSN 2006, pp. 69–76. ACM, New York (2006)
Friedman, R., Gavidia, D., Rodrigues, L., Viana, A.C., Voulgaris, S.: Gossiping on MANETs: the Beauty and the Beast. ACM SIGOPS Operating Systems Review 41(5), 67–74 (2007)
Giuffrida, C., Ortolani, S.: A Gossip-based Churn Estimator for Large Dynamic Networks. In: Proceedings of ASCI 2010 (2010)
Brighten Godfrey, P., Shenker, S., Stoica, I.: Minimizing churn in distributed systems. SIGCOMM Comput. Commun. Rev. 36, 147–158 (2006)
Goldstein, S.C., Campbell, J.D., Mowry, T.C.: Programmable matter. IEEE Computer 38(6), 99–101 (2005)
Gramoli, V., Kermarrec, A.M., Le Merrer, E.: Distributed churn measurement in arbitrary networks. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, p. 431. ACM, New York (2008)
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319–349 (1988)
Iwanicki, K., Van Steen, M.: On hierarchical routing in wireless sensor networks. In: Proceedings of IPSN 2009, pp. 133–144. IEEE, Los Alamitos (2009)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. on Computer Systems 23(3), 219–252 (2005)
Karpelson, M., Wei, G.-Y., Wood, R.J.: Milligram-scale high-voltage power electronics for piezoelectric microrobots. In: ICRA 2009 (2009)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: FOCS 2003 (2003)
Qadri, N.N., Alhaisoni, M., Liotta, A.: Mesh based P2P streaming over MANETs. In: Proceedings of MOMM 2008, pp. 29–34. ACM, New York (2008)
Sarwate, A.D., Dimakis, A.G.: The impact of mobility on gossip algorithms. In: INFOCOM 2009, pp. 2088–2096. IEEE, Los Alamitos (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pruteanu, A., Iyer, V., Dulman, S. (2011). ChurnDetect: A Gossip-Based Churn Estimator for Large-Scale Dynamic Networks. In: Jeannot, E., Namyst, R., Roman, J. (eds) Euro-Par 2011 Parallel Processing. Euro-Par 2011. Lecture Notes in Computer Science, vol 6853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23397-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-23397-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23396-8
Online ISBN: 978-3-642-23397-5
eBook Packages: Computer ScienceComputer Science (R0)