Comparison of broadcasting techniques for mobile ad hoc networks

Williams, B.; Camp, Tracy

doi:10.1145/513800.513825

Cited by 922 publications

(258 citation statements)

References 7 publications

Supporting

Mentioning

256

Contrasting

Unclassified

Order By: Relevance

“…Previous research [19,20] has shown that AHBP performs well in static networks. However, when mobility increases in the network, the two-hop neighbor information becomes inaccurate, the wrong BRGs are selected, and reachability decreases.…”

Section: Ahbp and Sbamentioning

confidence: 96%

See 1 more Smart Citation

Comparing wireless flooding protocols using trace-based simulations

Jacobsson

Rohner

2013

J Wireless Com Network

View full text Add to dashboard Cite

Most wireless multi-hop networks, such as ad hoc networks and wireless sensor networks, need network-wide broadcasting, which is best done with a flooding protocol. In this article, we use packet trace information from a real test-bed network to define a simulator for flooding protocol performance studies. Five protocols are compared using the simulator. Trace-based simulations promise to have the benefits of the simulator, such as reducing required work effort and repeatability but still produce results close to the real test-bed or deployment. We propose and evaluate different approaches on how to use collected trace data and how to tune the parameters to achieve the best possible accuracy in comparison with actual test-bed measurements. We study the resulting accuracy of the model so that performance studies know with what confidence a certain conclusion can be made. Using the new trace-based model and knowing its accuracy, we compare the five flooding protocols to gain additional insights into their performance. Finally, by modifying the trace data, we study how real-world effects, such as links with in-between qualities and asymmetric links, influence the different flooding protocols.

show abstract

Section: Ahbp and Sbamentioning

confidence: 96%

“…An early study was done by Williams et al [20], which was purely based on ns2 simulations using the standard two-ray ground reflection model. We conducted a similar study in the paper where we introduced PFS [1].…”

Section: Related Workmentioning

confidence: 99%

Comparing wireless flooding protocols using trace-based simulations

Jacobsson

Rohner

2013

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Probabilistic flooding [56][57][58] was first proposed as an optimization of flooding to reduce energy consumption. In probabilistic flooding, only a subset of nodes within the entire network will participate in data forwarding, while the others simply discard the messages they receive.…”

Section: Probabilistic Floodingmentioning

confidence: 99%

Security and Privacy for Sensor Networks

Trappe

Ning

Perrig

2010

Handbook on Array Processing and Sensor Networks

View full text Add to dashboard Cite

“…In [30] a taxonomy of the different solutions has been reported. The authors divide the different schemes in four groups:…”

Section: Related Workmentioning

confidence: 99%

“…A taxonomy similar to the one in [30] is reported in a recent work by Stojmenovic and Wu [27]. In this case, the solutions proposed in the literature are grouped based on whether the protocol is probabilistic or deterministic, on the amount of information on the network topology needed by the protocol to operate, the amount of extra information exchanged between nodes during the protocol operation, and the schemes' reliability (defined as the capability of a broadcasting protocol to successfully reach all the nodes in the network).…”

Section: Related Workmentioning

confidence: 99%

Localized Techniques for Broadcasting in Wireless Sensor Networks

Panconesi¹,

Petrioli²,

Vitaletti³

et al. 2007

Algorithmica

View full text Add to dashboard Cite

In this paper we tackle the problem of designing simple, localized, low energy consuming, reliable protocols for one-to-all communication in large scale wireless sensor networks. Our first proposed technique, called the Irrigator protocol, relies on the idea to first build a sparse overlay network, and then flood over it. The overlay network is set up by means of a simple, distributed, localized probabilistic protocol and spans all the sensor nodes with high probability. Based on the algorithmic ideas of the Irrigator protocol we then develop a second protocol, dubbed Fireworks, with similar performance that does not require any overlay network to be set up in advance. Asymptotic analytical results are provided which assess the reliability of the Irrigator and Fireworks techniques. The theoretical analysis of the proposed protocols is complemented and validated by a (simulation based) comparative performance evaluation that assesses several advantages of our new protocols with respect to gossiping and simple flooding. Differently from previous studies, we analyze and demonstrate the performance of our protocols for two different node distributions: The typical uniform distribution and a newly defined "hill" distribution, here introduced to capture some of the important and more realistic aspects of 413 node deployment in heterogeneous terrain. Simulation results show that the proposed schemes achieve very good trade-offs between low overhead, low energy consumption and high reliability. In particular, the Irrigator and Fireworks protocols are more reliable than gossiping, and significantly reduce the number of links along which a message is sent over both flooding and gossiping.

show abstract

Comparison of broadcasting techniques for mobile ad hoc networks

Cited by 922 publications

References 7 publications

Comparing wireless flooding protocols using trace-based simulations

Comparing wireless flooding protocols using trace-based simulations

Security and Privacy for Sensor Networks

Localized Techniques for Broadcasting in Wireless Sensor Networks

Contact Info

Product

Resources

About