High performance, low complexity cooperative caching for wireless sensor networks

Abstract

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.

Fog Node Cooperation Level Caching

“…N. Dimokaset. al [12,17], have given different aims which are necessary to be optimized such as energy consumption, access latency, number of replica of data items to be placed at different locations. Disadvantage of strategy is that node importance (NI) calculates neighborhood of a particular node.…”

Push-pull cache consistency mechanism for cooperative caching in mobile ad hoc environments

“…Caching the same data within nearby neighbors might lead to wastage of cache space since available memory is limited in compact wireless devices when compared to devices like personal computers and other sophisticated machines. Hence, as in [18], only selected nodes are destined to cache data.…”

Optimizing event coverage in theme parks

“…Mobility has significant effects on the performance of these networks and brings new research challenges for the existing problems such as data collection [3] and dissemination [4], relay node placement [5], [6], [7] path planning [8], latency [9], [10], lifetime maximization [11], [12], [13], [14], routing [15], [16], [17], [18] and security [19].…”