Improved Multicasting in Mobile Adhoc Networks

Abstract

Sending multiple copies of packet to different nodes is called Multicasting. newlineWired and infrastructure-based wireless networks are supported by many multicast newlinerouting protocols. However, applying this concept in Mobile Ad hoc wireless networks newline(MANETs) is a big challenge. Problems in ad hoc networks are the scarcity of newlinebandwidth, short lifetime of the nodes due to power constraints and dynamic topology newlinedue to the mobility of nodes. These problems put in force to design a simple, scalable, newlinerobust and energy efficient routing protocol for multicast environment. The MANET newlineroute failure may happen simultaneously owing to the characteristics of the mobile newlinenodes. This leads to enhanced routing overhead and therefore the performance of the newlineoverall MANET system is decreased. newlineIn the first phase of research work, Improved Multicast Routing in MANET newlineusing Micro Artificial Bee Colony Approach (IMR-MABC) is presented which allows newlineidentification of the mobile nodes which can fulfil the multiple QoS parameter values newlineby utilizing a multicast tree which has been constructed. Here in this tree, optimal route newlinepath between various possible route paths would be chosen by utilizing the MABC newlinewhich targets on the lifetime of the network and consistency. newlineIn the second phase of research work utilizes Trust and Link Failure aware Multi newlineCast Routing (TLF-MCR) which allows identification of the mobile nodes for creating newlinethe secured way of routing optimally with the responsibility of trust and QoS values. In newlinethe multicast tree, optimal route path between the various possible route paths is chosen newlineby utilizing the hybridized differential artificial bee colony approach which targets on newlinethe lifetime of the network and consistency. In addition to this, the link failure recovery newlinehas also been done by utilizing the backbone recovery which depends on the algorithm. newlineIn the third phase of research work, the routing overhead is decreased newlineconsiderably by creating the routing path optimally. After that, the failure recovery is newlinecompleted with decreased routing overhead using the Location and Probabilistic newlineConnection based Routing Path Protocol (LPC-RPP) methodologies. newlineThe experimental examination which has been done in the NS2 simulation newlineenvironment shows that the presented methodology can accomplish better performance, newlinewith high level of security for various performance metrics. newline