Mobile Adhoc Networks are shortly called MANETs. In these types of networks, fixed infrastructures are absent and are dynamic in nature. Nodes are movable, and they are not connected with any wires. For monitoring or supervising the transmissions in MANETS, no central supervision is present. Moving nodes, dynamic topology, and absence of infrastructure are the features of MANETs. These features are advantageous where wires cannot be used and where nodes are supposed to move. But there is a problem of security. Networks are highly prone to attacks where finding the root of the cause is very hard. Many nodes disjoint routing algorithms are proposed to balance the load, to cope up with link failures, etc. This paper proposes an algorithm called Node Disjoint Random and Optimal Path Selection (NDROPS) algorithm which uses the concept of dynamic routing and node disjoint routing to provide all the above-stated advantages along with security. Routing of data packets is done through few paths which are node disjoint. The main essence of this algorithm is to distribute the data among different routes. So, a malicious node in a path can retrieve only a few packets in random. The simulation of the proposed NDROPS algorithm is performed and the performance is compared using throughout and packet drop probability.
Mobile Ad-hoc Networks (MANETs) are wireless and nodes of it are mobile in nature. These networks can be adopted where equipment like wires cannot be established and the nodes are moving. Due to the mobile nature of nodes, a fixed topology cannot be achieved. This leads to a dynamic or ever changing network structure. The paths between the communicating nodes also change frequently. Overall monitoring system is absent in it i.e. supervising node is not present for establishing routes in the network. Each node itself acts as a router. Due to the lack of fundamental management system and ever moving nodes, security becomes a challenge and detection of attackers also becomes tough. Dynamic source Routing (DSR) is used in route discovery. In this routing strategy, paths are established only on demand of sender and receiver nodes. And to reduce the cost many algorithms were proposed, but the concept of security is deficit in them. In this paper, Secure and Effective Random Paths Selection (SERPS) algorithm is proposed with the concepts of minimum cost and node disjointness to achieve security. All the node disjoint paths between sender and receiver are found. Among them a minimum of 4 minimum cost paths are selected. Then data packets are sent through them by randomly selecting the paths. Care is to be taken such that no consecutive packets go through the same path. By this, attacker at any node gets only the random packets but not the complete data. In this way security can be achieved. The simulation for the proposed SERPS algorithm is done to show the routing process.
: Nodes in the mobile Ad-hoc network (MANET) have the dynamic nature due to their vast separation distance. The dynamic nature of the MANET nodes changes the routing path established for the communication. The dynamic secured routing (DSR) has gained popularity since they provide the routing path based on the demand provided by the source and destination nodes. Various literature works have discussed the DSR strategy for routing path establishment, but faces challenges since it consumes high energy during the route discovery phase. In this work, a DSR strategy based on the Fractional Whale optimization algorithm (FWOA) is introduced to overcome the challenges in the existing works. The proposed algorithm uses the C2TE based selection criteria which depend on the connectivity, congestion, trust, and energy for selecting the suitable nodes for the communication. The proposed FractWhale-DSR algorithm finds the secured routing path in three phases. The parameters such as throughput, delay, packet delivery ratio (PDR), and the energy define the performance of the proposed model. From the simulation results, the proposed FractWhale-DSR algorithm has an overall better performance with the values of 0.57265, 0.005118, 0.786325, and 75.88636% for throughput, delay, PDR, and energy respectively at the round of 25 for the MANET with 100 nodes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.