Energy-aware Web caching for mobile terminals

Sailhan, Françoise; Issarny, Valérie

doi:10.1109/icdcsw.2002.1030869

Cited by 29 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Figures 7,8,9,10,11,and 12 show the performance comparison of the protocols for a sensornet with 100 nodes, while Figs. 13,14,15,16,17, and 18 for a sensornet with 500 nodes. The Figs.…”

Section: Discussionmentioning

confidence: 99%

“…Still, the long chain of resolution stages (about 6) jeopardizes the worst-case performance of the protocol. The flooding technique is also used in [14], where flooding is limited by imposing a threshold on the route existence probability. As a query packet is forwarded through a multi-hop communication path, its route existence probability decreases.…”

Section: Cooperative Data Caching In Wsnsmentioning

confidence: 99%

“…A number of data replication schemes [12,13] and caching schemes [5,14] have been proposed in order to facilitate data access in mobile ad hoc networks (MANETs). Hara [12,13] proposed a number of replica allocation techniques to increase data accessibility in MANETs.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

High performance, low complexity cooperative caching for wireless sensor networks

2010

View full text Add to dashboard Cite

During the last decade, Wireless Sensor Networks have emerged and matured at such point that they currently support several applications such as environment control, intelligent buildings, target tracking in battlefields. The vast majority of these applications require an optimization to the communication among the sensors so as to serve data in short latency and with minimal energy consumption. Cooperative data caching has been proposed as an effective and efficient technique to achieve these goals concurrently. The essence of these protocols is the selection of the sensor nodes which will take special roles in running the caching and request forwarding decisions. This article introduces two new metrics to aid in the selection of such nodes. Based on these metrics, we propose two new cooperative caching protocols, PCICC and scaPCICC, which are compared against the state-of-the-art competing protocol, namely NICoCa. The proposed solutions are evaluated extensively in an advanced simulation environment and the results confirm that the proposed caching mechanisms prevail over its competitor. The evaluation attests also that the best policy is always scaPCICC, achieving the shortest latency and the least number of transmitted messages.

show abstract

“…Figures 7,8,9,10,11,and 12 show the performance comparison of the protocols for a sensornet with 100 nodes, while Figs. 13,14,15,16,17, and 18 for a sensornet with 500 nodes. The Figs.…”

Section: Discussionmentioning

confidence: 99%

Section: Cooperative Data Caching In Wsnsmentioning

confidence: 99%

See 1 more Smart Citation

High performance, low complexity cooperative caching for wireless sensor networks

2010

View full text Add to dashboard Cite

show abstract

“…Client-side caches [17] maintain copies of previously retrieved content on mobile devices in case it is requested again or required during offline operation. Maintaining large clientside caches, however, is infeasible due to the limited memory and storage resources of mobile devices.…”

Section: B Reducing Mobile Network Contentionmentioning

confidence: 99%

Edge Reduce: Eliminating Mobile Network Traffic Using Application-Specific Edge Proxies

Pamboris

Pietzuch

2015

2015 2nd ACM International Conference on Mobile Software Engineering and Systems

View full text Add to dashboard Cite

Abstract-Mobile carriers are struggling to cope with the surge in smartphone traffic, which reflects badly on end users who often experience poor connectivity in densely populated urban environments. Data transfers between mobile client applications and their Internet backend services contribute significantly to the contention in radio access networks (RANs). Client applications, however, typically transfer unnecessary data because (i) backend service APIs do not support a fine-grained specification of the data actually required by clients and (ii) clients aggressively prefetch data that is never used.We describe EDGEREDUCE, an automated approach for reducing the data transmitted from backend services to a mobile device. Based on source-level program analysis, EDGEREDUCE generates application-specific proxies for mobile client applications that execute part of the application logic at the network edge to filter data returned by backend API calls and only send used data to the client. EDGEREDUCE also permits the tuning of aggressive prefetching strategies: proxies replace large prefetched objects such as images by futures, whose access by the client triggers the retrieval of the object on-demand. We show that EDGEREDUCE reduces the RAN traffic for real-world iOS client applications by up to 8×, with only a modest increase in response time.

show abstract

“…However, ad hoc routing protocols may conveniently be exploited to access a file that is not available in a group in the absence of a base station, which prevents accessing the file's home server. A base solution to this issue is presented in [20] for the specific case of Web data, which can be easily adapted to the context of ADHOCFS. Finally, we are going to experiment the use of ADHOCFS with various types of mobile terminals (e.g., iPAQ), which is quite direct given the availability of Linux for embedded platforms.…”

Section: Discussionmentioning

confidence: 99%