论文标题

关于分形D2D社交网络的能力,具有分层通信

On the Capacity of Fractal D2D Social Networks with Hierarchical Communications

论文作者

Chen, Ying, Li, Rongpeng, Zhao, Zhifeng, Zhang, Honggang

论文摘要

本文研究了具有直接和分层通信的分形D2D(设备对设备)社交网络的最大容量。具体而言,分形网络的特征是直接的社会联系和自相似性。 Firstly, for a fractal D2D social network with direct social communications, it is proved that the maximum capacity is $ Θ\left(\frac{1}{\sqrt{n\log n}}\right) $ 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 reach up to $ θ\ left(\ frac {1} {\ log n} \ right)$,如果任何与距离$ d $的社交联系人根据概率按$ d^{ - β} $成比例的概率进行通信。其次,由于用户可能通过相互连接的多个用户与其他人保持联系,因此也研究了具有这些层次通信的分形D2D社交网络,并进一步得出了相关能力。我们的结果表明,这种能力主要受分形结构的相关指数$ε$的影响。如果$ 2 <ε<3 $,则容量与$ \ frac {1} {\ log n} $成正比,而还原系数为$ \ frac {1} {n} {n} $如果$ε> 3 $。

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. Firstly, for a fractal D2D social network with direct social communications, it is proved that the maximum capacity is $ Θ\left(\frac{1}{\sqrt{n\log n}}\right) $ 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 reach up to $ Θ\left(\frac{1}{\log n}\right) $ if any pair of social contacts with distance $ d $ communicate according to the probability in proportion to $ d^{-β} $. Secondly, 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 $ε$ of the fractal structure. The capacity is reduced in proportional to $ \frac{1}{\log n} $ if $ 2<ε<3 $, while the reduction coefficient is $ \frac{1}{n} $ if $ ε>3 $.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源