Multicast tree construction and flooding in wireless ad hoc networks
By Hyojun Lim, Chong-kwon Kim. International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, 2000
499 citations recorded by the source corpus.
In an ad hoc network, each host assumes the role of a router and relays packets toward final destinations. This paper studies efficient routing mechanisms for multicast and broadcast in ad hoc wireless networks. Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. In this paper, we point out that the number of packet forwarding is the more important cost factor than the number of links in the ad hoc network. After we show constructing minimum cost multicast tree is hard, we propose two new flooding methods, self pruning and dominant pruning. Both methods utilize neighbor information to reduce redundant transmissions. Performance analysis shows that both methods perform significantly better than blind flooding. Especially, dominant pruning performs close to the practically achievable best performance limit.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/31a1560d0cf9f3ce5bbf9b4c0829e06453590205
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
- V. Naumov
- Thomas R. Gross
- Rainer Baumann
- Yoav Sasson
- David Cavin
- André Schiper
- Tracy Camp
- Brad Williams
Citations in the corpus
- 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.”
- Comparison of broadcasting techniques for mobile ad hoc networks (2002, methodology): “Dominant Pruning: Dominant Pruning also uses 2-hop neighbor knowledge, obtained via “Hello” packets, for routing decisions [9].”
- 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.”