Cache consistency in Wireless Multimedia Sensor Networks

Dimokas, Nikos; Katsaros, Dimitrios; Manolopoulos, Yannis

doi:10.1016/j.adhoc.2009.08.001

Cited by 18 publications

(8 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There is no noticeable difference in the performance of the Figs. 13(b), 14(b)), which is expected since the cooperation scheme is the major factor that affects the performance, and not the routing scheme; a similar observation was also made in a companion paper [8] which concerned cooperative cache consistency.…”

Section: Discussionmentioning

confidence: 55%

“…The latency is measured in seconds. 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.…”

Section: Discussionmentioning

confidence: 99%

“…Still these techniques have no relation to the traditional concept of cooperative caching that we address here. Finally, the recent work reported in [19] addresses problems of cooperative caching in sensornets, but the proposed protocols tightly integrate consistency policies, which fall beyond the scope of this article (the interested reader can read a companion paper [8]). …”

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

Section: Discussionmentioning

confidence: 55%

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

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

“…These solutions thus jointly address cache replacement and consistency, whereas in this paper, we specifically target the former issue. However, as will be pointed out, Hamlet can easily be coupled with a dedicated cache consistency scheme, e.g., [19] and [20].…”

Section: Caching With Limited Storage Capabilitymentioning

confidence: 99%

“…We note, however, that the previous version of this paper [24] jointly evaluated Hamlet with a basic scheme for weak cache consistency based on an epidemic diffusion of an updated cache content and we showed that weak consistency can be reached, even with such a simple approach, with latencies on the order of minutes for large networks. If prompter solutions are sought, Hamlet lends itself to be easily integrated with one of the existing consistency solutions found in the literature (e.g., [19], [20], [25], and [26]). In particular, these works propose push, pull, or hybrid approaches to achieve different levels of cache consistency.…”

Section: System Outline and Assumptionsmentioning

confidence: 99%

Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks

Fiore

Casetti

Chiasserini

2011

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-We address cooperative caching in wireless networks, where the nodes may be mobile and exchange information in a peer-to-peer fashion. We consider both cases of nodes with largeand small-sized caches. For large-sized caches, we devise a strategy where nodes, independent of each other, decide whether to cache some content and for how long. In the case of small-sized 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. Under both conditions, each node takes decisions according to its perception of what nearby users may store in their caches and with the aim of differentiating its own cache content from the other nodes'. The result is the creation of content diversity within the nodes neighborhood so that a requesting user likely finds the desired information nearby. We simulate our caching algorithms in different ad hoc network scenarios and compare them with other caching schemes, showing that our solution succeeds in creating the desired content diversity, thus leading to a resource-efficient information access.Index Terms-Data caching, mobile ad hoc networks.

show abstract