Scaling of critical connectivity of mobile ad hoc communication networks
arXiv:0806.2351 · doi:10.1103/PhysRevE.78.066107
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 as a function of occupancy of sites in the lattice by mobile nodes. Critical phenomena of the connectivity for different transmission ranges 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 , where , is the length unit of the triangular lattice and is the scaling index in the universal function . The model serves as a sort of site percolation on dynamic complex networks relative to geometric distance. Moreover, near each critical corresponding to certain transmission range , there exists a cut-off degree 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.
arXiv comment6 pages, 6 figures
References in corpus (22)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Assortative mixing in networks
- Dynamical and correlation properties of the Internet
- Scaling and percolation in the small-world network model
- Statistical Analysis of Airport Network of China
- Core-periphery organization of complex networks
- Accurately modeling the Internet topology
- Percolation and Epidemic Thresholds in Clustered Networks
- Exact solution of site and bond percolation on small-world networks
- A system of mobile agents to model social networks
- Continuum percolation of wireless ad hoc communication networks
- Scale-Free and Stable Structures in Complex {\em Ad hoc} networks
- Exploring Complex Networks through Random Walks
- Geographical Coarsegraining of Complex Networks
- Scaling in directed dynamical small-world networks with random responses
- Giant Clusters in Random Ad Hoc Networks
- Crossovers in ScaleFree Networks on Geographical Space
- Networks based on collisions among mobile agents
- Geographical networks evolving with optimal policy
- Multiple Scale-Free Structures in Complex Ad-Hoc Networks
- The process of coevolutionary competitive exclusion: speciation, multifractality and power-laws in correlation