A Wireless Mobile Ad-Hoc Network is a self-configured network with a spontaneous change in the network topology. Since the nodes are under mobility the routing topology adopts to the changes instantaneously. Routing security is the more challenging and nodes misbehavior attacks are likely to happen when using AODV protocol. Nodes tend to behave more selfishly and fail to forward the packet in the routing process. The key goal of this paper is to mitigate the selfish behavior of the node using reputation based Extensive deep packet scrutiny Algorithm. The proposed mathematical model detects the selfish nodes from normal working nodes based upon the final reputation score The proposed version improvises the performance of AODV in terms of throughput and packet delivery ratio in the NS-2 simulation environment.
CITATION STYLE
Geetha, V., Hariprasad, S. A., & Vanke, P. (2019). Reputation Based Extensive Deep Packet Sc-Rutiny Algorithm for Detecting Selfish Nodes in MANETs. In Lecture Notes on Data Engineering and Communications Technologies (Vol. 26, pp. 1512–1520). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-03146-6_177
Mendeley helps you to discover research relevant for your work.