On the reduction of broadcast redundancy in mobile ad hoc networks

By Wei Peng, Xicheng Lu. 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444), 2000

726 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/c63a8c34b18e98fa97bc147d515cafa6437d7329

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

Citations in the corpus

Multipoint relaying for flooding broadcast messages in mobile wireless networks (2002, background): “In pure ooding, ea h node retransmits without8 0 5 10 15 20 25 30 0 20 40 60 80 100 N um be r of ti m es , t he s am e m es sa ge is r ec ei ve d Probability of error in reception Duplicate message reception Flooding using MPR Pure flooding Figure 7: Number of dupli ate re eptionsex eption, so there”
Secure link state routing for mobile ad hoc networks (2003, background): “…present in link state protocols, has additional benefits: examples include the ability of the source to determine and route simultaneously across multiple routes [6], the utilization of the local topology for efficient dissemination of data [7] or efficient propagation of control traffic [8].”
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks (2002, neutral): “Index Terms—Broadcasting, ad hoc networks, dominating sets.”
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].”
Localized minimum-energy broadcasting in ad-hoc networks (2003, methodology): “This new “trick” is similar to neighbor elimination scheme [3], [26] but only applied to neighbors in RNG graph.”
Comparison of broadcasting techniques for mobile ad hoc networks (2002, methodology): “Unlike SBA, however, Dominant Pruning requires rebroadcasting nodes to proactively choose some or all of its 1-hop neighbors as rebroadcasting nodes.”
An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces (2006, methodology): “In methods that exploit 2-hop set of neighbors [22, 31, 32, 40] nodes add also the list of direct nodes in each hello-packet.”
Probabilistic broadcast for flooding in wireless mobile ad hoc networks (2003, background): “As for deterministic studies of the problem, [18] and [15] make use of local topology knowledge in order to avoid unnecessary rebroadcasts by comparing the added coverage between the rebroadcast of a destination node to that of the source node at each hop.”
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].”
Opportunistic large arrays: cooperative transmission in wireless multihop ad hoc networks to reach far distances (2003, background): “Some interesting alternatives are the probabilistic scheme [19] and the scalable broadcast algorithm [ 20 ].”