Analysis of two ad hoc broadcasting protocols

Broadcasting techniques are employed in route discovery procedure in on-demand routing protocols such as DSR and AODV. The traditional broadcasting method 'flooding' is not suitable for large heavy-loaded ad hoc networks. Numerous protocols have been proposed to save wireless network capacity and avoid packets collisions. Ns-2 simulations have been used widely to compare the performance of these protocols in various situations. Sometimes it is difficult to measure the efficiency of the protocols based only on the simulation results because usually they cannot cover all the possible situations especially for random networks and random schemes. With rigorous theoretic analysis, we may achieve statistic results which can be used to choose proper parameters (such as threshold values in some schemes) for optimal performance. In this paper, we analyze two popular ad hoc broadcasting protocols in grid networks. The results have shown the relation between protocol efficiency and selection of the parameters.

[1]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[2]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[3]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[4]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[5]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[6]  John G. Kemeny,et al.  Finite Markov chains , 1960 .