Journal of Applied Computer Science &l Mathematics - A full open access journal on applied computer science and mathematics JACSM

Mobile ad hoc networks (MANET) is a type of networks that consists of autonomous nodes connecting directly without a top-down network architecture or central controller. Absence of base stations in MANET force the nodes to rely on their adjacent nodes in transmitting messages. The dynamic nature of MANET makes the relationship between nodes untrusted due to mobility of nodes. A malicious node may start denial of service attack at network layer to discard the packets instead of forwarding them to destination which is known as black hole attack. In this paper a secure and trust based approach based on ad hoc on demand distance vector (STAODV) has been proposed to improve the security of AODV routing protocol. The approach isolates the malicious nodes that try to attack the network depending on their previous information. A trust level is attached to each participating node to detect the level of trust of that node. Each incoming packet will be examined to prevent the black hole attack.

Mobile ad-hoc networks (MANETs) and wireless mesh networks (WMNs) are used in a variety of research areas, including the military, industry, healthcare, agriculture, the Internet of Things (IoT), transportation, and smart cities. The swift advancement in MANET technology is the driving force behind this rising adoption rate. Routing over MANET is a critical problem due to the dynamic nature of the link qualities, even when nodes are static. A key challenge in MANETs is the need for an efficient routing protocol that establishes a route according to certain performance metrics related to the link quality. The routing protocols utilised by the nodes in WMNs and MANETs are distinct. Nodes in both types of networks exchange data packets through the routing protocols. For this highly mobile network, the ad-hoc On-Demand Distance Vector (AODV) routing protocol has been suggested as a possible solution. Recent years have attracted researchers’ attention to AODV since it is a routing technique for ad-hoc networks that prevents looping. The architecture of this routing protocol considers several factors, including the mobility of nodes, the failure of connection links, and the loss of packets. In this systematic review, one of the key focuses is bringing attention to the classic AODV, which was developed after discussing the recent development of several versions of AODV. The AODV routing protocol performs a path strength check to generate a more reliable and secure route between the source and destination nodes. In AODV, investigations demonstrate advances in both the format protocol approach and the network simulation-2 (NS-2), and these improvements were made in the same scenario used to revitalise AODV. It has been discovered that the AODV is more effective in several aspects, such as throughput, end-to-end delay, packet delivery ratio (PDR), energy consumption, jitter, packet loss ratio, and network overhead. Furthermore, this paper presents this systematic review based on AODV modifications in the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA). It also provides a methodological framework for the papers’ selection.

Mobile ad-hoc network (MANET) has attracted the attention of networking industries owning to their desirable characteristics such as multi-hop routing, self-configuration, self-healing, self-managing, reliability, and scalability. Routing over wireless mobile networks is a critical problem due to the dynamic nature of the link qualities, even when nodes are static. A key challenge in MANETs is the need for an efficient routing protocol that establishes a route according to certain performance metrics related to the link quality. The routing issue in MANETs is generally concerned with finding a good path between the source and the destination pairs. Based on that, there is a demand for the development of a high throughput routing protocol. The impact of a single-path routing protocol and a multi path routing protocol on the performance of MANETs is required to be investigated. In this work, a performance comparison in terms of throughput, packet delivery, routing overhead, and end to end delay of well-known routing protocols such as AODV, AOMDV, and OLSR using network simulator version 2 (NS-2) has been introduced. The simulation results of this work show that the single-path AODV protocol out performance the multi path OLSR and AOMDV protocols in terms of throughput and packet delivery ratio. In addition to that, the single-path routing protocol presents less routing overhead in comparison to the AOMDV and OLSR. While the OLSR and AOMDV demonstrate a relatively better end to end delay in comparison to the AODV protocol.

Performance, scalability, Quality of Service (QoS), users’ response, etc. of any network depends upon the efficient network design and communication technologies being exploited. Mobile Ad hoc Networks (MANETs) have become widespread due to their zero-configuration requirements, scalability, maintenance and adaptable nature to cater varying requirements. The core process of any network is routing which is performed by routing protocols. Routing protocols play a crucial role to enhance and improve the performance indicators of any network. Traditional MANET routing protocols have been failed to address growing demands of wireless mobile ad hoc network. In this paper we study and compare a nature inspired Ant Colony Optimization (ACO) algorithm with legacy of MANET protocols. Simulation results show that ACO algorithm has high potential to be used in large scale MANET or other wireless networks. We compared ACO with proactive and reactive routing protocols because despite of their weaknesses these types of protocols are still being used in different and same wireless arrangements.

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks (MANETs) from dynamic topologies that pose great challenges because of the mobility of nodes. The main objective was to delve into and refine the application of the Dijkstra's algorithm in this context, a method conventionally esteemed for its efficiency in static networks. Thus, this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm, considering adaptation to the dynamic network conditions that are typical for MANETs. This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm, when adapted for dynamic updates, yields a very workable solution to the problem of real-time routing in MANETs. The results indicate that with these changes, Dijkstra’s algorithm performs much better computationally and 30% better in routing optimization than Bellman-Ford when working with configurations of sparse networks. The theoretical framework adapted, with the adaptation of the Dijkstra's algorithm for dynamically changing network topologies, is novel in this work and quite different from any traditional application. The adaptation should offer more efficient routing and less computational overhead, most apt in the limited resource environment of MANETs. Thus, from these findings, one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods. This paper, therefore, operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.