Data Access Scheme to Probabilistically Coordinate Multiple Caching Nodes

Abstract

The propose of caching strategy in wireless ad hoc networks benefits from the supposition of existing endto-end paths in the midst of mobile nodes, and the path from a supplicant to the data source remnants unchanged all through data access in most cases. Such supposition enables any in-between node on the path to cache the pass-by data. The success of such a secondary caching strategy is dangerously impaired in DTNs, which do not presuppose any persistent network connectivity. Given that data are forwarded via opportunistic contacts, the question and replied data may take different routes, and it is complicated for nodes to collect the information about query times gone by and make caching conclusion.

Authors and Affiliations

K. Chandra Rao, B. Srinivas

Keywords

Related Articles

Empowering Document Clustering Through Multi View-Point Based Similarity Measure

Among data mining technique, clustering is one of the most important and traditional concept also an unsupervised learning paradigm. Similarity of a document pairs can be measured by matching of concepts. Finding or...

Cloud Computing Security With Two-Level Mechanism

The recent success of cloud services and its ever increasing popularity are not unknown to anyone and neither are the security threats which persist in parallel with its growth. Countermeasures have been introduced t...

Rank-Ordered Statistic based different Median Filters for eliminating Impulse Noise in Images

Eliminating of impulse noise from images without losing their features is an important requirement in image processing applications. The standard median filter is a good nonlinear filter for eliminating impulse noise;...

An Algorithmic Framework In Order To Deal With Efficient Resource Allocation In Overlay Routing

Overlay routing has been projected in latest years as an effectual way to attain convinced routing properties devoid of leaving into the extended and monotonous procedure of consistency and worldwide exploitation of...

Extended Public Key Cryptosystem and Aggregate Key for Secure data Sharing In Cloud

Information sharing is a basic usefulness in cloud storage. We exhibit how to immovably, powerfully, and straight forwardly impart information to others in cloud storage. Cryptographic frameworks are more versatile a...

Download PDF file
  • EP ID EP28358
  • DOI -
  • Views 361
  • Downloads 5

How To Cite

K. Chandra Rao, B. Srinivas (2015). Data Access Scheme to Probabilistically Coordinate Multiple Caching Nodes. International Journal of Research in Computer and Communication Technology, 4(12), -. https://www.europub.co.uk/articles/-A-28358