Chapter 33 An Efficient Mobile Ad-Hoc Networks Routing Algorithm Based on Multicast Protocol

摘要

We put forward a kind of effective multicast routing protocol tree called spanning tree (STM) on multicast. In the dynamic network, like MANETs maintenance method, the traditional spanning tree using Ω control information (E) in order to adapt to each topology changes, in E is a large number of the edge of the network. This is mainly the cost of rebuilding the tree from scratch. In most cases, E are equivalent, the worst case, the O (V2) complexity, there is a large number of nodes V tree, make the derivative multicast protocols efficiency. At the same time, OMST amortize information complexity reduce O (V), as follows. The author theoretically evaluation algorithm OMST not only use the experimental results. Our main advantage for the more easy to use and improve OMST design a multicast routing protocols, make this protocol from OMST implementation in NS-2 performance evaluation.