Capacity Scaling of Wireless Social Networks

In this paper, we investigate capacity scaling laws of wireless social networks under the social-based session formation. We model a wireless social network as a three-layered structure, consisting of the physical layer, social layer, and session layer; and we introduce a cross-layer distance & density-aware model, called the population-based formation model, under which: 1) for each node v
_k
, the number of its friends/followers, denoted by q
_k
, follows a Zipf's distribution with degree clustering exponent g; 2) q
_k
anchor points are independently chosen according to a probability distribution with density function proportional to (E
_k,X
)
^-β
, where E
_k;X
is the expected number of nodes (population) within the distance |v
_k
-X| to v
_k
, and β is the clustering exponent of friendship formation; 3) finally, q
_k
nodes respectively nearest to those q
_k
anchor points are selected as the friends of v
_k
. We present the general density function of social relationship distribution, with general distribution of physical layer, serving as the basis for studying general capacity of wireless social networks. As the first step of addressing this issue, for the homogeneous physical layer, we derive the social-broadcast capacity under both generalized physical and protocol interference models, taking into account general clustering exponents of both friendship degree and friendship formation in a 2-dimensional parameter space, i.e., (γ,β) ϵ[0,∞)
²
. Importantly, we notice that the adopted model with homogenous physical layer does not sufficiently reflect the advantages of the population-based formation model in terms of realistic validity and practicability. Accordingly, we introduce a random network model, called the center-clustering random model (CCRM) with node distribution exponent δ ϵ [0, ∞), highlighting the clustering and inhomogeneity property in real-life networks, and discuss how to further derive more general network capacity over 3-dimensional parameter space (δ,γ,β) ϵ [0, ∞)
³
based on our results over (γ,β) ϵ [0, ∞)
²
.