{'fraction_non_alphanumeric': 0.013779527559055118, 'fraction_numerical': 0.0, 'mean_word_length': 5.316770186335404, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Multicasting in Ad hoc Networks using Node Transition Probability based Routing Protocol

Mobile Ad hoc Network is an autonomous system of mobile nodes characterized by wireless links. The central challenge in the design of ad hoc networks is the development of dynamic routing protocol that finds routes between mobile nodes. There are two types of data disseminations in a network, namely unicasting and multicasting. In this project, we deal with multicasting, which is a one to many data dissemination. Many multicast algorithms have already been proposed but the major drawback with these algorithms is the excessive control overhead associated with them. Here, we present a new algorithm called Node Transition Probability based Multicast Routing (NTPMR) for mobile ad hoc networks, which requires the lowest control overhead when compared with the existing multicast protocols. The performance of this algorithm is evaluated in terms of quantitative metrics such as control overhead and packet delivery ratio.