scholarly journals Resource-Aware Cooperative Caching on Mobile Ad-hoc Peer to Peer Networks

2021 ◽  
Author(s):  
Hoda R.K. Nejad
Keyword(s):  
Ad Hoc Networks ◽  
Overlay Networks ◽  
Ad Hoc ◽  
Data Access ◽  
Peer To Peer ◽  
Data Availability ◽  
Cooperative Caching ◽  
P2p Systems ◽  
Hoc Networks ◽  
Resource Aware

With the emergence of wireless devices, service delivery for ad-hoc networks has started to attract a lot of attention recently. Ad-hoc networks provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad-hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. On the other hand, data access applications in Ad-hoc networks suffer from restricted resources. In this thesis, we explore how to use Cooperative Caching to improve data access efficiency in Ad-hoc network. We propose a Resource-Aware Cooperative Caching P2P system (RACC) for data access applications in Ad-hoc networks. The objective is to improve data availability by considering energy of each node, demand and supply of network. We evaluated and compared the performance of RACC with Simple Cache, CachePath and CacheData schemes. Our simulation results show that RACC improves the lay of query as well as energy usage of the network as compared to Simple Cache, CachePath and CacheData.

scholarly journals Resource-Aware Cooperative Caching on Mobile Ad-hoc Peer to Peer Networks

2021 ◽  
Author(s):  
Hoda R.K. Nejad
Keyword(s):  
Ad Hoc Networks ◽  
Overlay Networks ◽  
Ad Hoc ◽  
Data Access ◽  
Peer To Peer ◽  
Data Availability ◽  
Cooperative Caching ◽  
P2p Systems ◽  
Hoc Networks ◽  
Resource Aware

With the emergence of wireless devices, service delivery for ad-hoc networks has started to attract a lot of attention recently. Ad-hoc networks provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad-hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. On the other hand, data access applications in Ad-hoc networks suffer from restricted resources. In this thesis, we explore how to use Cooperative Caching to improve data access efficiency in Ad-hoc network. We propose a Resource-Aware Cooperative Caching P2P system (RACC) for data access applications in Ad-hoc networks. The objective is to improve data availability by considering energy of each node, demand and supply of network. We evaluated and compared the performance of RACC with Simple Cache, CachePath and CacheData schemes. Our simulation results show that RACC improves the lay of query as well as energy usage of the network as compared to Simple Cache, CachePath and CacheData.

scholarly journals Cross-Layer System for Cluster Based Data Access in MANET’S

2013 ◽  
pp. 175-180
Author(s):  
Anand Nayyar
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Data Access ◽  
High Energy ◽  
Data Availability ◽  
Cross Layer ◽  
Cooperative Caching ◽  
Mobile Ad Hoc ◽  
Hoc Networks

The objective of cooperative caching is to improve data availability, improve access efficiency and reduce query delay in mobile Ad-Hoc networks. Many types of cache replacement algorithms like LRU, LFU, LFRU, LRU-MIN and LFU-MIN are used to improve data accessibility and reduce query delay in cluster based cooperative caching in Mobile Ad-Hoc networks. But they have some limitations such as accessing remote information station via multi hop communication leads to longer query latency and causes high energy consumption, many clients frequently access the database server they cause a high load on the server and reduce the server response time .Multi hop communication causes the network capacity degrades when network partition occurs. The Research Paper gives an overview of Cooperative Cache Management Techniques and caching policies and propose a new algorithm can be regarded as a LRFU-MIN (least recently frequently used information with minimal number of page replacements). It discover a data source which induces less communication cost of moving cache blocks into the most recently frequently used position and minimizes caching duplications between neighbour nodes. In this paper we utilize a cross-layer design approach to improve the performance of combined cooperative caching and prefetching schemes. The paper examines the performance using NS-2 simulation environments. The proposed LRFU-MIN enhances the performance of cross-layer cluster based cooperative caching in mobile Ad- Hoc networks when compared with LRU and LFU-MIN.

scholarly journals Cooperative Caching in Mobile Ad Hoc Networks Based on Data Utility

2007 ◽  
Vol 3 (1) ◽  
pp. 19-37 ◽  
Author(s):  
Narottam Chand ◽  
R. C. Joshi ◽  
Manoj Misra
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Data Access ◽  
Data Availability ◽  
Replacement Policy ◽  
Cache Management ◽  
Cooperative Caching ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV), to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC), is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.

scholarly journals Resource-Aware Topology Adaptation in P2P Overlay Adhoc Network

2021 ◽  
Author(s):  
Gabriel Lau
Keyword(s):  
Overlay Networks ◽  
Ad Hoc ◽  
Wireless Devices ◽  
P2p Systems ◽  
Adhoc Network ◽  
Hoc Networks ◽  
P2p System ◽  
Resource Aware ◽  
Topology Adaptation ◽  
Application Execution

With the emergence of wireless devices, service delivery for mobile as hoc networks (MANET) has started to attract a lot of attention recently. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. We propose a P2P system for MANET, RAON, which performs query forwarding and overlay topology adaptation based on link instability and power constraints. We evaluated and compared the performance of RAON with an existing P2P system, Gia. Our simulation results show that RAON improves the success rate and delay of query search as compared to Gia. It, however, achieves this at the expense of higher energy consumption.

Cooperative Caching in Mobile Ad Hoc Networks

2012 ◽  
pp. 255-270
Author(s):  
Naveen Chauhan ◽  
Lalit K. Awasthi ◽  
Narottam Chand ◽  
Ramesh C. Joshi ◽  
Manoj Misra
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Data Availability ◽  
Cooperative Caching ◽  
Wired Networks ◽  
Fundamental Limitations ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc network (MANET) presents a constrained communication environment due to fundamental limitations of client’s resources, insufficient wireless bandwidth and users’ frequent mobility. MANETs have many distinct characteristics which distinguish them from other wireless networks. Due to frequent network disconnection, data availability is lower than traditional wired networks. Cooperative caching helps MANETs in alleviating the situation of non availability of data. In this paper, the authors present a scheme called global cluster cooperation (GCC) for caching in mobile ad hoc networks. In this scheme, network topology is partitioned into non-overlapping clusters based on the physical network proximity. This approach fully exploits the pull mechanism to facilitate cache sharing in a MANET. Simulation experiments show that GCC mechanism achieves significant improvements in cache hit ratio and average query latency in comparison with other caching strategies.

Cooperative Caching in Mobile Ad Hoc Networks

2011 ◽  
Vol 3 (3) ◽  
pp. 20-35 ◽  
Author(s):  
Naveen Chauhan ◽  
Lalit K. Awasthi ◽  
Narottam Chand ◽  
R.C. Joshi ◽  
Manoj Misra
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Data Availability ◽  
Cooperative Caching ◽  
Wired Networks ◽  
Global Cluster ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc network (MANET) presents a constrained communication environment due to fundamental limitations of client’s resources, insufficient wireless bandwidth and users’ frequent mobility. MANETs have many distinct characteristics which distinguish them from other wireless networks. Due to frequent network disconnection, data availability is lower than traditional wired networks. Cooperative caching helps MANETs in alleviating the situation of non availability of data. In this paper, the authors present a scheme called global cluster cooperation (GCC) for caching in mobile ad hoc networks. In this scheme, network topology is partitioned into non-overlapping clusters based on the physical network proximity. This approach fully exploits the pull mechanism to facilitate cache sharing in a MANET. Simulation experiments show that GCC mechanism achieves significant improvements in cache hit ratio and average query latency in comparison with other caching strategies.

A Detailed Survey and Comparative Study of Cooperative Caching Methods for Mobile Ad Hoc Networks

2019 ◽  
Vol 9 (3) ◽  
pp. 314-329
Author(s):  
Devendra Kumar Jain ◽  
Sanjay Sharma ◽  
Shashank Yadav ◽  
Jitendra Singh
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Research Work ◽  
Data Availability ◽  
Future Research ◽  
Cooperative Caching ◽  
Caching Scheme ◽  
Mobile Ad Hoc ◽  
Hoc Networks

: Mobile Ad Hoc Networks (MANETs) are networks that enable server and clients to impart without any settled foundation. MANET is a quickly developing region of research as it discovers use in different applications. In MANETs, network parceling and the fizzling of a mobile node because of weariness of their battery power can significantly diminish data accessibility. Data caching on the client is generally observed as a successful answer for enhancing data availability. Specifically, cooperative caching based on information sharing and coordination of cached data item among numerous clients is much time-consuming. Various cooperative caching plans have been proposed in the ongoing years. This paper examines the highlights for outlining a good cooperative cache management, and it overviews the current cooperative caching scheme. The paper likewise gives a correlation of the cooperative caching scheme and examines open doors for future research work.

scholarly journals An analysis of structured and unstructured P2P systems over MANET

2021 ◽  
Author(s):  
Cristian Negulescu
Keyword(s):  
Ad Hoc ◽  
Mobile Network ◽  
Overlay Network ◽  
Peer To Peer ◽  
P2p Systems ◽  
P2p File Sharing ◽  
Peer Network ◽  
Hoc Networks ◽  
P2p System ◽  
Resource Aware

Peer-to-peer or P2P file-sharing application on wireless ad hoc mobile network (MANET) has gained a lot of interest in the recent years. A peer-to-peer network is an overlay network that is deployed over ad hoc networks. Our work is analyzing two P2P systems over MANET. The systems evaluated are representing two distinct categories in terms of network topology such as unstructured and structured architectures. RAON or Resource-Aware Overlay Network, which is an improvement of an existent P2P system called Gia, is an unstructured system. CAN or Content-Addressable Network is an existent P2P system in the category of structured architectures. Based on the simulations of the two P2P systems over MANET, we evaluated the performance in terms of query search success rate and query search delay.

scholarly journals Resource-Aware Topology Adaptation in P2P Overlay Adhoc Network

2021 ◽  
Author(s):  
Gabriel Lau
Keyword(s):  
Overlay Networks ◽  
Ad Hoc ◽  
Wireless Devices ◽  
P2p Systems ◽  
Adhoc Network ◽  
Hoc Networks ◽  
P2p System ◽  
Resource Aware ◽  
Topology Adaptation ◽  
Application Execution

With the emergence of wireless devices, service delivery for mobile as hoc networks (MANET) has started to attract a lot of attention recently. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. We propose a P2P system for MANET, RAON, which performs query forwarding and overlay topology adaptation based on link instability and power constraints. We evaluated and compared the performance of RAON with an existing P2P system, Gia. Our simulation results show that RAON improves the success rate and delay of query search as compared to Gia. It, however, achieves this at the expense of higher energy consumption.

Sign in / Sign up

Export Citation Format

Share Document