Author: Deepa Rathore
Abstract: Mobile ad hoc networks (MANETs) are made up of a collection of self- configuring wireless mobile nodes with no network infrastructure. The meaning of accountability is apparent: in a mobile ad hoc network, there is no clear assured border that can be combined or compared to a defined line in a traditional wired network. Invader attacks on these ad hoc networks are on the rise right now. Various algorithmic implementations are done to transport data over the network to avoid data breach to avoid the occurrence of these attacks. The design of MANETs raises a number of difficulties. We must provide maximal capability as well as security to these ad hoc networks in order to ensure secure communication. The shortest path algorithm is employed to provide these safeguards, however there are a number of other concerns that arise as a result of this algorithm's lack of security and efficiency, such as invader assault and concentrated load. We're looking for the Invader Safe path that's closer to the shortest than the shortest. These networks are very dynamic, mobile, and large-scale, yet they also provide static coercion, which is a source of power.
Full Issue
| View or download the full issue | PDF 50-54 |