| Summary: | 碩士 === 國立臺北科技大學 === 電腦與通訊研究所 === 95 === Mobile Ad Hoc Network (MANET) needs no infrastructure. Its characteristics of network include self-creating, self-organizing and self-administrating. It consists of mobile nodes. Packets are routed and forwarded via multi-hop peer-to-peer protocol between nodes to the destination node. In multicast routing of MANET, the mobility of mobile hosts frequently make the routes broken, and leads to the lower data packet ratio.
The purpose of this study is to propose “An advance route recovery based on degree” to reduce the link breakage for the tree-based topology of multicast in MANET. For the Multicast Ad hoc On-demand Distance Vector (MAODV), the route maintenance could detect the link breakage when the node does not receive any packets from the upstream node after a certain time. However, the re-active route maintenance does not the different influence on different tree degree, and the same waiting time cannot reflect the real topology situation. MAODV initiates tree repair after some nodes losing packets, but it reduces the delivery rate of data packet. Our proposes an advance route recovery based on degree for the MAODV. The node based on the tree degree could obtain better link information from the structure of multicast tree, and initiates tree repair to promote the efficiency of routes in MANET.
The simulation results show that the advance route recovery based on degree could improve the route maintenance of MAODV, increase the delivery rate of data packet and reduce the control overhead.
|
|---|
