Multicasting Approach in Mobile Ad-Hoc Networks and its Performance Analysis

Mobile nodes in ad-hoc network operate under a lot of constraints chief among them being limited battery power. A lot of study has gone into developing efficient routing strategies within mobile ad-hoc network (MANET). A MANET by itself is of limited use. Nodes within a MANET have limited storage capacity. In order to extend its capability and usefulness, a MANET may have to communicate with a minimum number of nodes. The paper proposes a multicasting approach for calculation of minimum connected dominating set (MCDS) for entire network based on neighbor´s node knowledge. MCDS is a subset of node in the network such that every node in the network either lies on the MCDS or is adjacent to it. Proposed algorithms based on maximum neighbor´s node so, maximum neighbor´s node covers maximum number of graph nodes. So, existing algorithms reduce steps and complexity also. The mobile nodes lying on the MCDS from the virtual backbone for the network and only these nodes are allowed to rebroadcast. This approach significantly reduces the total number of rebroadcast nodes in the network resulting in considerable reduction of contention and collision.