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.
Highlights
One of the most important ICN (Information-centric Network) Architectures is CCN (Content-Centric Networking)
fullydistributed congestion control (FDCC) algorithm is implemented for monitoring queue value and the rate at which the packets are reaching the router can be monitored by using the cooperative and memory-efficient token bucket (CMTB) algorithm
In this screen it can observe that the selected router is 4 and the face router is3. In this below screen it can see that the network topology is formed which consists of nodes, routers and servers. It can view the consumer node as 20. the data will be transmitted from the source node to the selected router whenever the queue value is reached the buffer threshold value congestion will occur
Summary
One of the most important ICN (Information-centric Network) Architectures is CCN (Content-Centric Networking). If the queue value is greater than the queue threshold value the congested node will inform the source node to reduce the data rate and it will inform the downstream node to handle this traffic By using this it can reduce the packet drop which causes the congestion.In the existing system, with the help of the selected router the data is transmitted from the source node to destination node. Whenever the queue value limit reached the buffer threshold value the selected router will become congested and received data packets are assigned to the router to handle this data traffic. In the existing system security is less even though the data drop is less and packet delay is less In this proposed system has used the FDCC and CMTB algorithms are used to monitor the queue value and to monitor the data transfer rate. The packet drop can be identified by the analysis of the simulation trace file
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
