No abstract

The Ad Hoc routing protocols include the route rediscover algorithms. Thus, a desirable aim for any routing protocol is to design an effective and rapid route recovery technique to rebuild the broken link. This study presents Multiple Node Index in Multi-Channel (MNIMC) and Multiple Node Index in Single-Channel (MNISC) as two novel route discovery techniques. MNIMC integrates multiple pathways and channels to create an alternate path. MNIMC reroutes the data packet via a different route in previously detected channels. Furthermore, it works with numerous link failures. MNIMC nodes are considered multi-transceiver enabled, in contrast to MNISC, which enables several routes and a single channel. Using the Network Simulator 2 (NS2), the MNIMC and MNISC schemes are developed and thoroughly tested. Simulation results demonstrate that the suggested approach improves packet delivery ratio, throughput, and end-to-end latency.

There are many techniques of using routing protocols on Sensor Network's mobile nodes, yet failures can occur in Wireless Networks path. High mobility leads to slipping nodes in the routing table, causing packet loss; current protocols suggest using rediscover paths. Nevertheless, this process increases delay. This paper proposes a design of two different methods to select the shortest multipath and select the longest multipath to get different scenarios to Set Backup Routes on Sensor Network “SBSN” to avoid using rediscover routes by providing different paths and improve the performance and efficiency of a network depending on the method of packets processing declared in the Proposed System. The proposed technique merges An Ad Hoc On-Demand Distance Vector “AODV” and Multipath-Ad Hoc On-Demand Distance Vector “M-AODV”. Comparison of a delay in transmitting rate, loss of packets, and packet delivery ratio to ensure a network's transmitting performance and efficiency Achieves low broadcast redundancy. It avoids the challenges of establishing paths from low to high-mobility of nodes between a single source and destination.

A Mobile Ad-hoc Network (MANET) is a group of nodes that connect to each other wirelessly without the use of a central server or a traditional network structure. In MANETs, data packets are sent through wireless channels to keep communication going. Ad-hoc On-Demand Distance Vector Routing is a MANET-related reactive routing technology that generates a path of nodes to a destination by broadcasting packets of route request across the network. In this kind of Routing protocol, a connection loss causes the source to send control (RREQ) on the network, causing network congestion and performance deterioration. This study offers a Node List (NLAODV) Node List Ad-hoc On-Demand Distance Vector routing method that includes links and path-nodes to identify if any node on the network is involved in the route discovery process for sending control packets from wireless source node to the wireless destination node. Simulation findings reveal that the proposed NLAODV algorithm minimizes flood Packets and get best network as it’s not necessary for all nodes to be present in route discovery.