NDLI: Caching for Non-independent Content: Improving Information Gathering in Constrained Networks

Content Provider	IEEE Xplore Digital Library
Author	Dron, W. Uddin, M. Shiguang Wang Abdelzaher, T. Leung, A. Iyengar, A. Govindan, R. Hancock, J.
Copyright Year	2013
Description	Author affiliation: CS, USC, Los Angeles, CA, USA (Govindan, R.) \|\| BBN Raytheon Technol., Cambridge, MA, USA (Dron, W.; Leung, A.) \|\| CS, Univ. of Illinois, Urbana, IL, USA (Uddin, M.; Shiguang Wang; Abdelzaher, T.) \|\| IBM Res., Yorktown Heights, NY, USA (Iyengar, A.) \|\| Artistech, Fairfax, VA, USA (Hancock, J.)
Abstract	This paper explores the design of in-network caching policies for non-independent spot reporting content. The problem is motivated by autonomous sensor devices, such as soldier mounted cameras, that collect and store correlated data from the physical world. Physical states exhibit correlations in space and in time that need to be considered in caching decisions. Prior work in sensor networks that exploits correlations between content items focused more on efficient data collection, not caching, whereas work on caching mostly assumed that cached objects are independent. In contrast, when cached objects overlap in information content, such as pictures of a scene taken from different vantage points, the utility from storing similar items is sub-additive, motivating a fresh look at content-aware replacement policies. We describe a new caching policy, called diversity caching, that factors in both popularity and non-independence among objects into cache replacement algorithms. In a military environment, such a caching scheme supports a multi-modal information access model. Edge devices collect more data than the terrestrial network can handle, push high priority content directly through the network, and then use delay tolerant store and forward mechanisms to transmit the remaining content upon return to base. In information fusion systems, this provides immediate access to a wide variety of user queried content while remaining within the constraints of the terrestrial network and not relying on more expensive satellite networks. This paper evaluates diversity caching in the context of a disaster response application, where survivors and first responders survey damage and up-load observations into caches that are queried by others. Evaluation shows that diversity caching substantially improves a notion of coverage over previous replacement policies, such as LRU and Intentional Caching.
Sponsorship	IEEE Commun. Soc.
Starting Page	1720
Ending Page	1725
File Size	354219
Page Count	6
File Format	PDF
ISBN	9780769551241
DOI	10.1109/MILCOM.2013.291
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-11-18
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Approximation methods Correlation Data collection Delays Equations Sensors Mobile communication network diversity caching information fusion dtn disruption tolerant networking manet constrained
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A hybrid DTN/MANET communication model for protection of critical energy infrastructure

Toward terminal-to-terminal communication networks: A hybrid MANET and DTN approach

FREAK DTN: Frequency Routing, Encounters And Keenness for DTN

NOMAD A Mobile Ad Hoc and Distruption Tolerant Routing Protocol for Tactical Military Networks

Hierarchical link-state routing in disruption-tolerant networks

Polylogarithmic Store-Carry-Forward Routing using Mobile Nodes

A Proposed Scheme for Epidemic Routing with Active Curing for Opportunistic Networks

An Adaptive Content Sharing Protocol for P2P Mobile Social Networks

1 Opportunistic Information Distribution in Challenged Networks

Caching for Non-independent Content: Improving Information Gathering in Constrained Networks

Similar Documents

A hybrid DTN/MANET communication model for protection of critical energy infrastructure

Toward terminal-to-terminal communication networks: A hybrid MANET and DTN approach

FREAK DTN: Frequency Routing, Encounters And Keenness for DTN

NOMAD A Mobile Ad Hoc and Distruption Tolerant Routing Protocol for Tactical Military Networks

Hierarchical link-state routing in disruption-tolerant networks

Polylogarithmic Store-Carry-Forward Routing using Mobile Nodes

A Proposed Scheme for Epidemic Routing with Active Curing for Opportunistic Networks

An Adaptive Content Sharing Protocol for P2P Mobile Social Networks

1 Opportunistic Information Distribution in Challenged Networks

Caching for Non-independent Content: Improving Information Gathering in Constrained Networks