...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on mobile computing >On the Capacity of Fractal D2D Social Networks with Hierarchical Communications
【24h】

On the Capacity of Fractal D2D Social Networks with Hierarchical Communications

机译：论分层通信的分形D2D社交网络的能力

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The maximum capacity of fractal D2D (device-to-device) social networks with both direct and hierarchical communications is studied in this paper. Specifically, the fractal networks are characterized by the direct social connection and the self-similarity. First, for a fractal D2D social network with direct social communications, it is proved that the maximum capacity is Theta(1/root n log n) if a user communicates with one of his/her direct contacts randomly, where n denotes the total number of users in the network, and it can reachup to Theta(1/log n) if any pair of social contacts with distance d communicate according to the probability in proportion to d(-beta). Second, since users might get in touch with others without direct social connections through the inter-connected multiple users, the fractal D2D social network with these hierarchical communications is studied as well, and the related capacity is further derived. Our results show that this capacity is mainly affected by the correlation exponent epsilon of the fractal structure. The capacity is reduced in proportional to 1/log n if 2 < epsilon < 3, while the reduction coefficient is 1/n if epsilon > 3.
机译：本文研究了分形D2D（设备到设备）社交网络的最大容量和直接和分层通信。具体地，分形网络的特点是直接社会连接和自我相似性。首先，对于具有直接社交通信的分形D2D社交网络，事实证明，如果用户随机地与他/她的一个直接联系人通信，则最大容量是θ（1 / root n log n），其中n表示总数网络中的用户，如果任何带距离D的社交触点根据与D（-beta）成比例的概率通信的任何社交触点，则可以达到Theta（1 / log n）。其次，由于用户可能通过连接的多个用户无直接社交连接与他人联系，因此还研究了具有这些分层通信的分形D2D社交网络，并且进一步推导出相关的容量。我们的研究结果表明，这种能力主要受分形结构的相关指数ε的影响。如果2

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号