A Dense Mode Ad hoc Multicast Routing Protocol Constructing Shortest Path Trees with Low Control Overhead
暂无分享,去创建一个
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. Ad hoc multicast communication can be applied to a many-to-many conference among vehicles. 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. From this requirement, it is considered that the dense mode multicast routing with low control overhead is appropriate for ad hoc many-to-many conference application. In this paper, we propose 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 result of designing our multicast routing protocol and that of performance evaluation in terms of control message overhead
[1] J. J. Garcia-Luna-Aceves,et al. The core-assisted mesh protocol , 1999, IEEE J. Sel. Areas Commun..
[2] Charles E. Perkins,et al. Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.
[3] Tom Pusateri. Distance Vector Multicast Routing Protocol , 2003 .