Multipoint relaying for flooding broadcast messages in mobile wireless networks

By A. Qayyum, L. Viennot, Anis Laouiti. Proceedings of the Annual Hawaii International Conference on System Sciences, 2002

808 citations recorded by the source corpus.

How researchers see this paper

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

Probabilistic broadcast for flooding in wireless mobile ad hoc networks (2003, background): “[21] restricts flooding to a subset of nodes (”multipoint relays”) by selecting for each node a minimum number of one-hop neighbors covering all second-hop neighbors.”
A Review of Information Dissemination Protocols for Vehicular Ad Hoc Networks (2012, methodology): “In DifCode, each node in the network encodes and broadcasts only the packets that are received from nodes that select it as their MPR.”
An extended localized algorithm for connected dominating set formation in ad hoc wireless networks (2004, background): “In pure localized algorithms [1], [5], [ 16 ], [19], [24], [25], the status of each node depends on its h-hop topology only, where h is a small constant, and usually converges after at most h rounds of information exchange among neighbors.”
Localized minimum-energy broadcasting in ad-hoc networks (2003, background): “MPR (Multipoint relaying) broadcast [4] and stochastic flooding [27] can be seen as energy-efficient broadcast protocols for active-inactive power assignment networks.”
On reducing broadcast redundancy in ad hoc wireless networks (2002, methodology): “A similar forward node selection algorithm, multipoint relaying, is proposed in [ 14 ].”