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

Nearest Neighbour Search Using Spatial Inverted Index

Spatial queries incorporate reach pursuit and closest neighbour recovery gives result to inquiry issued clients in light of articles like restaurant, hospitals and hotels. But rising applications including new sort o...

Adaptive Contention & Slot Reservation Based MAC protocol

The IEEE 802.16 standard is the basic protocol for data communication in the upstream channel in wireless sensor network. Also the reservation based medium access control MAC protocol is adopted by the IEEE 802.16 st...

Integrated Data Mining Approach for Security Alert System

The need for automatic detection of deceptive Emails is increasing due to the rapid usage of Email communication in the Internet world. The proposed “Security Alert System” provides a way to identify the future terro...

Intelligent Ambulance Rescue System

Traffic problems, congested traffic and flow management were recognized as major problems mostly in all the areas, which have caused problem for the ambulance which carries the emergency patient. Moreover road accide...

A Novel Image Classification System Based on Evidence Probabilistic Transformation

This paper uses the evidence probabilistic transformation (EPT) for unsupervised image retrieval framework. The main advantages with EPT are substantially resolves the "take-them-or-leave-them" problem, gives a firme...

Download PDF file
  • EP ID EP28358
  • DOI -
  • Views 362
  • 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