Multicast Capacity of Cache Enabled Content-Centric Wireless Ad Hoc Networks  

作　　者：Guanglin Zhang Jian Liu Jiajie Ren 

机构地区：[1]the Department of Communication Engineering,Donghua University [2]Donghua University [3]the Department of Communication Engineering,College of Information Science and Technology,Donghua University,

出　　处：《China Communications》2017年第7期25-33,共9页中国通信（英文版）

基　　金：supported by the NSF of China under Grant No. 61301118 and No. 71171045; the International S&T Cooperation Program of Shanghai Science and Technology Commission under Grant No.15220710600; the Innovation Program of Shanghai Municipal Education Commission under Grant No.14YZ130; the Fundamental Research Funds for the Central Universities.

摘　　要：In this paper, we investigate the upper bound of multicast capacity for content-centric wireless ad hoc networks with content-centric hierarchical routing strategy. We consider two content-centric hierarchical routing strategies, namely, the homogeneous hierarchical routing strategy where each content is requested and cached with equal probability, and the heterogenous hierarchical routing strategy where each content is cached with different probabilities and the requested contents follow a Zipf content popularity distribution. For the two proposed hierarchical routing strategies, we establish the upper bounds on multicast capacity of content-centric wireless ad hoc networks, respectively. We then discuss how the system parameters, such as the number of nodes n, the number of users p, the cache size C, the probability of cache and the content popularity distribution impact on the muilticast capacity scalings.In this paper, we investigate the upper bound of multicast capacity for content-centric wireless ad hoc networks with content-centric hierarchical routing strategy. We consider two content-centric hierarchical routing strategies, namely, the homogeneous hierarchical routing strategy where each content is requested and cached with equal probability, and the heterogenous hierarchical routing strategy where each content is cached with different probabilities and the requested contents follow a Zipf content popularity distribution. For the two proposed hierarchical routing strategies, we establish the upper bounds on multicast capacity of content-centric wireless ad hoc networks, respectively. We then discuss how the system parameters, such as the number of nodes n, the number of users p, the cache size C, the probability of cache and the content popularity distribution impact on the muilticast capacity scalings.

关 键 词：无线自组织网络 缓存大小 容量 组播 路由策略 基于内容 分层策略 用户数量 

分 类 号：TN929.5[电子电信—通信与信息系统]