ABSTRACT:

We have a tendency to address cooperative caching in wireless networks, where the nodes could be mobile and exchange info in a peer-to-peer fashion. We contemplate both cases of nodes with large- and little-sized caches. For giant-sized caches, we devise a method where nodes, independent of each different, decide whether to cache some content and for the way long. Within the case of small-sized caches, we tend to aim to design a content replacement strategy that allows nodes to successfully store newly received data while maintaining the good performance of the content distribution system. Under each conditions, each node takes decisions in step with its perception of what nearby users could store in their caches and with the aim of differentiating its own cache content from the opposite nodes'. The result is the creation of content diversity within the nodes neighborhood so that a requesting user possible finds the required info nearby. We simulate our caching algorithms in different unexpected network scenarios and compare them with other caching schemes, showing that our resolution succeeds in making the desired content diversity, thus resulting in a resource-economical information access.