모바일 네트워크에서 MDS 부호화된 캐시를 활용한 이득 연구

Abstract

We study the delay performance in a content-centric mobile ad hoc network, where each node moves according to the reshuffling model and generate content’s requests according to the Zipf popularity distribution. In particular, we consider the scenario that each content object cannot be entirely transmitted in one time slot due to the big file size and fast mobility. In this case, we assume that each content object is divided into multiple subpackets, each of which has the same size. The subpackets are then stored in the cache of mobile nodes using either the uncoded or maximum distance separable (MDS)-coded caching strategies. We perform the performance comparison between the uncoded and MDS-coded caching strategies by identifying the regimes in which the performance difference between the two caching strategies becomes prominent with respect to system parameters such as the number of subpackets and the Zipf exponent.he scenario that each content object cannot be entirely transmitted in one time slot due to the big file size and fast mobility. In this case, we assume that each content object is divided into multiple subpackets, each of which has the same size. The subpackets are then stored in the cache of mobile nodes using either the uncoded or maximum distance separable (MDS)-coded caching strategies. We perform the performance comparison between the uncoded and MDS-coded caching strategies by identifying the regimes in which the performance difference between the two caching strategies becomes prominent with respect to system parameters such as the number of subpackets and the Zipf exponent.