Performance Evaluation of Shortest Path Tree based Dense Mode Ad Hoc Multicast Routing Protocol

T. Kozaka, T. Kato, S. Itoh, and Y. Urano (Japan)


Ad hoc Network, Multicast Routing, Shortest Path Tree, Dense Mode, ManytoMany Communication


In recent years, an ad hoc network is paid to attention widely, and many routing protocols are studied actively not only for unicasting but also for multicasting. In addition, ad hoc multicast communication can be applied to several many-to-many conference. Here, it is required to reduce the number of hops in the multicast data delivery and reduce the control message overhead, in order to save wireless channel bandwidth, because the communication quality is much lower than Internet and the network resource is limited. From this requirement, it is considered that the shortest path tree based method and the Dense Mode multicast routing with low control overhead are appropriate for ad hoc many-to-many conference application. We have been proposing a new ad hoc multicast routing protocol, which constructs the shortest path tree efficiently and guarantees the operation of Dense Mode such as the Broadcast & Prune. This paper describes the procedure for constructing shortest path trees in detail, and the results of performance evaluation focusing on the construction of multicast trees and its impact on the multicast data transfer.

Important Links:

Go Back