English
Related papers

Related papers: Connectivity Scaling Laws in Wireless Networks

200 papers

An intuitive overview of the scalability of a variety of types of wireless networks is presented. Simple heuris- tic arguments are demonstrated here for scaling laws presented in other works, as well as for conditions not previously…

Information Theory · Computer Science 2016-11-26 Linda Zeger , Muriel Médard

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

Capacity scaling of a large hybrid network with unit node density, consisting of $n$ wireless ad hoc nodes, base stations (BSs) equipped with multiple antennas, and one remote central processor (RCP), is analyzed when wired backhaul links…

Information Theory · Computer Science 2014-07-29 Cheol Jeong , Won-Yong Shin

Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we…

Information Theory · Computer Science 2010-05-10 Won-Yong Shin , Daniel E. Lucani , Muriel Medard , Milica Stojanovic , Vahid Tarokh

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad A. Maddah-Ali , Amir K. Khandani

How does the shape of a network change as its size increases? Although random graph models provide some expectations for such "scaling behaviors" in the structure of networks, relatively little is known about how empirical network structure…

Social and Information Networks · Computer Science 2026-03-24 Upasana Dutta , Alexander Ray , Aaron Clauset

Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This…

Disordered Systems and Neural Networks · Physics 2015-06-25 Albert-Laszlo Barabasi , Reka Albert

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai

Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…

Physics and Society · Physics 2009-11-13 Lazaros K. Gallos , Chaoming Song , Hernan A. Makse

The performance of a language model has been shown to be effectively modeled as a power-law in its parameter count. Here we study the scaling behaviors of Routing Networks: architectures that conditionally use only a subset of their…

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

In this paper, we develop an innovative approach to quantitatively characterize the performance of ultra-dense wireless networks in a plethora of propagation environments. The proposed framework has the potential of significantly…

Signal Processing · Electrical Eng. & Systems 2020-07-15 Imene Trigui , Sofiene Affes , Marco Di Renzo , Dushantha Nalin K. Jayakody

With the analysis of the hierarchical scheme, the potential influence of the pre-constant in deriving scaling laws is exposed. It is found that a modified hierarchical scheme can achieve a throughput arbitrarily times higher than the…

Information Theory · Computer Science 2009-09-29 Liang-Liang Xie

In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes--bandwidth- and power-limited--have proven indispensable in the design of good communication schemes. In this paper, we propose a…

Information Theory · Computer Science 2009-09-29 Ayfer Ozgur , Ramesh Johari , David Tse , Olivier Leveque

In this paper, we study the probability that a dense network confined within a given geometry is fully connected. We employ a cluster expansion approach often used in statistical physics to analyze the effects that the boundaries of the…

Networking and Internet Architecture · Computer Science 2012-01-20 Justin P. Coon , Carl P. Dettmann , Orestis Georgiou

The topology of the network of load transmitting connections plays an essential role in the cascading failure dynamics of complex systems driven by the redistribution of load after local breakdown events. In particular, as the network…

Disordered Systems and Neural Networks · Physics 2023-11-21 G. Pál , Zs. Danku , A. Batool , V. Kádár , N. Yoshioka , N. Ito , G. Ódor , F. Kun

This paper presents results on the typical number of simultaneous point-to-point transmissions above a minimum rate that can be sustained in a network with $n$ transmitter-receiver node pairs when all transmitting nodes can potentially…

Information Theory · Computer Science 2014-12-10 Hengameh Keshavarz , Ravi R. Mazumdar , Rahul Roy , Farshid Zoghalchi

The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. Signals transmitted from one user to another over a distance $l$ are subject to a power…

Information Theory · Computer Science 2009-03-26 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

Performance of standard processes over large distributed networks typically scales with the size of the network. For example, in planar topologies where nodes communicate with their natural neighbors, the scaling factor is $O(n)$, where $n$…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-02-18 Abhinav Mishra

Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we…

Statistical Mechanics · Physics 2012-03-08 Luis A. Nunes Amaral , Antonio Scala , Marc Barthelemy , H. Eugene Stanley
‹ Prev 1 2 3 10 Next ›