A Technique of NLAODV algorithm to get Routes of Nodes-List in Mobile Ad-hoc Network (MANET)
Saad Sulaiman Naif, Barzan Abdulazeez Idrees, Ali Jalil Ibrahim and 1 more
Science Journal of University of Zakho · 2022
doi:10.25271/sjuoz.2022.10.3.909 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC-SA
References12
12 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.