Cuckoo search and M-tree based multicast ad hoc on-demand distance vector protocol for MANET

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.