Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On improving the performance of cache invalidation in mobile environments
Mobile Networks and Applications
Proactive Power-Aware Cache Management for Mobile Computing Systems
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Most of the researcher worked on routing protocol in mobile ad hoc network but very less work has been done in data access. Caching in frequently accessed data in multi hop environment can improve the availability and performance of the network. However designing efficient distributed caching technique is not an easy task because of the movement of nodes. Connected dominating set is a frequently used approach, where the searching space is reduced. A set is called dominating if all the nodes are either in the neighbors or are in the connection set. In this paper we have proposed a scheme in which we used connected domination set node to store the cache data. We have used two pre-existing techniques. These techniques either cache the data or cache the path. We have proposed a caching technique which uses connected dominating set. Simulation results that illustrate the validity of this approach are presented and dependence of performance gain on the network parameter is analyzed.