Analysis of probabilistic flooding: How do we choose the right coin?

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Crisóstomo, Sérgio ^a,b,d   Schilcher, Udo ^b   Bettstetter, Christian ^b,c   Barros, João ^a,d  

^a UNIVERSITY OF PORTO   (Portugal)

^b UNIVERSITY OF KLAGENFURT   (Austria)

^c Lakeside Labs GmbH   (Austria)

^d INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

Author keywords

Analytical model; Graph theory; Network theory; Probabilistic flooding; Random networks

Indexed keywords

ANALYTICAL MODEL; GENERIC APPROACH; HIGH PROBABILITY; LOWER BOUNDS; NEIGHBORING NODES; NETWORK THEORY; PARAMETER VECTORS; PROBABILISTIC FLOODING; PROBABILISTIC INFORMATION; RANDOM GRAPHS; RANDOM NETWORK; RANDOM NETWORKS; SIMULATION RESULT; SYSTEM DESIGN;

CIRCUIT THEORY; CONTROL THEORY; INFORMATION DISSEMINATION; PROBABILITY; SIMULATORS;

GRAPH THEORY;

EID: 70449485841     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5198745     Document Type: Conference Paper

References (12)

1. M. Čagalj, J.-P. Hubaux, and C. Enz. Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In Proc. ACM MobiCom, Atlanta, GA, USA, September 2002.
2. K. Alzoubi, P.-J. Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. In Proc. HICSS, Big Island, HI, USA, January 2002.
3. W. Lou and J. Wu. On reducing broadcast redundancy in ad hoc wireless networks. IEEE Trans. Mobile Comput., 1(2):111-123, 2002.
4. L. Viennot A. Qayyum and A. Laouiti. Multipoint relaying for flooding broadcast messages in mobile wireless networks. In Proc. HICSS, Big Island, HI, USA, January 2002.
5. Y. Sasson, D. Cavin, and A. Schiper. Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In Proc. IEEE Wireless Comm. and Netw. Conf. (WCNC), New Orleans, LA, USA, March 2003.
6. Z. Haas, J. Halpern, and L. Li. Gossip-based ad hoc routing. IEEE/ACM Trans. Netw., 14(3):479-491, 2006.
7. A. O. Stauffer and C. V. Barbosa. Probabilistic heuristics for disseminating information in networks. IEEE/ACM Trans. Netw., 15(2):425-435, 2007.
8. B. Krishnamachari, S. B. Wicker, and R. Bejar. Phase transition phenomena in wireless ad hoc networks. In Proc. IEEE GLOBECOM, November 2001.
9. S.-Y. Ni, Y.-C. Tseng, Y.-S. C., and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In Proc. ACM/IEEE MobiCom, New York, NY, USA, August 1999.
10. B. Bollobás. Modern Graph Theory. Springer, July 1998.
11. A. A. Hagberg, D. A. Schult, and P. J. Swart. Exploring network structure, dynamics, and function using networkx. In Proc. Python in Science Conf., Pasadena, CA, USA, August 2008.
12. P. Erdocombining double acute accents and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, 5:17-61, 1960.