Irrigating ad hoc networks in constant time

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 106-115

  Dubhashi, D ^a   Johansson, C ^a   Haggstrom O ^a   Panconesi, A ^b   Sozio, M ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Ad Hoc Networks; Distributed Algorithms; Overlay Networks; Randomized Protocols; Wireless Net works

Indexed keywords

BROADCASTING; GRAPH THEORY; PROBABILITY;

AD HOC NETWORKS; DISTRIBUTED ALGORITHMS; WIRELESS NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 32144462287     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073986     Document Type: Conference Paper

References (32)

1. S. Asmussen and H. Hering, Branching Processes, Birkhäuser, Boston, 1983.
2. Y.Azar, A.Z.Broder, A.R.Karlin and E.Upfal, Balanced allocations. SIAM Journal on Computing, Volume 29, Number 1, pp. 180-200, 1999
3. G. Badishi, I. Keidar and R. Melamed, Towards Survivability of Application-Level Multicast, Proceedings of S.O.S. Survivability: Obstacles and Solutions 2nd Bertinoro Workshop on Future Directions in Distributed Computing, http://www.cs.utexas.edu/users/lorenzo/sos
4. G. Badishi, I. Keidar, and A. Sasson. Exposing and elim- inating vulnerabilities to denial of service attacks in secure gossip-based multicast. In The International Conference on Dependable Systems and Networks (DSN), 2004. To appear.
5. S.Basagni, R.Bruno and C.Petrioli. A Performance Comparison of Scatternet Formation Protocols for Networks of Bluetooth Devices, Proceedings of the IEEE International Conference on Pervasive Computing and Communications, PerCom 2003, 341-350.
6. D. Dubhashi, O.Häggström, G. Mambrini, A. Panconesi and C. Petrioli, Blue Pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks, accepted for publication in ACM Wireless Networks.
7. I. Gupta, K.P. Birman, and R. van Renesse, Fighting fire with fire: using randomized gossip to combat stochastic scalability limits, Quality and reliability Engineering International, 18, 2002.
8. Z. J. Hass, J.Y. halpern and L. Li, Gossip-Based Ad Hoc Routing IEEE Infocom, June 2002.
9. S. Basagni, I. Chlamtac, V.R. Syrotiuk and B.A. Woodward, A distance routing effect algorithm for mobility (DREAM) CM/IEEE Intl. Conference on Mobile Computing and Networking (MobiCom), 1998.
10. K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu and Y. Minsky, Bimodal multicast, ACM Transactions on Computer systems, 17(2), 1999.
11. P T. Eugster, R. Guerraoui, A-M Kermarrec and L. Massoulié, Epidemic Information Dissemination in Distributed Systems, IEEE Computer, May 2004.
12. P T. Eugster, R. Guerraoui, S.B. Handurukande and A-M Kermarrec Lightweight Probabilistic Broadcast, ACM Transactions on Computer Systems, 21:4, Nov. 2003.
13. A-M Kermarrec, L. Massoulié and A.J. Ganesh, Probabilistic Reliable Dissemination in large-Scale Systems, IEEE Transactions on Parallel and Distributed Systems, 14:3, March 2003.
14. T.E. Harris, The Theory of Branching Processes, Springer, Berlin, 1963.
15. T. Lindvall, Lectures on the Coupling Method, Wiley, New York, 1992.
16. R. Meester and R. Roy, Continuum Percolation, Cambridge University Press, 1996.
17. M. Mitzenmacher, A. Richa, and R. Sitaraman. The Power of Two Random Choices: A Survey of Techniques and Results Book chapter, in Handbook of Randomized Computing: volume 1, edited by P. Pardalos, S. Rajasekaran, and J. Rolim, pp. 255-312.
18. L. Orecchia, A. Panconesi, C. Petrioli and A. Vitaletti. Localized techniques for broadcasting in wireless sensor networks. Proceedings of ACM Dial-M POMC 2004, the Joint Workshop on Foundations of Mobile Computing.
19. A. Panconesi and J. Radhakrishnan. Expansion properties of (secure) wireless networks, Proceedings of SPAA 2004, Barcelona, Spain.
20. C.Petrioli, S.Basagni and I.Chlamtac. BlueMesh: Degree- Constrained Multihop Scatternet Formation for Bluetooth Networks, ACM/Kluwer Journal on Special Topics in Mobile Networking and Applications (MONET), Special Issue on Advances in Research of Wireless Personal Area Networking and Bluetooth Enabled Networks (G. Zaruba and P. Johansson, eds.), 2003
21. G.H. Hardy, J.E. Littlewood and G. Polya, Inequalities Cambridge U. Press, London, 1952.
22. A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, Academic Press, NY. 1979.
23. S. Y. NI, Y. C. TSENG, Y. S CHEN, AND J. P. SHEU. The broadcast storm problem in a mobile ad hoc network. In Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking (MobiCOM '99) (Seattle, Washington, August 15-20 1999), pp. 151-162.
24. W. PENG, AND X. LU. On the reduction of broadcast redundancy in mobile ad hoc networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2000) (Boston, Massachusetts, August 11, 2000), pp. 129-130.
25. B. WILLIAMS, AND T. CAMP. Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2002) (Lausanne, Switzerland, June 9-11, 2002), pp. 194-205.
26. Y. YI, M. GERLA, AND T. J. KWON. Efficient flooding in ad hoc networks: a comparative performance study. In Proceedings of the IEEE International Conference on Communications (ICC 2003) (Anchorage, Alaska, May 11-15 2003).
27. Z. Hass and M. Pearlman, The performance of query control schemes for the zone routing protocol,in Proceedings ACM SIGCOMM, Aug. 1998.
28. Y.B. Ko and N.H. Vaidya, Location-aided Routing (LAR) in mobile ad-hoc networks, ACM/IEEE Intl. Conference on Mobile Computing and Networking (MobiCom), 1998.
29. A. Marcucci, M. Nati, C. Petrioli and A. Vitaletti, Directed Diffusion Light: Low Overhead Data Dissemination, in Wireless Sensor Networks, an IEEE Vehicular Technology Conference (IEEE VTC 2005), Stoccolma May 2005.
30. V. Paruchuri, A. Durresi and R. jain, Optimal Flooding Protocol for Routing in Ad-hoc Networks, submitted to Computer Networks.
31. C.E. Perkins, and E.M. Roper, Ad hoc on demand distance vector routing in IEEE Workshop on Mobile Systems and Applications, Feb. 1999.
32. W. Vogels, R. van Renesse and K. Birman, The power of epidemics: robust communication for large-scale distributed systems ACM SIGCOMM Computer Communication Review archive Volume 33, Issue 1 (January 2003)