High performance, low complexity cooperative caching for wireless sensor networks

  • Authors:

  • Nikos Dimokas;Dimitrios Katsaros;Leandros Tassiulas;Yannis Manolopoulos

  • Affiliations:

  • Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Computer & Communication Engineering, University of Thessaly, Volos, Greece;Department of Computer & Communication Engineering, University of Thessaly, Volos, Greece;Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece

  • Venue:
  • Wireless Networks
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

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.