Related papers: Scale-Free Opportunistic Networks: is it Possible?
Opportunistic networking is one way to realize pervasive applications while placing little demand on network infrastructure, especially for operating in less well connected environments. In contrast to the ubiquitous network access model…
We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment…
We study a recently introduced class of scale-free networks showing a high clustering coefficient and non-trivial connectivity correlations. We find that the connectivity probability distribution strongly depends on the fine details of the…
In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in…
In this paper we propose and evaluate an innovative algorithm that enables the creation of Peer-to-Peer network overlays characterized by emergent multi-hubs. This approach generates overlays that balance between the randomness of a graph…
We investigate the searchability of complex systems in terms of their interconnectedness. Associating searchability with the number and size of branch points along the paths between the nodes, we find that scale-free networks are relatively…
We present a novel type of weighted scale-free network model, in which the weight grows independently of the attachment of new nodes. The evolution of this network is thus determined not only by the preferential attachment of new nodes to…
Many real-world complex networks simultaneously exhibit topological features of scale-free behaviour and hierarchical organization. In this regard, deterministic scale-free [A.-L. Barab\'asi \etal, Physica A, 299, 3 (2001)] and…
The structure of real-world networks is usually difficult to characterize owing to the variation of topological scales, the nondyadic complex interactions, and the fluctuations in the network. We aim to address these problems by introducing…
The topology of an instant messaging system is described. Statistical measures of the network are given and compared with the statistics of a comparable random graph. The scale-free character of the network is examined and implications are…
In this paper we study mobile ad hoc wireless networks using the notion of evolving connectivity graphs. In such systems, the connectivity changes over time due to the intermittent contacts of mobile terminals. In particular, we are…
Wireless multi-hop ad hoc communication networks represent an infrastructure-less and self-organized generalization of todays wireless cellular networks. Connectivity within such a network is an important issue. Continuum percolation and…
Preferential attachment --- by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree --- has become the standard growth model for scale-free networks, where the asymptotic probability of a node…
The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to…
We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious.…
What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is…
This paper deals with throughput scaling laws for random ad-hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio, $\rho(n)$ of achievable network sum capacity to the sum of the point-to-point…
In this study, we performed comprehensive morphological investigations of the spontaneous formations of effective network structures among elements in coupled logistic maps, specifically with a delayed connection change. Our proposed model…
We present an algorithm to grow a graph with scale-free structure of {\it in-} and {\it out-links} and variable wiring diagram in the class of the world-wide Web. We then explore the graph by intentional random walks using local…
Opportunistic computing is a paradigm for completely self-organised pervasive networks. Instead of relying only on fixed infrastructures as the cloud, users' devices act as service providers for each other. They use pairwise contacts to…