Research And Implementation Of MAODV-X Multicast Routing Protocol Based On Xcast And Stable Link Repair

Ad Hoc network, which is a network without any central entity, relies on mutual cooperation among the nodes themselves to form a network, with multi-hop technology to complete transmission in the limited range, Ad Hoc network shows flexibility, mobility, and the rapid expansion and overall system characteristics of strong resistance to destruction; it is very suitable for military, disaster relief, personal communication, wireless sensor networks area. Under such background, it becomes one of the hot spots in network research area all over the world.With the development and increase in applications of multicast technology, which is very important in close collaboration for a team, a lot of multicast protocols have been proposed for Ad Hoc Networks, MAODV is one of the widely used multicast protocols which is based on the tree-structure. On the one hand, in the case of fewer nodes, there will be many non-multicast members becoming part of the multicast tree, which increase the network control overhead; On the other hand, due to Ad Hoc network nodes have the characteristics of limited energy and different processing ability, the link need be frequently repaired, increasing the number of link repair.What’s more, MAODV does not have a stable link repair mechanism, which will incur higher end-to-end latency and network overhead.To address the issues mentioned above, based on a deep investigation of MAODV multicast routing protocol, this thesis proposes a MAODV-X multicast routing protocol based on Xcast(Explicit Multicast) and stable link repair in Ad Hoc network, which combines the explicit ideas of multicast with the multicast tree structure of MAODV and uses maximum entropy to choose one of the most stable links. In MAODV-X, by establishing the specifical router table in intermediate nodes from the original multicast protocol, we simplify the MAODV multicast trees, which reduce the control overhead of multicast tree, and through the multicast routing table of intermediate nodes, we predigest the compression code of explicit multicast IP address, which depress the complexity of explicit multicast IP header. Furthermore, by taking into account the energy consumption and the congestion level and computing the stability parameter through Shannon theorem of maximum entropy, we may choose one of the most stable links, and reduce the number of link repair.This thesis gives a detailed description about MAODV-X routing protocol, and implements a simulation experiment of MAODV-X based on the extended NS2network simulation software. Finally, through the anylasis of simulation results of MAODV, E2M and MAODV-X, we can see that MAODV-X outperforms MAODV and E2M.