CONTENT CENTRIC NETWORKING ALGORITHM TO AVOID PACKET LOSS

摘要

Rapid developments in the mobile technology have transformed mobile phones into multimedia devices. Due to these advancements, user created mobile content is on the increase, both in terms of quality and quantity. In addition, content sharing is getting popular in home networks as well as in social community networks. To keep pace with such a movements the new networking topology named as content centric networking (CCN) optimized for content sharing has appeared. Due to mobility of intermediate nodes, connection between two remote nodes fails frequently bringing packet loss problem. Packet loss cause communication delay, throughput degradation and congestion and may even make the network unusable. This project proposes a new CCN scheme with packet loss avoidance built into it The proposed scheme here addresses two mobility possibilities that cause packet loss: an intermediate node moving away from its initial location in this case packet loss is avoided by using the alternative path and broadcast, and movement of destination node in this case the destination node will receive the broadcasted data packet from the nearby node as the data is cached by the nodes in the broadcast. To further reduce the packet loss and delay in CCN, this work contributes the stable route path route selection. As the stable route is considered in path selection, the proposed system take smaller average delay and high packet delivery ratio than the existing system due to the node broadcast the packets to find path towards the content server. This algorithm is implemented over the MANET network and simulated using Network Simulator (NS2). Performance of the proposed system evaluated based on the parameters such as round trip time, packet delivery ratio and cache hit ratio and delay.