Related papers: Connectivity Scaling Laws in Wireless Networks
In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of links in the network are independent. In…
The organization in brain networks shows highly modular features with weak inter-modular interaction. The topology of the networks involves emergence of modules and sub-modules at different levels of constitution governed by fractal laws.…
We revisit the cosmological evolution of domain wall networks, taking advantage of recent improvements in computing power. We carry out high-resolution field theory simulations in two, three and four spatial dimensions to study the effects…
Rivers exhibit fractal-like properties that are associated with scaling laws linking geometry and size. The optimal channel network (OCN) model, which is a mathematically tractable representation of river networks often used in theoretical…
In this work we analyze scale-free networks with different power law spectra $N(k) \sim k^{-\gamma}$ under a boolean dynamic, where the boolean rule that each node obeys is a function of its connectivity $k$. This is done by using only two…
This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary…
Spatial networks of land cover are well-described by power law rank-size distributions. Continuous field proxies for human settlements, agriculture and forest cover have similar spatial scaling properties spanning 4 to 5 orders of…
We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…
How many links can be cut before a network is bisected? What is the maximal bandwidth that can be pushed between two nodes of a network? These questions are closely related to network resilience, path choice for multipath routing or…
With millimeter wave bands emerging as a strong candidate for 5G cellular networks, next-generation systems may be in a unique position where spectrum is plentiful. To assess the potential value of this spectrum, this paper derives scaling…
In this study, the concept of small worlds is investigated in the context of large-scale wireless ad hoc and sensor networks. Wireless networks are spatial graphs that are usually much more clustered than random networks and have much…
In order to understand the underlying mechanisms that lead to certain network properties (i.e. scalability, energy efficiency) we apply a complex systems science approach to analyze clustering in Wireless Sensor Networks (WSN). We represent…
It has recently been shown that the expected energy requirements of a control action applied to a complex network scales exponentially with the number of nodes that are targeted. While the exponential scaling law provides an adequate…
A complex network is said to show topological isotropy if the topological structure around a particular node looks the same in all directions of the whole network. Topologically anisotropic networks are those where the local neighborhood…
When data is plentiful, the loss achieved by well-trained neural networks scales as a power-law $L \propto N^{-\alpha}$ in the number of network parameters $N$. This empirical scaling law holds for a wide variety of data modalities, and may…
We consider the problem of covert communication over wireless adhoc networks in which (roughly) $n$ legitimate nodes (LNs) and $n^{\kappa}$ for $0<\kappa<1$ non-communicating warden nodes (WNs) are randomly distributed in a square of unit…
Wavelength determines the length scale of the cross section when electromagnetic waves are scattered by an electrically small object. The cross section diverges for resonant scattering, and diminishes for non-resonant scattering, when…
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse…
We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical…
We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the n sensors in the network is classified into r classes according to some probability distribution {\mu} = {{\mu}_1 , . . .…