| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 90 === The future wireless networks are expected to support multicast applications more and more. To facilitate this, multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, mobile ad hoc networks use radio propagation model. Each mobile node can freely move around in an ad hoc wireless network. It faces more serious problems than static network in multicast application such as link failures and scarce bandwidth. The current routing protocols do not have good performance between source and group members when source sending multicast datagrams to receivers. When the mobile nodes change their position, there is a change in the wireless network resources that can give rise to uncertainty in network conditions. In ad hoc wireless networks, the high mobility of hosts is usually a major reason for sending packets to all of members. For this reason, we propose a tree-based multicast protocol named, weight-based clustering multicast routing protocol (WCMP), to select appropriate clusterheads to manage the group members. In our method, there are two stages, that is, the reactive stage and the proactive stage, to maintain the multicast delivery tree and on demand determine clusterheads. First, the reactive stage can reduce the query-reply and control messages. Secondly, the proactive stage can quickly reflect the topology in mobile ad hoc networks according to weight mechanism and multicast delivery tree maintenance. We show through simulations that WCMP outperforms a mesh-based multicast routing protocol in terms of the packet delivery ratio and control message overhead, especially in high mobility situation.
|
|---|
