Optimal storage allocation on throwboxes in Mobile Social Networks

Optimal storage allocation on throwboxes in Mobile Social Networks
复制标题

DOI:
10.1016/j.comnet.2015.08.015
复制
发表时间:
2015-11
期刊:
Comput. Networks
影响因子:
--
通讯作者:
Bo Fan;S. Leng;Kun Yang;Yan Zhang
Bo Fan;S. Leng;Kun Yang;Yan Zhang
中科院分区:
其他
文献类型:
--
作者:
Bo Fan;S. Leng;Kun Yang;Yan Zhang

文献摘要

被引文献

相似文献

在移动的社交网络(MSN)的背景下,一种被称为throwbox的无线存储设备已经作为提高数据传递效率的有前景的方式出现。最近的研究集中在部署投掷箱,以最大限度地提高数据交付的机会。然而,作为一种存储设备,投掷盒的存储使用很少被现有的工作。本文将投放箱的存储分配问题分解为两个具体问题进行研究:(1)投放箱固定在特定位置时,如何分配存储;(2)投放箱可部署时,如何结合投放箱部署进行存储分配。提出了两个优化模型来计算最优的存储分配与用户的接触历史的知识。基于真实的踪迹的模拟表明,所提出的方案不仅能够减少投掷盒上的数据丢失,而且还能够提高数据传递的效率。
In the context of Mobile Social Networks (MSNs), a type of wireless storage device called throwbox has emerged as a promising way to improve the efficiency of data delivery. Recent studies focus on the deployment of throwboxes to maximize data delivery opportunities. However, as a storage device, the storage usage of throwboxes has seldom been addressed by existing work. In this paper, the storage allocation of throwboxes is studied as two specific problems: (1) if throwboxes are fixed at particular places, how to allocate storage to the throwboxes; and (2) if throwboxes are deployable, how to conduct storage allocation in combination with throwbox deployment. Two optimization models are proposed to calculate the optimal storage allocation with a knowledge of the contact history of users. Real trace based simulations demonstrate that the proposed scheme is able to not only decrease data loss on throwboxes but also improve the efficiency of data delivery.