الفهرس | Only 14 pages are availabe for public view |
Abstract Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes (or routers) dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. The routers are free to move randomly and organize themselves arbitrarily; thus, the network’s wireless topology may change rapidly and unpredictably. Application of ad hoc networks includes Personals Area Networks (PAN), military applications, mobile conferencing, Bluetooth and wireless sensor networks. Multicasting is defined as the transmission of datagram’s to a group of hosts identified by a single destination address and hence is intended for group-oriented computing. Application of Multicasting includes Video Conferencing, Push Technologies and distributed Systems…etc. Recent researches take the advantage of building Multicast Routing Protocols on-demand mesh topology rather than tree topology. In mobile ad hoc networks, there are many multicast protocols that apply mesh topology and on-demand concept as ”On-Demand Multicast Routing Protocol (ODMRP)”, Forwarding Group Multicast Protocol (FGMP) …etc. The difficulties of MANETs are the scarcity of bandwidth, short lifetime due to power consumption dynamic topology caused by nodes mobility. This problem put in force to simple design. We discussed the architecture of different algorithms as Shortest Path Trees (SPT) that is used in most recent Multicast routing protocols as On-Demand Multicast Routing Protocol “ODMRP”, Minimum Spanning Trees (MST) and Minimum Cost Trees (MCT). This thesis, introduces multicast routing algorithm to reduce the cost of bandwidth of MANET. We determined the minimum multicast tree by finding the Minimum Number of Transmission (MNT) using Minimum Cost Tree (MCT) and virtual mesh based. The proposed algorithm compared to the Shortest Path Tree (SPT) algorithm within On-Demand Multicast Routing Protocol “ODMRP”, the one that most multicast routing protocols in MANET are using, and found to be superior upon bandwidth, throughput, and faster join. . |