Information-centric mobile caching network frameworks and caching optimization: a survey <s> Caching Framework based on wireless ad hoc networks <s> This paper proposes to define a caching service for Web Services in mobile wireless ad-hoc networks. The paper discusses many of the issues that need to be tackled in order to realize such a service, and proposes some solutions, some of which are based on previous experience with distributed object caching. <s> BIB001 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Caching Framework based on wireless ad hoc networks <s> Temporally networks such as mobile Ad hoc networks are constituted with mobile nodes such as laptop, personal digital assistant, Tablets and mobile phones etc. Mobile Ad hoc network between mobile nodes are networks without the need of any fixed substructure. There is a problem in accessibility of data items. Caching of data items can eventually enhance the accessibility of data items in the network. In this paper, we propose an intelligent caching scheme called Dynamic Group Caching which allows grouping of mobile hosts at one hop distance. Head and Group Master will manage the group. By using the proposed Group Caching, the cache memory in nodes can be efficiently utilized and efficiency can be improved. <s> BIB002 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Caching Framework based on wireless ad hoc networks <s> New communication protocols, as WiFi Direct, are now available to enable efficient Device-to-Device (D2D) communications in wireless networks based on portable devices. At the same time, new network paradigms, as Content-Centric-Networking (CCN), allow a communication focused on the content and not its location within the network, enabling a flexible location for the content, which can be cached in the nodes across the network. In such context, we consider a multi-hop wireless network adopting CCN-like cooperative caching, in which each user terminal acts also as a caching node. We propose an interest-based insertion policy for the caching, based on the concept of “social-distance” borrowed by online recommendation systems, to improve the performance of the overall network of caches; the main idea is to store only the contents which appear to be of interest for the local user. We show that our proposed scheme outperforms other well-known insertion policies, that are oblivious of such social-distance, in terms of cache hit probability and access delays. <s> BIB003 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Caching Framework based on wireless ad hoc networks <s> A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. While cooperative caching in the Internet has been studied extensively, cooperative caching in MOSNs is a considerably different and challenging problem due to the probabilistic nature of contact among the mobile users in MOSNs. In order to reduce the total access delay, we let the mobile users cooperatively cache these data items in their limited buffer space. We balance between selfishness (caching the data items according to its own preference) and unselfishness (helping other nodes to cache). The friends with higher contact frequency may share similar interests, hence, caching the data items for friend users can lead to some benefit. In this paper, we present a hierarchical cooperative caching scheme, which divides the buffer space into three components: self, friends, and strangers. In the self component, mobile users cache the data items according to their preference. In the friends component, mobile users help their friends to cache some data items. In the strangers component, mobile users randomly cache the remaining data items. We formally analyze the access delay of the proposed scheme. The effectiveness of our approach is verified through extensive real world trace-driven simulations. <s> BIB004 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Caching Framework based on wireless ad hoc networks <s> Wireless ad hoc networks (WAHNs) consist of autonomous nodes cooperating with each other to transmit/receive data over multiple-hops in the network. Caching is a useful mechanism to leverage this cooperation. Nodes with cached content can satisfy requests from other nodes, thus helping reduce network traffic and energy consumption, and improve latency. With the proliferation of wireless devices on the Internet and the proposal of a future Internet with emphasis on in-network caching, improvements in caching can significantly improve network response while reducing network load. In this paper, we present a holistic caching framework, Split-Cache, which enables a network node to account for the frequency of requests of data items and their presence in the network, and to leverage a split-cache (one part caches popular items and the other caches less popular items) to make caching and cache-eviction decisions. We performed exhaustive simulations to compare Split-Cache with the state-of-the-art: Split-Cache improved the cache request resolution time on an average by 30% (and as high as 72%), and required 15% less average traffic for resolving requests-large savings when considering large number of requests. <s> BIB005 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Caching Framework based on wireless ad hoc networks <s> Recent explosive growth in computing and wireless communication technologies has led to an increasing interest in mobile ad hoc networks (MANET). Among the many challenges for MANET designers and users, data availability is a critical issue. Caching is considered as an effective solution for the availability problem. Although cooperative caching improves the data access by reducing access latency and bandwidth usage in MANETs, it still suffers from several hurdles and technical problems. This paper introduces a new cooperative caching strategy for MANETs, which is called Administrative Cluster-Based Cooperative Caching (ACCC). ACCC keeps at most two copies of the cached data items in each cluster. Moreover, it develops a new administrative module, which perfectly controls the caching process. ACCC is a cluster-based caching strategy, hence, it divides the network into a set of overlapping clusters. Each cluster is managed by a Cluster Manager (CM) as well as a Cluster Backup (CB). ACCC has several salient features that other techniques do not have such as: (i) the integration between CM and CB besides the integration among all the caching modules improves the data availability within the cluster, (ii) ACCC; maximizes the caching hit ratio, reduces access delay, and saves the battery power of network nodes. ACCC is simulated using Java Caching System JCS2 with the efficient platform Java Enterprise Edition EE8 using a client/server model. Experimental results have shown that ACCC outperforms recent cluster-based caching strategies as it introduces higher cache hit ratio as well as better data availability. <s> BIB006
Wireless Ad Hoc Networks (WAHNs) consist of autonomous mobile nodes, these nodes cooperate with each other to exchange information by multiple-hop communication. Although each node has limited transmitting range, some nodes behave as ad-hoc routers and forward information (e.g. requests) from other nodes. Cache can be deployed either on each node or on some selected nodes to leverage cooperation BIB001 . Figure 3 is a typical illustration of caching framework based on WAHNs, in which caching nodes cooperate to cache contents and retrieve requested contents in a multiple-hop fashion. In this section, some research issues are investigated based on information-centric caching frameworks in wireless ad hoc network. A cooperative caching framework for mobile nodes is proposed in BIB004 , in which the buffer storage of each mobile node is divided into three parts: namely self, friends and strangers. Each cache node stores its most frequently accessed data items in the self part. The mobile nodes with higher contact frequency are considered as friends to the cache node. Each cache node helps its friends to store data items according to friends' preference in the friends' part, in addition, the cache node randomly caches a subset of the remaining data items in the strangers' part. In BIB006 , a novel cooperative caching strategy is proposed for mobile ad-hoc networks (MANETs) named Administrative Cluster-Based Cooperative Caching (ACCC). The network is divided into a set of overlapping clusters, and each cluster is managed by a Cluster Manager and a ClusterBackup. In order to improve the reliability of the cooperative caching system, at most two copies of the cached data items in each cluster are kept. In BIB005 , a holistic cooperative-caching mechanism in WAHNs is proposed to reduce average query-solving time and network traffic, and improve query-solving rate considering data request-frequency, presence-index, and cache-splitting (popular and non-popular). In BIB003 , an interest-based cooperative insertion policy is presented in a multi-hop wireless network adopting CCN-like cooperative caching. In a wireless network consisting of a server and several nodes interconnected through a multi-hop linear topology, each node is associated with a unique user, and every user device acts as a caching node and only stores the contents according to the interest. The social relationship among users is quantitated as degree of similarity, and the user interest for a specific content is modeled by degree of interest based on a social space model. In wireless multi-hop networks, content servers are generally located outside a wireless multi-hop network and a user accesses these servers through a gateway node (GW). As popular contents have a tendency to be stored in cache storage, and when a content request encounters cached content on the way to the GW, content download is launched from this encountered node. So wireless cache networks are expected to reduce concentration of content request and content traffic of popular contents around GW. Since caching networks (not only wired network but also wireless network) have a bandwidth limitation along default-path, two solutions are provided to make cached contents not along defaultpath, namely explicit cache coordination and implicit cache coordination. In  , a mechanism guide for cached contents called Breadcrumbs is evaluated in WAHNs as an implicit cache coordination approach. The results show that Breadcrumbs in WAHNs is efficient in leveraging the limitation of cache availability on a default-path in caching network. An intelligent group caching scheme called Dynamic Group Caching is presented which allows grouping of mobile hosts at one hop distance BIB002 , in which Head and Group Master are elected to manage the group.