Scaling of critical connectivity of mobile ad hoc communication networks

Abstract

In this paper, critical global connectivity of mobile ad hoc communication networks (MAHCN) is investigated. We model the two-dimensional plane on which nodes move randomly with a triangular lattice. Demanding the best communication of the network, we account the global connectivity $\eta$ as a function of occupancy $\sigma$ of sites in the lattice by mobile nodes. Critical phenomena of the connectivity for different transmission ranges $r$ are revealed by numerical simulations, and these results fit well to the analysis based on the assumption of homogeneous mixing . Scaling behavior of the connectivity is found as $\eta \sim f(R^{\beta }\sigma )$, where $R=(r-r_0)/r_0$, $r_0$ is the length unit of the triangular lattice and $\beta$ is the scaling index in the universal function $f(x)$. The model serves as a sort of site percolation on dynamic complex networks relative to geometric distance. Moreover, near each critical ${\sigma }_c(r)$ corresponding to certain transmission range $r$, there exists a cut-off degree $k_c$ below which the clustering coefficient of such self-organized networks keeps a constant while the averaged nearest neighbor degree exhibits a unique linear variation with the degree k, which may be useful to the designation of real MAHCN.

6 pages, 6 figures

References in corpus (8)

• Core-periphery organization of complex networks
• Percolation and Epidemic Thresholds in Clustered Networks
• A system of mobile agents to model social networks
• Continuum percolation of wireless ad hoc communication networks
• Exploring Complex Networks through Random Walks
• Geographical Coarsegraining of Complex Networks
• Geographical networks evolving with optimal policy
• The process of coevolutionary competitive exclusion: speciation, multifractality and power-laws in correlation

Cited by in corpus (1)

• Scaling relations and finite-size scaling in gravitationally correlated lattice percolation models