International Journal of Aquatic Science ISSN: 2008-8019 Vol 12, Issue 01, 2021 114 Routing Protocol Simulation In A Big Data Environment ZulfadliMohd Saad 1 , MohdHafizuddin Razale 2 , MohdNorazmi Nordin 3 1 Faculty of Art and Design, UniversitiTeknologi MARA, Shah Alam, Malaysia 2 Universiti Putra Malaysia 3 Cluster of Education and Social Sciences, Open University Malaysia Abstract: In this study, the proposedrouting protocol can be improved further by formulating amechanism to help nodes gain further knowledge of othersinside the network. Without exchanging further message andextra processing burden on nodes, the primary challenge wasto enhance the routing protocol, but always kept an eye onavoiding any alteration to the well-designed routing protocoland trying the best not to cause extra overhead that preventsthe enhancement from achieving its goal. Overall, we canconclude that simulation for MD-AODV shows the correctimplementation of the algorithm and the performance metricresults proves the success of the implementation. Thesimulation result also shows previous two that MD-AODVwill cause a slight increase in route discovery. However, itleads to a better End-to-End delay during data transmission. 1. INTRODUCTION People want to join and leave networks as they want and donot require sophisticated processes applied by serviceproviders and. It can be a good alternative when theseproviders are down during disasters or war [1]. The advancementin wireless devices and the increase of data exchange speed,real time applications become a central source forcommunication among people.Data exchange in MANET requires routes that it should beestablished before transmission and nodes participating information of the network have to cooperate and use some of its uses different type of routing protocols that can be classifiedin different ways.The main classification relies on the route discovery policy [2, 3].Proactive or static routing protocols require routes to beestablished between all nodes during the formation of thenetwork as in (OLSR and DSDV). Routing tables used to storepaths to all nodes inside the network and they are updatedperiodically. These routing protocols have the advantage ofroute availability when needed and the disadvantage saw inlarge networks as it causes overhead and consume resources.While reactive or dynamic routing protocols establishes pathwhen any node have data want to send as in (AODV andDSR) [4]. The advantage of this type is the small size of routingtable, as nodes do not require storing information about wholenetwork the disadvantage comes from the delay time neededfor route discovery and the delay caused by link break andrepair process that leads to further packet retransmission.(Abdul Jalil et al., 2021; Mohd Noh et al., 2021; Mustafa et al., 2021; Roszi et al., 2021; Tumisah et al., 2021). If it is managed well, various problems can be avoided (Irma et al., 2021; Suzana et al., 2021; Rohanida et al., 2021; Nazrah et al., 2021; Shahrulliza et al., 2021). Combinations of both previous types create a hybrid type ofprotocols to reduce overhead caused by the two differenttypes. This type usually suits large network in which it isdivided to smaller groups called (clusters, zones….etc.)inter-group communication conducted in a