TY - JOUR
TI - On the capacity of fractal D2D social networks with hierarchical communications
AU - Chen, Ying
AU - Li, Rongpeng
AU - Zhao, Zhifeng
AU - Zhang, Honggang
T2 - IEEE Transactions on Mobile Computing
AB - 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 proven that the maximum capacity is $\Theta\left(\frac1\sqrtn\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 $\Theta\left(\frac1\log n\right)$ if any pair of social contacts with distance d communicate according to the probability in proportion to $d^-\beta$, where $\beta$ is the frequency parameter. 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 $\epsilon$ of the fractal structure. The capacity is reduced in proportional to $\frac1\log n$ if $2\lt \epsilon\lt 3$, while the reduction coefficient is $\frac1n$ if $\epsilon\gt 3$.
DA - 2021/06//
PY - 2021
DP - IEEE Xplore
VL - 20
IS - 6
SP - 2254
EP - 2268
J2 - IEEE Trans. Mob. Comput.
UR - https://www.rongpeng.info/files/Paper_2021TMC.pdf
KW - Capacity
KW - Correlation
KW - D2D Social Networks
KW - Device-to-device communication
KW - Fractal Networks
KW - Fractals
KW - Hierarchical Social Communications
KW - Mobile computing
KW - Security
KW - Self-Similarity
KW - Social network services
KW - Wireless networks
ER -