Probabilistic broadcast for flooding in wireless mobile ad hoc networks
By Yoav Sasson, David Cavin, André Schiper. 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003., 2003
566 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/597cb4e300e581b8fd675378c76efee1ecac0d76
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Jeffrey G. Andrews
- Martin Haenggi
- Mirco Musolesi
- Cecilia Mascolo
- François Baccelli
- Massimo Franceschetti
- Olivier Dousse
- Tony Q. S. Quek
In Electrical and Electronic Engineering
- Jeffrey G. Andrews
- Martin Haenggi
- François Baccelli
- Tony Q. S. Quek
- Ekram Hossain
- Hesham Elsawy
- Erran L. Li
- Joseph Y. Halpern
Citations in the corpus
- AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks (2005, unknown): “algorithms, for example to improve flooding [39]).”
- Network coding for efficient communication in extreme networks (2005, unknown): “In [20], the properties of such algorithms were analyzed in the context of percolation theory.”
- Adaptive routing for intermittently connected mobile ad hoc networks (2005, background): “[23] studied a possible application of percolation theory (that studies the probability of transition between two states in fluids) to improve information dissemination based on the flooding of messages in ad hoc settings.”
- Stochastic geometry and random graphs for the analysis and design of wireless networks (2009, background): “studied in [85], and an extension to a model with collisions can be found in [ 86 ].”
- Gossip-based ad hoc routing (2002, background): “• Sasson et al. [ 27 ] study the phase-transition phenomenon in a small 802.11 ad hoc network setting.”