相关论文: On the Capacity of Fractal Wireless Networks With …
We address a fundamental question in wireless networks that, surprisingly, has not been studied before: what is the maximum density of concurrently active links that satisfy a certain outage constraint? We call this quantity the spatial…
In this Rapid Communication we investigate spatially constrained networks that realize optimal synchronization properties. After arguing that spatial constraints can be imposed by limiting the amount of `wire' available to connect nodes…
One of the most fundamental problems in wireless networks is to achieve high throughput. Fractional Connected Dominating Set (FCDS) Packings can achieve a throughput of ${\Theta}(k/\log n)$ messages for networks with node connectivity $k$,…
Directed links -- representing asymmetric social ties or interactions (e.g., "follower-followee") -- arise naturally in many social networks and other complex networks, giving rise to directed graphs (or digraphs) as basic topological…
In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission…
We study the origin of scale invariance (SI) of the degree distribution in scale-free (SF) networks with a degree exponent $\gamma$ under coarse graining. A varying number of vertices belonging to a community or a box in a fractal analysis…
We study the optimal transmission scheme that maximizes the local capacity in two-dimensional (2D) wireless networks. Local capacity is defined as the average information rate received by a node randomly located in the network. Using…
One key challenge in designing resilient large-scale wireless ad hoc networks is to understand how random node failures affect fundamental network performance. In this work, we show that both network capacity and delay scale as…
Human social behavior is organized in stratified, hierarchical networks, with a support group with about 5 members, expanding proportionally at each layer up to a maximum of approximately 150 frequent interactions per individual. This is…
The functional features of spatial networks depend upon a non-trivial relationship between the topological and physical structure. Here, we explore that relationship for spatial networks with radial symmetry and disordered fractal…
We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k) ~ k^(-gamma), we show that the load is l(k) ~ k^eta with eta = gamma - 1,…
Transmission capacity of an ad hoc wireless network is analyzed when each node of the network harvests energy from nature, e.g. solar, wind, vibration etc. Transmission capacity is the maximum allowable density of nodes, satisfying a per…
We show a near optimal direct-sum theorem for the two-party randomized communication complexity. Let $f\subseteq X \times Y\times Z$ be a relation, $\varepsilon> 0$ and $k$ be an integer. We show,…
We study the transmission capacities of two coexisting wireless networks (a primary network vs. a secondary network) that operate in the same geographic region and share the same spectrum. We define transmission capacity as the product…
We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise…
We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…
Project networks are characterized by power law degree distributions, a property that is known to promote spreading. In contrast, the longest path length of project networks scales algebraically with the network size, which improves the…
Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…