English
Related papers

Related papers: On Capacity Scaling of Underwater Networks: An Inf…

200 papers

Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square, in which both bandwidth and received signal power can be limited significantly. A narrow-band model is assumed where the…

Information Theory · Computer Science 2011-03-29 Won-Yong Shin , Daniel E. Lucani , Muriel Medard , Milica Stojanovic , Vahid Tarokh

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

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

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

The goal of this paper is two-fold. First, to establish a tractable model for the underwater acoustic channel useful for network optimization in terms of convexity. Second, to propose a network coding based lower bound for transmission…

Information Theory · Computer Science 2008-09-02 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

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

n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r^{-alpha}, as well as a random phase. We…

Information Theory · Computer Science 2007-07-13 Ayfer Ozgur , Olivier Leveque , David Tse

In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with $n$ randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the…

Information Theory · Computer Science 2011-10-19 Si-Hyeon Lee , Sae-Young Chung

The theoretic capacity of a communication system constituted of several transmitting/receiving elements is determined by the singular values of its transfer matrix. Results based on an independent identically distributed channel model,…

Mathematical Physics · Physics 2012-09-27 François Bentosela , Eric Soccorsi

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…

Information Theory · Computer Science 2019-07-01 Kang-Hee Cho , Si-Hyeon Lee , Vincent Y. F. Tan

The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission bandwidth depends on the transmission distance, a feature…

Information Theory · Computer Science 2016-11-17 Daniel E. Lucani , Milica Stojanovic , Muriel Médard

The discrepancy between the upper bound on throughput in wireless networks and the throughput scaling in random networks which is also known as the connectivity-throughput trade-off is analyzed. In a random network with $\lambda$ nodes per…

Information Theory · Computer Science 2010-08-23 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of $n$ randomly located wireless nodes. The infrastructure uses multi-antenna base stations (BSs), in which the number of…

Information Theory · Computer Science 2016-11-18 Won-Yong Shin , Sang-Woon Jeon , Natasha Devroye , Mai H. Vu , Sae-Young Chung , Yong H. Lee , Vahid Tarokh

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…

Information Theory · Computer Science 2007-07-13 Rohit Negi , Arjunan Rajeswaran

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 paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes and multihop routing can be increased from the $\Omega({1 \over \sqrt{n} \log n})$ scaling…

Information Theory · Computer Science 2007-10-10 Awlok Josan , Mingyan Liu , David L. Neuhoff , S. Sandeep Pradhan

The availability of very wide spectrum in millimeter wave bands combined with large antenna arrays and ultra dense networks raises two basic questions: What is the true value of overly abundant degrees of freedom and how can networks be…

Information Theory · Computer Science 2020-02-21 Felipe Gómez-Cuba , Elza Erkip , Sundeep Rangan , Francisco J. González-Castaño
‹ Prev 1 2 3 10 Next ›