Turkish Journal of Computer and Mathematics Education Vol.12 No. 6 (2021), 1072-1082 Research Article 1072 Attack Prediction By Using Greedy Algorithm For Diminishing The Drop And Delay In Wireless Sensor Networks 1 Dr. B.Shadaksharappa, 2 Dr . P Bindhu Madhavi, 3 P.Ramkumar 1Principal and Professor (CSE) Sri Sairam College of Engineering Engineering Anekal, Bengaluru-562106 Karnataka, India Email:bichagal@sairamce.edu.in principal@sairamce.edu.in 2Professor & Head (CSE) Sri Sairam College of Engineering Anekal, Bengaluru-562106 Karnataka, India Email:bindhu.pujari@gmail.com hod.cse@sairamce.edu.in 3Assistant Professor(CSE) Sri Sairam College of Anekal, Bengaluru- Karnataka, India ramkumarp.cse@sairamce.edu.in. Article History: Received: 11 January 2021; Accepted: 27 February 2021; Published online: 5 April 2021 .Abstract: The essential constraint of the internet is that forwarding the data packets of data among the restricted and trustworthy data nodes. If the receiver node is attacker node then it'll drop the data rather than forwarding the data to ensuing neighbor node. Therefore, efficient and secure data transmission is extremely necessary within the network data transmission. Each router node within the network can accept the data packets up to its buffer size only. Once the queue value reached the buffer threshold value then congestion can occur at the node. Once congestion happens then it would lose the data packets. By sending the data packets to the next neighbour node this problem will be resolved. This congestion will be handled by the Fully Distributed Congestion Control FDCC and Cooperative and Memory Efficient Token Bucket (CMTB) algorithms. Because the data is transmitted to the next neighbour node predicting the node behavior is extremely necessary because it is an attacker or the conventional transmitter node because it has to transmit the efficient data securely to the destination node. In this paper, the node behavior will be predicted by analyzing the trace file. The simulation results show that this proposed method would provide a lot of security in data transmission. The WSN comprises a group of sensor nodes that are disseminated on the network. These sensor nodes initially exchange their data packets to the near nodes to send the data packets to the target node. During the transmission of these data packets some data packets drop may also happen inside the network. This packet drop should be kept up as low as feasible for correct data transmission to the target node or destination node. This algorithm highlights the routes with high link quality, low packet delay and with low packet drop. Simulation results show that this proposed algorithm can provide the most effective path for transmitting the data to the destination meanwhile it reduces the packet drop and packet delay. Keywords: Cooperative and memory-efficient token bucket (CMTB), fully-distributed congestion control (FDCC), Wireless Sensor Network, Edge Greedy Algorithm, Malicious Node, and Congestion Control. I. INTRODUCTION One of the most important ICN (Information-centric Network) Architectures is CCN (Content-Centric Networking). This CCN treats the content as primitive. Here the user required content is requested and retrieved with the help of the name instead of using the specific IP address [2].in CCN, this would have two packets one is interest packet and data packet. For requesting the required content it uses the interest packet. Over all the available connectivity a consumer asks for the required content by broadcasting its interest. If any node received this interest and having the interest data then it will send the data packet. This CCN architecture has three main data structures such as FIB