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

Secured Bluetooth Authentication Using Artificial Neural Networks

Authentication in wireless networking is a mechanism to proof identities and avoid masking. The use of wireless devices and technology has made rapid growth in the market. In all such devices, user authentication is...

Implementation and Analysis of Power-constrained contrast enhancement algorithm using a sub-band decomposed MSRA for OLED display

This paper presents a power-constrained contrast enhancement algorithm for organic light-emitting diode display based on multi-scale retinex Algorithm (MSRA). In general, MSR, which is the key component of the propose...

Data Access Scheme to Probabilistically Coordinate Multiple Caching Nodes

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...

Privacy Preserving Audit Of Data Storage In Cloud

Cloud computing is the deliverance of computing as a service rather than a product. It gives shared resources, information to computers, softwares and other devices over a set of connections. Cloud computing is the e...

Novel Approach To Cell-Counting-Based Attack Against Tor

Different low-latency unidentified communication systems such as Tor and Anonymizer have been deliberate to make available anonymity service for users. In order to hide from view the communication of users, most of t...

Download PDF file
  • EP ID EP28358
  • DOI -
  • Views 338
  • 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://europub.co.uk/articles/-A-28358