Efficient betweenness based content caching and delivery strategy in wireless networks
In this letter, we propose a content caching and delivery strategy to maximize throughput
capacity in cache-enabled wireless networks. To this end, efficient betweenness (EB), which
indicates the ratio of content delivery paths passing through a node, is first defined to
capture the impact of content caching and delivery on network traffic load distribution. Aided
by EB, throughput capacity is shown to be upper bounded by the minimal ratio of successful
delivery probability (SDP) to EB among all nodes. Through effectively matching nodes' EB …
capacity in cache-enabled wireless networks. To this end, efficient betweenness (EB), which
indicates the ratio of content delivery paths passing through a node, is first defined to
capture the impact of content caching and delivery on network traffic load distribution. Aided
by EB, throughput capacity is shown to be upper bounded by the minimal ratio of successful
delivery probability (SDP) to EB among all nodes. Through effectively matching nodes' EB …
In this letter, we propose a content caching and delivery strategy to maximize throughput capacity in cache-enabled wireless networks. To this end, efficient betweenness (EB), which indicates the ratio of content delivery paths passing through a node, is first defined to capture the impact of content caching and delivery on network traffic load distribution. Aided by EB, throughput capacity is shown to be upper bounded by the minimal ratio of successful delivery probability (SDP) to EB among all nodes. Through effectively matching nodes' EB with their SDP, the proposed strategy improves throughput capacity with low computation complexity. Simulation results show that the gap between the proposed strategy and the optimal one (obtained through exhausted search) is kept smaller than 6%.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果