Skip to main content

Advertisement

SpringerLink
Log in

Cooperative Caching in Wireless Multimedia Sensor Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

The recent advances in miniaturization and the creation of low-power circuits, combined with small-sized batteries have made the development of wireless sensor networks a working reality. Lately, the production of cheap complementary metal-oxide semiconductor cameras and microphones, which are able to capture rich multimedia content, gave birth to what is called Wireless Multimedia Sensor Networks (WMSNs). WMSNs will boost the capabilities of current wireless sensor networks, and will fuel several novel applications, like multimedia surveillance sensor networks. WMSNs introduce several new research challenges, mainly related to mechanisms to deliver application-level Quality-of-Service (e.g., latency minimization). To address this goal in an environment with extreme resource constraints, with variable channel capacity and with requirements for multimedia in-network processing, the caching of multimedia data, exploiting the cooperation among sensor nodes is vital. This article presents a cooperative caching solution particularly suitable for WMSNs. The proposed caching solution exploits sensor nodes which reside in “positions” of the network that allow them to forward packets or communicate decisions within short latency. These so-called “mediator” nodes are selected dynamically, so as to avoid the creation of hot-spots in the communication and the depletion of their energy. The mediators are not more powerful than the rest of the nodes, but they have some special role in implementing the cooperation among the sensors. The proposed cooperative caching protocol includes components for locating cached data as well as for implementing data purging out of the sensor caches. The proposed solution is evaluated extensively in an advanced simulation environment, and it is compared to the state-of-the-art cooperative caching algorithm for mobile ad hoc networks. The results confirm that the proposed caching mechanism prevails over its competitor.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17
Figure 18
Figure 19
Figure 20

Similar content being viewed by others

Notes

  1. http://www.xbow.com.

  2. The latency is measured in seconds, which does not corresponds to the usual time metric, but to internal simulator clock.

References

  1. Akyildiz I, Melodia T, Chowdhury KR (2007) A survey of wireless multimedia sensor networks. Comput Netw 51(4):921–960

    Article  Google Scholar 

  2. Akyildiz I, Su W, Sankarasubramaniam Y, Cayirci E (2002) A survey of wireless sensor networks. IEEE Commun Mag 40(8):102–116

    Article  Google Scholar 

  3. Basagni S, Mastrogiovanni M, Panconesi A, Petrioli C (2006) Localized protocols for ad hoc clustering and backbone formation: a performance comparison. IEEE Trans Parallel Distrib Syst 17(4):292–306

    Article  Google Scholar 

  4. Chand N, Joshi RCRC, Misra M (2006) A zone co-operation approach for efficient caching in mobile ad hoc networks. Int J Commun Syst 19:1009–1028

    Article  Google Scholar 

  5. Chand N, Joshi RCRC, Misra M (2007) Cooperative caching strategy in mobile ad hoc networks based on clusters. Wirel Pers Commun 43(1):41–63

    Article  MathSciNet  Google Scholar 

  6. Che H, Tung Y, Wang Z (2002) Hierarchical web caching systems: modeling, desing and experimental results. IEEE J Sel Areas Commun 20(7):1305–1314

    Article  Google Scholar 

  7. Chow, C. -Y., Leong, H. V. & Chan, A. T. S (2004). Cache signatures for peer-to-peer cooperative caching in mobile environments. In, Proceedings of the IEEE i nternational conference on a dvanced information n etworking and applications (AINA ), vol 1 (pp. 96–101). Piscataway: IEEE.

    Chapter  Google Scholar 

  8. Chow C-Y, Leong HV, Chan ATS (2004) Peer-to-peer cooperative caching in mobile environments. In: Proceedings of the IEEE international conference on distributed computing systems workshops (ICDCSW). IEEE, Piscataway, pp 528–533

    Google Scholar 

  9. Chow C-Y, Leong HV, Chan ATS (2007) GroCoca: group-based peer-to-peer cooperative caching in mobile environment. IEEE J Sel Areas Commun 25(1):179–191

    Article  Google Scholar 

  10. Diao Y, Ganesan D, Mathur G, Shenoy P (2007) Rethinking data management for storage-centric sensor networks. In: Proceedings of the conference on innovative data systems research (CIDR). Asilomar, 7–10 January 2007, pp 22–31

  11. Eisenberg Y, Luna CE, Pappas TN, Berry R, Katsaggelos AK (2002) Joint source coding and transmission power management for energy efficient wireless video communications. IEEE Trans Circuits Syst Video Technol 12(6):411–424

    Article  Google Scholar 

  12. Fan L, Cao P, Almeida AZ, Broder JM (2000) Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans Netw 8(3):281–293

    Article  Google Scholar 

  13. Gandhi R, Parthasarathy S (2004) Fast distributed well connected dominating sets for ad hoc networks. Computer Science Department, University of Maryland at College Park, Tech. Rep. CS-TR-4559

  14. Girod B, Kalman M, Liang YJ, Zhang R (2002) Advances in channel-adaptive video streaming. Wirel Commun Mob Comput 2(6):573–584

    Article  Google Scholar 

  15. Hara T (2003) Replica allocation methods in ad hoc networks with data update. ACM/Kluwer Mob Netw Appl 8(4):343–354

    Article  MathSciNet  Google Scholar 

  16. Hara T, Madria SK (2006) Data replication for improving data accessibility in ad hoc networks. IEEE Trans Mob Comput 5(11):1515–1532

    Article  Google Scholar 

  17. Huang GT (2003) Casting the wireless sensor net. Technol Rev 106:51–56

    Google Scholar 

  18. Karl H, Willig A (2006) Protocols and architectures for wireless sensor networks. Wiley, New York

    Google Scholar 

  19. Katsaros D, Manolopoulos Y (2004) Caching in web memory hierarchies. In: Proceedings of the ACM symposium on applied computing. Cyprus, 14–17 March 2004, pp 1109–1113

  20. Katsaros D, Manolopoulos Y (2004) Web caching in broadcast mobile wireless environments. IEEE Internet Comput 8(3):37–45

    Article  Google Scholar 

  21. Katsaros D, Manolopoulos Y (2006) The geodesic broadcast scheme for wireless ad hoc networks. In: Proceedings of the IEEE international symposium on world of wireless, mobile multimedia (WoWMoM). IEEE, Piscataway, pp 571–575

    Chapter  Google Scholar 

  22. Kulkarni P, Ganesan D, Shenoy P, Lu Q (2005) SensEye: a multi-tier camera sensor network. In: Proceedings of the ACM international conference on multimedia (MM). Singapore, 6–11 November 2005, pp 229–238

  23. Mathur G, Desnoyers P, Ganesan D, Shenoy P (2006) Ultra-low power data storage for sensor networks. In: Proceedings of the ACM international conference on information processing in sensor networks (IPSN). Nashville, 19–21 April 2006, pp 374–381

  24. Megiddo N, Modha DS (2003) ARC: a self-tuning, low overhead replacement cache. In: Proceedings of the USENIX conference on file and storage technologies (FAST). San Francisco, 31 March–2 April 2003, pp 115–130

  25. Nath S, Kansal A (2007) FlashDB: dynamic self-tuning database for NAND flash. In: Proceedings of the ACM international conference on information processing in sensor networks (IPSN). Cambridge, 25–27 April 2007, pp 410–419

  26. Papadopouli M, Schulzrinne H (2001) Effects of power conservation, wireless coverage and cooperation on data environments. In: Proceedings of ACM symposium on mobile ad hoc networking and computing (MOBIHOC). Long Beach, 4–5 October 2001, pp 117–127

  27. Perkins CE, Royer E (1999) Ad hoc on-demand distance vector routing. In: Proceedings of the IEEE workshop on mobile computing systems and applications. IEEE, Piscataway, pp 90–100

    Google Scholar 

  28. Prabh KS, Abdelzaher TF (2005) Energy-conserving data cache placement in sensor networks. ACM Trans Sensor Netw 1(2):178–203

    Article  Google Scholar 

  29. Rahimi M, Baer R, Iroezi OI, Garcia JC, Warrior J, Estrin D, Srivastava M (2005) Cyclops: in situ image sensing and interpretation in wireless sensor networks. In: Proceedings of the ACM international conference on embedded networked sensor systems (SenSys). San Diego, 2–4 November 2005, pp 192–204

  30. Rousskov A, Wessels D (1998) Cache digests. Comput Netw ISDN Syst 30(22–23):2155–2168

    Article  Google Scholar 

  31. Sailhan F, Issarny V (2002) Energy-aware web caching for mobile terminals. In: Proceedings of the IEEE international conference on distributed computing systems workshops (ICDCSW). IEEE, Piscataway, pp 820–825

  32. Sailhan F, Issarny V (2003) Cooperative caching in ad hoc networks. In: Proceedings of the IEEE international conference on mobile data management (MDM). IEEE, Piscataway, pp 13–28

    Google Scholar 

  33. Shen H, Das SK, Kumar M, Wang Z (2004) Cooperative caching with optimal radius in hybrid wireless networks. In: Proceedings of the international IFIP-TC6 networking conference (NETWORKING), ser. Lecture Notes on Computer Science, vol 3042. Athens, 9–14 May 2004, pp 841–853

  34. Sobeih A, Hou JC, Kung L-C, Li N, Zhang H, Chen W-P, Tyan H-Y, Lim H (2006) J-Sim: a simulation and emulation environment for wireless sensor networks. IEEE Wireless Commun Mag 13(4):104–119

    Article  Google Scholar 

  35. Takaaki M, Aida H (2003) Cache data access system in ad hoc networks. In: Proceedings of the IEEE spring semiannual vehicular technology conference (VTC), vol 2. IEEE, Piscataway, pp 1228–1232

    Chapter  Google Scholar 

  36. Tang B, Das S, Gupta H (2005) Cache placement in sensor networks under update cost constraint. In: Proceedings of the (ADHOC-NOW), ser. Lecture Notes on Computer Science, vol 3738. Springer, Heidelberg, pp 334–348

    Google Scholar 

  37. Wessels D, Claffy K (1998) ICP and the Squid Web cache. IEEE J Sel Areas Commun 16(3):345–357

    Article  Google Scholar 

  38. Yin L, Cao G (2006) Supporting cooperative caching in ad hoc networks. IEEE Trans Mob Comput 5(1):77–89

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Aristotle University, Thessaloniki, Greece

    Nikos Dimokas & Yannis Manolopoulos

  2. Department of Computer & Communication Engineering, University of Thessaly, Volos, Greece

    Dimitrios Katsaros

Authors
  1. Nikos Dimokas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitrios Katsaros
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yannis Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dimitrios Katsaros.

Additional information

Research supported by a Γ.Γ.E.T. grant in the context of the project “Data Management in Mobile Ad Hoc Networks” funded by ΠYΘAΓOPAΣ II national research program.

Appendix

Appendix

The NICoCa cooperative caching protocol

// d i : data item i, i ∈ [1 ...1000]

// request(d i ): Request for data item i

// N i : Node i

// FS: Free cache space

// RE: Remaining energy

// PCT: Proximity Cache Table

// ipacket: An index packet that contains d i ’s id, FS and RE

(A) Cache Discovery Algorithm

if( d i is in local cache of requester node ) then

      send ipacket to CHs;

      return;

if( requester node is CH and d i ’s id in PCT ) then

      select caching node with largest RE;

      send request(d i ) to caching node;

else

      requester node sends request(d i ) to CHs;

when CHs answers or time elapsed

if( caching nodes found ) then

      select caching node with largest RE;

      send request(d i ) to caching node;

else

      send request(d i ) to data center;

when N i receives request(d i )

if( N i has a valid copy ) then

      send d i to requester node;

else if( N i is CH and d i ’s id in PCT ) then

      select caching node with largest RE;

      redirect request(d i ) to caching node;

else

      forward request(d i ) to caching node;

(B) Replacement Policy

while( current node has not enough FS )

      Select a valid d i with largest value and store it temporary;

      Send to CHs d i ’s id;

      Remove the valid d i ;

when a CH gets d i ’s id

if( CH gets d i ’s id and d i ’s id not in PCT ) then

      select caching node with largest RE and FS;

send answer to requester node;

when current node get answers from CHs

foreach( temporary stored d i )

      if( there is no other caching node ) then

            Select caching node with least RE and largest FS;

            Send d i to new caching node;

      Remove temporary stored d i ;

(C) Cache Admission Policy

when the packet with d i obtained from current node

if( current node is packet’s destination ) then

      if( there is enough FS ) then

            cache d i ;

            send ipacket to CHs;

      else

            call Replacement Policy ;

when CH gets an ipacket

if( CH get ipacket ) then

            store d i ’s id, RE and FS in PCT;

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dimokas, N., Katsaros, D. & Manolopoulos, Y. Cooperative Caching in Wireless Multimedia Sensor Networks. Mobile Netw Appl 13, 337–356 (2008). https://doi.org/10.1007/s11036-008-0063-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-008-0063-3

Keywords

Search

Navigation