Cuckoo Search and M-Tree based Multicast Ad hoc On-demand Distance Vector Protocol for MANET
D. Madhu Babu1, M. Ussenaiah2
1D. Madhu Babu, Research Scholar, Department of Computer Science, Vikrama Simhapuri University, Nellore (A.P), India.
2Dr. M. Ussenaiah, Assistant Professor, Department of Computer Science, Vikrama Simhapuri University, Nellore (A.P), India.
Manuscript received on 21 July 2019 | Revised Manuscript received on 03 August 2019 | Manuscript Published on 10 August 2019 | PP: 876-879 | Volume-8 Issue-2S3 July 2019 | Retrieval Number: B11640782S319/2019©BEIESP | DOI: 10.35940/ijrte.B1164.0782S319
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The proposed work, Cuckoo Search (CS) and M-Tree based Multicast Ad hoc On-demand Distance Vector (MAODV), is a two-step process, which involves M-Tree construction and optimal multicast route selection. Divisional based Cluster (DIVC), a technique of clustering inspired from Divisive clustering, builts the M-Tree using three constraints, destination flag, path-inclusion factor, and multi-factor. This paper aims to provide optimal multicasting with multiple objectives, such as energy, link lifetime, distance and delay.
Keywords: Cuckoo Search, Divisive Clustering, MANET , M-Tree, , Multicast Routing.
Scope of the Article: Wireless Mesh Networks and Protocols