Information Density Cache Strategy in Wireless Ad-Hoc Networks
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2013, Vol 2, Issue 11
Abstract
Data caching strategy for ad hoc networks whose nodes exchange information items in a peer to peer fashion. Data caching is a fully distributes scheme where each node upon receiving request information determines the cache drop time of the information or which content to replace to make room for the newly arrives information. These decisions are made depending on to the perceives “presence” of the content in the nodes proximity whose estimation does not cause any additional overhead to the information sharing system. We devise to strategy where nodes are independent of each other decide whether to cache some content and for how long. In the case of small size 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.
Authors and Affiliations
Bandi Bhaskar, R. Swapna
Keywords
Related Articles
- EP ID EP27756
- DOI -
- Views 281
- Downloads 2
Cloud Removal from Satellite using Cloning Method
Cloud removal approach based on information cloning is introduced. In this methodology it evacuates all cloud sullied segments of a satellite picture and it is then recreates the data which contains taking so as to miss...
Optimal Powersystem Restoration using Neural Network
In this recent trends Power system restoration (PSR) became a challenging topic for the keen researchers. Many people proposes many techniques to solve this problem and overcome the limitations of the existing techn...
A Performance Evaluation of Different Parameter in Wireless LAN Standards using Qualnet
In recent year, wireless local area network have been developed and deployed in many wireless applications. The need for these devices is to communicate with each other effectively when the use of mobile call is incr...
Text Clustering Using Cosine Similarity and Matrix Factorization
Clustering is a useful technique that organizes a large quantity of unordered text documents into a small number of meaningful and coherent clusters, thereby providing a basis for intuitive and informative navigation...
Implementation And Analogy Of Fast Adder Using Fpga
Fast adder is a type of an adder used in digital logic to implement speed by reducing the amount of time required to determine the carry bit. this paper deals with high data rate of implementation of adders on the fie...