Secure Routing Packet Transmission With Dynamic Topologies

When a text file is transmitting from source node to destination node in the form of packets, sometimes there is a chance of missing last-packet or some packets fail to reach their destination. This problem arises due to the interruption occurred in the network, but these interruptions in the network causes inconvenience to the end-users. In order to overcome this problem, we are implementing a system using Starvation Free Back Pressure (SF-BP) Algorithm which avoids the starvation of packets at the destination and also maximizes the network throughput. This can be achieved by generating the frequencies to each and every node. By using these frequencies, the path will be selected for the data transmission. This ensures that each and every packet is transmitted safe and securely without any interruptions in the network. K. S. N. S Akhila | K. Raviteja | M. Sai Balaram Chowdary | B. Rachana Choudary | P. V Hari Prasad"Secure Routing Packet Transmission With Dynamic Topologies" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11328.pdf http://www.ijtsrd.com/computer-science/computer-network/11328/secure-routing-packet-transmission-with-dynamic-topologies/k-s-n-s-akhila