Research On Cooperative Caching System In Mobile Ad Hoc Networks

With the continuous development of science and technology,mobile coummunication technology is also increasingly becoming mature.As an infrastructure-less mobile network,mobile Ad Hoc networks are widely used in special areas such as modern battlefields,disaster relief and other infrastructure that can not be erected.Therefore,mang researchers are devoted to the research of mobile Ad Hoc Networks.In mobile Ad Hoc networks,the cooperation between mobile nodes is very important,and one of the common ways to show the coolaboration is cooperative casching.The purpose of cooperative caching is to allow mobile nodes to cache important data that may be needed by other nodes in the future,it is an effective means to improve data access performance.This paper focuses on the cooperative caching techniques in mobile Ad Hoc networks and imporves on and optimizes the traditional cooperative caching techniques.This paper studies the cache discovery strategy based on cooperative area: In the cooperative area,the requesting node first broadcasts the request message by the restricted flooding method.If the neighboring node in the cooperative area does not cache the data items required by the requesting node,the request message is forwarded to the network's data center in a nulti-hop manner.However,this strategy can only increase the cache hit ratio in the request node cooperation area,and does not change the cache hit ratio of the forwarding nodes outside the cooperation area.Therefore,based on the cache discovery strategy based on the cooperative area,we propose the core node.In addition to checking the local cache,the core node can also check the cache directory of the neighboring nodes in the hop range.Simulation results show that the E-COOP cache discovery strategy is superior to the COOP cache discovery strategy in average response delay and average energy consumption performance.This paper studies and analyzes the principle of cooperative cache replacement from the perspective of high efficiency and energy saving,and regards cache replacement as a 0-1 knapsack problem,proposes cache replacement algorithm backpack.When the cache capacity is full,the data items with small cache benefit and larger cache size are preferentially replaced util the remaining space satisfies the size of the new cache data item.The simulation results show that the average energy consumption of ECORP backpack algorithm is lower and the overall performance is better than the traditional cache replacement algorithm.