Journal ArticleDOI
Energy saving strategies for cooperative cache replacement in mobile ad hoc networks
TLDR
Simulations show that the proposed policies can significantly reduce energy consumption and access latency when compared to other replacement policies, and are presented to solve the Energy-efficient COordinated cache Replacement Problem (ECORP) as a 0-1 knapsack problem.About:
This article is published in Pervasive and Mobile Computing.The article was published on 2009-02-01. It has received 14 citations till now. The article focuses on the topics: Cache algorithms & Cache invalidation.read more
Citations
More filters
Journal ArticleDOI
A bio-inspired privacy-preserving framework for healthcare systems
Chandramohan Dhasarathan,Manish Kumar,Atul Kumar Srivastava,Fadi Al-Turjman,Achyut Shankar,Manoj Kumar +5 more
TL;DR: A novel framework for an effective utilization of sharable resources, which are available within the reachable region, is proposed by creating an opportunity to frame an opportunistic computing while preserving the user’s privacy.
Journal ArticleDOI
Analysis and performance study for coordinated hierarchical cache placement strategies
TL;DR: It is proved that the object placement problem can be formulated as an optimization problem, thus optimal solutions can be obtained by using dynamic programming and the calculation cost of the dynamic programming algorithms can be reduced.
Journal ArticleDOI
An adaptive cache invalidation technique for wireless environments
Rajeev Tiwari,Neeraj Kumar +1 more
TL;DR: An adaptive cache invalidation technique (ACIT) is proposed that uses different thresholds update rates for adaptive IR, and BT intervals, and only hot data updates in IR are recorded which results in a less query delay, and bandwidth consumption.
Journal ArticleDOI
Movement prediction based cooperative caching for location dependent information service in mobile ad hoc networks
TL;DR: Simulation results demonstrate that the proposed LDCC strategy significantly outperforms existing caching policies in providing LDIS in mobile ad hoc networks.
Business scenarios, technical challenges and system requirements - D2.1
Ramón Antonio Ferrús Ferré,Oscar Moreno,David Visiedo,Diego Urdiales,Miquel Angel Santiago,Jens Gebert,Christian Mouton,Christian Lange,Vincent Merat,Paul Bender,Andreas Wich,Ramon Agustí Comes,Markus Muck,Andreas Schmmidt,Marios Logothetis,Maria Akezidou,Lia Tzifa,Kostas Tsagkaris,Vera Stavroulaki,Panagiotis Demestichas,Marja Matinmikko,Miia Mustonen,José Oriol Sallent Roig,Jordi Pérez Romero,Andreas Georgakopoulos,Ilija Pecelj,Dragan Boskovic,Milenko Tosic,Marcin Filo,Radoslaw Piesiewicz,Yiouli Kritikou,Aimilia Bantouna,Evangelos Thomatos,Nikos Koutsouris +33 more
TL;DR: This document contains a detailed description of the working scenarios that will be used as a basis for the research to be carried out in OneFIT, and the technical challenges of the project are extracted.
References
More filters
Proceedings ArticleDOI
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Proceedings ArticleDOI
A performance comparison of multi-hop wireless ad hoc network routing protocols
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.
Proceedings ArticleDOI
Web caching and Zipf-like distributions: evidence and implications
TL;DR: This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
Journal ArticleDOI
Summary cache: a scalable wide-area web cache sharing protocol
TL;DR: This paper demonstrates the benefits of cache sharing, measures the overhead of the existing protocols, and proposes a new protocol called "summary cache", which reduces the number of intercache protocol messages, reduces the bandwidth consumption, and eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same cache hit ratios as ICP.