We address cooperative caching in wireless networks, where the nodes may be mobile and exchange information in a peer-to-peer fashion. We consider both cases of nodes with large and small-sized caches. For large-sized caches, we devise a strategy where nodes, independent of each other, decide whether to cache some content and for how long. In the case of small-sized caches, we aim to design a content replacement strategy that allows nodes to successfully store newly received information while maintaining the good performance of the content distribution system.
Under both conditions, each node takes decisions according to its perception of what nearby users may store in their caches and with the aim of differentiating its own cache content from the other nodes’. The result is the creation of content diversity within the nodes neighborhood so that a requesting user likely finds the desired information nearby. We simulate our caching algorithms in different ad hoc network scenarios and compare them with other caching schemes, showing that our solution succeeds in creating the desired content diversity, thus leading to a resource-efficient information access.
In the caching strategies based on information density estimation in Mobile Ad Hoc Networks (MANET), uses Flooding type Routing protocol, which faces several disadvantages.
It is very wasteful in terms of the networks total bandwidth. While a message may only have one destination it has to be sent to every host. This increases the maximum load placed upon the network.
Messages can also become duplicated in the network further increasing the load on the networks bandwidth as well as requiring an increase in processing complexity to disregard duplicate messages.
A variant of flooding called selective flooding partially addresses these issues by only sending packets to routers in the same direction. In selective flooding the routers don't send every incoming packet on every line but only on those lines which are going approximately in the right direction.
In the proposed system, we address the issue of disadvantages faced in flooding routing protocol, using DSR and AODV protocol. The advantages of our proposed system are:
Efficient caching strategies can be achieved using DSR and AODV protocol. Where our proposed system uses a reactive approach which eliminates the need to periodically flood the network with table update messages which are required in a table-driven approach. In a reactive (on-demand) approach such as this, a route is established only when it is required and hence the need to find routes to all other nodes in the network as required by the table-driven approach is eliminated. The intermediate nodes also utilize the route cache information efficiently to reduce the control overhead.
We simulate and show the node routing between the cells, with all the information such as number of cells, number of hops, time taken etc.
We also show the simulation results of Basic Routing and Secured Routing. Where basic routing, routes between the nodes which are near by or by using the suitable protocol DSR or AODV. Whereas in secured routing, the routing is done through a cluster head, so the data is secured.
- Cooperative Caching Module
- Cache and routing module
- Asymmetric Approach Module
- Cache routing simulation module