Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks

By A. Qayyum, L. Viennot, Anis Laouiti. 2000

626 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/3de00ab5334911356ddf861ee1ca243e97a17143

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Broadcasting in VANET (2007, methodology): “Below, we give a brief overview of these regimes based on our previous work in this area [1, 2].”
The Optimized Link State Routing Protocol: Evaluation through Experiments and Simulation (2001, background): “In OLSR, the problem of duplicate transmissions of a message within a region is addressed through the notion of multipoint relays (MPRs)[5].”
Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, background): “The work in wireless network research community [9, 18 , 26, 1, 7] has primarily focussed on developing energy-efficient distributed algorithms to construct a nearoptimal dominating connected set.”
Packet leashes: a defense against wormhole attacks in wireless networks (2003, background): “The neighbor discovery mechanisms of periodic (proactive ) routing protocols such as DSDV [30], OLSR [36], and TBRPF [5] rely heavily on the reception of broadcast packets as a means for neighbor detection, and are also extremely vulnerable to this attack.”
Wormhole attacks in wireless networks (2006, background): “…of periodic (proactive) routing protocols such as dynamic destination-sequenced distance-vector (DSDV) [26], optimized link-state routing (OLSR) [33], and topology broadcast based on reverse path forwarding (TBRPF) [5] rely heavily on the reception of broadcast packets as a means for neighbor…”
Scalable routing protocols for mobile ad hoc networks (2002, background): “Multi-Point Relays (MPRs) [14] to reduce the number of ”superfluous” broadcast packet retransmissions and also to reduce”
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks (2001, background): “Recently, several localized efficient broadcasting (which is, in this context, equivalent to flooding) algorithms were proposed [23], [24], [35].”
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks (2002, background): “Unlike periodic protocols (e.g., [4,45, 52 ]), which exchange routing information between nodes periodically in an attempt to always maintain routes to all destinations, on-demand protocols exchange routing information only when a new route is needed to deliver a packet to some destination.”
Comparison of broadcasting techniques for mobile ad hoc networks (2002, methodology): “Multipoint Relaying: Multipoint Relaying [15] is similar to Dominant Pruning in that rebroadcasting nodes are explicitly chosen by upstream senders.”
Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy (2004, methodology): “If message is reasonably ‘short’, it can be broadcasted (that is, flooded), using an optimal broadcasting scheme [PL, QVL , SSZ].”