An Efficient Mechanism to Enhance Reliability for Multicast Tree Construction in Ad Hoc Networks

• Main Authors: Jeng-Han Jiang, 江政翰
• Other Authors: Yeong-Sheng Chen
• Format: Others
• Language: en_US
• Online Access: http://ndltd.ncl.edu.tw/handle/38344038782404497404

碩士 === 國立臺北教育大學 === 資訊科學系碩士班 === 95 === Networks technology is rapid growing, people could communication each other without infrastructure, immediately. With the enhancing in demand for various types of applications, efficient routing algorithms play an important role in ad hoc. The fulfillment of efficient multicast routing protocol has been a complex problem mainly due to the mobility. In MANET, a route with multiple hops is needed when two nodes they are out of radio propagation range determining to exchange messages may not be able to communicate directly. Therefore, a communication may result fail from a hop link broken among entire route. Existing MAODV is a routing protocol developed from AODV for building a multicast tree. Duo to mobility, satisfying tree-based topology and reactive policy, MAODV reconstructs multicast tree frequently. In this paper, we introduced Medium Node to reduce the link recovery overhead without additional control cost and improve packet delivery ratio when a node lost its route to multicast. It purposes to enhance the reliability of link via a few additional controls cost. Simulation result demonstrate our proposed approach exhibits good throughput at low mobility and has the smallest control overhead which results in better end-to-end delay compared to other algorithm.