RaWMS - Random walk based lightweight membership service for wireless ad hoc networks

ACM Transactions on Computer Systems

Volumn 26, Issue 2, 2008, Pages

  Bar Yossef, Ziv ^a,b   Friedman, Roy ^a   Kliot, Gabriel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b GOOGLE INC   (United States)

Author keywords

Ad hoc networks; Membership service; Random walk

Indexed keywords

DATA DISSEMINATION ALGORITHMS; FORMAL ANALYSIS; HOC NETWORKS; NETWORK NODES; RANDOM WALK (RW); SAMPLING TECHNIQUES; SIMULATION STUDIES; WIRELESS AD HOC NETWORKS;

RANDOM PROCESSES; SAMPLING; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 47749148120     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/1365815.1365817     Document Type: Article

References (53)

1. ALLAVENA, A., DEMERS, A., AND HOPCROFT, J. E. 2005. Correctness of a gossip based membership protocol. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 292-301.
2. AVIN, C. AND ERCAL, G. 2005. Bounds on the mixing time and partial cover of ad-hoc and sensor networks. In Proceedings of the 2nd European Workshop on Wireless Sensor Networks (EWSN).
3. BAR-YOSSEF, Z., BERG, A., CHIEN, S., FAKCHAROENPHOL, J., AND WEITZ, D. 2000. Approximating aggregate queries about Web pages via random walks. In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB). ACM, New York, 535-544.
4. BARR, R., HAAS, Z. J., AND VAN RENESSE, R. JiST/SWANS Java in simulation time/ scalable wireless ad hoc network simulator. Available at http://jist.ece.cornell.edu/, Cornell University.
5. BIRMAN, K. P., HAYDEN, M., Ozkasap, O., XIAO, Z., BUDIU, M., AND MINSKY, Y. 1999. Bimodal multicast. ACM Trans. Comput. Syst. 17, 2, 41-88.
6. BOLLOBAS, B. 2001. Random Graphs, 2nd ed. Cambridge University Press, Cambridge, MA.
7. BOYD, S., DIACONIS, P., and XIAO, L. 2004. Fastest mixing Markov chain on a graph. SIAM Rev. 46, 4, 667-689.
8. BOYD, S., GHOSH, A., PRABHAKAR, B., AND SHAH, D. 2005. Mixing times for random walks on geometric random graphs. In Proceedings of the 2nd SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM, Philadelphia, PA.
9. CHANDRA, R., RAMASUBRAMANIAN, V., AND BIRMAN, K. 2001. Anonymous gossip: Improving multicast reliability in mobile ad-hoc networks. In Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS). 275.
10. CHAUM, D. L. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 2, 84-90.
11. CHERNOFF, H. 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. American Mathematical Society 23, 493-507.
12. CHOCKLER, G., KEIDAR, I., AND VITENBERG, R. 2001. Group communication specifications: a comprehensive study. ACM Comput. Surv. 33, 4, 427-469.
13. DIACONIS, P. AND STROOCK, D. 1991. Geometric bounds for eigenvalues of Markov chains. ANN. APPL. PROBAB. 1, 36-61.
14. DOLEV, S., SCHILLER, E., AND WELCH, J. 2002. Random walk for self-stabilizing group communication in ad hoc networks. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC). ACM, New York, 259-259.
15. ERDÖS, P. AND RENYI, A. 1960. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5, 17-61.
16. EUGSTER, P. T., GUERRAOUI, R., HANDURUKANDE, S. B., KOUZNETSOV, P., AND KERMARREC, A.-M. 2003. Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. (TOCS) 21, 4, 341-374.
17. FEIGE, U. 1996. A fast randomized LOGSPACE algorithm for graph connectivity. Theoret. Comput. Sci. 169, 2, 147-160.
18. FENNER, T. I. AND FRIEZE, A. M. 1982. On the connectivity of random m-orientable graphs and digraphs. Combinatorica 2, 347-359.
19. FERRO, E. AND POTORTI, F. 2005. Bluetooth and wi-fi wireless protocols: A survey and a comparison. IEEE Wireless Communications 12, 12 - 26.
20. FREEDMAN, M. J. AND MORRIS, R. 2002. Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of the 9th ACM Cconference on Computer and Communications Security (CCS). ACM, New York, 193-206.
21. GANESH, A. J., KERMARREC, A.-M., AND MASSOULIE, L. 2001. SCAMP: Peer-to-peer lightweight membership service for large-scale group communication. In Networked Group Communication. 44-55.
22. GAVIDIA, D., VOULGARIS, S., AND VAN STEEN, M. 2005. Epidemic-style monitoring in large-scale sensor networks. Tech. Rep. IR-CS-012, Vrije Universiteit, Amsterdam, Netherlands. March.
23. GKANTSIDIS, C., MIHAIL, M., AND SABERI, A. 2004. Random walks in peer-to-peer networks. In Proceedings of the 23rd Conference of the IEEE Communications Society (INFOCOM). IEEE Computer Society Press, Los Alamitos, CA, 259-259.
24. GUPTA, P. AND KUMAR, P. 1998. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications. 547-566.
25. GURUSWAMI, V. 2000. Rapidly mixing Markov chains: A comparison of techniques. Available at http://www.cs.washington.edu/homes/venkat/pubs/pubs. html.
26. HAAS, Z., HALPERN, J., AND LI, L. 2002. Gossip-based ad hoc routing. In Proceedings of the 21st Conference of the IEEE Communications Society (INFOCOM). IEEE Computer Society Press, Los Alamitos, CA, 1707-1716.
27. HAAS, Z. AND LIANG, B. 1999. Ad hoc mobility management with randomized database groups. In Proceedings of IEEE International Conference on Communications (ICC). IEEE Computer Society Press, Los Alamitos, CA, vol. 3. 1756 - 1762.
28. HORN, R. AND JOHNSON, C. 1985. Matrix Analysis. Cambridge University Press.
29. IEEE-802.11-STANDARD. Wireless LAN Media Access Control (MAC) and Physical Layer (PHY) Specifications. Downloadable at http://standards.ieee. org/getieee802/.
30. JELASITY, M. AND BABAOGLU, O. 2005. T-Man: Gossip-based overlay topology management. In Proceedings of the 3rd International Workshop on Engineering Self-Organising Systems (ESOA).
31. JELASITY, M. AND VAN STEEN, M. 2002. Large-scale newscast computing on the internet. Tech. Rep. IR-503, Vrije Universiteit, Amsterdam, Netherlands. October.
32. JELASITY, M., VOULGARIS, S., GUERRAOUI, R., KERMARREC, A.-M., AND VAN STEEN, M. 2007. Gossip-based peer sampling. ACM Trans. Comput. Syst. 25, 3, 8.
33. JOHNSON, D. AND MALTZ, D. 1996. Dynamic source routing in ad hoc wireless networks. Mobile Comput. 353.
34. KERMARREC, A.-M., MASSOULIE, L., AND GANESH, A. J. 2003. Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parall. Distrib. Syst. 14, 3 (Mar.), 248-258.
35. KLEINBERG, J. 2000. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC). ACM, New York, 163-170.
36. LOVÁSZ, L. 1993. Random walks on graphs: A survey. Combinatorics 2, 1-46.
37. LUO, J., EUGSTER, P., AND HUBAUX, J.-P. 2003. Route driven gossip: Probabilistic reliable multicast in ad hoc networks. In Proceedings of the 23rd Conference of the IEEE Communications Society (INFOCOM). IEEE Computer Society Press, Los Alamitos, CA.
38. LV, C., CAO, P., COHEN, E., LI, K., AND SHENKER, S. 2002. Search and Replication in Unstructured Peer-to-Peer Networks. In Proceedings of the 16th International Conference on Supercomputing (ICS). 84-95.
39. MANKU, G., BAWA, M., AND RAGHAVAN, P. 2003. Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS).
40. MASSOULIE, L., MERRER, E. L., KERMARREC, A.-M., AND GANESH, A. J. 2006. Peer counting and sampling in overlay networks: Random walk methods. In PROCEEDINGS OF THE 25TH ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC). ACM, New York, 123-132.
41. MELAMED, R. AND KEIDAR, I. 2004. Araneola: A scalable reliable multicast system for dynamic environments. In 3rd IEEE International Symposium on Network Computing and Applications, (IEEE NCA). 5-14.
42. MERRER, E. L., KERMARREC, A.-M., AND MASSOULIE, L. 2006. Peer to peer size estimation in large and dynamic networks: A comparative study. In Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing (HPDC). IEEE Computer Society Press, Los Alamitos, CA, 7-17.
43. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, MA.
44. PANCHAPAKESAN, P. AND MANJUNATH, D. 2001. On the transmission range in dense ad hoc radio networks. In Proceedings of IEEE Signal Processing Communication (SPCOM). IEEE Computer Society Press, Los Alamitos, CA,
45. PENROSE, M. D. 2003. Random Geometric Graphs. Oxford University Press.
46. PUCHA, H., DAS, S., AND HU, Y. C. 2004. Ekta: An efficient DHT substrate for distributed applications in mobile ad hoc networks. In Proceedings of the 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA). IEEE Computer Society Press, Los Alamitos, CA, 163-173.
47. REITER, M. K. AND RUBIN, A. D. 1999. Anonymous Web transactions with crowds. Commun. ACM 42, 2, 32-48.
48. SERVETTO, S. AND BARRENECHEA, G. 2002. Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA). ACM, New York.
49. SIEGMUND, D. 1985. Sequential Analysis - Tests and Confidence Intervals. Springer-Verlag, New York.
50. SINCLAIR, A. 1992. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin. Probab. Comput. 1, 351-370.
51. SONDOW, J. AND WEISSTEIN, E. W. Harmonic number. From MathWorld-A Wolfram Web resource. http://mathworld.wolfram.com/ HarmonicNumber.html.
52. VOULGARIS, S., GAVIDIA, D., AND VAN STEEN, M. 2005. CYCLON: Inexpensive membership management for unstructured P2P overlays. J. Netw. Syst. Manage. 13, 2 (July), 197-217.
53. WATTS, D. J. AND STROGATZ, S. H. 1998. Collective dynamics of small-world networks. Nature 393, 4 (June), 440-442.