中文
相关论文

相关论文: On Capacity Scaling in Arbitrary Wireless Networks

200 篇论文

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…

信息论 · 计算机科学 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

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…

信息论 · 计算机科学 2007-10-10 Awlok Josan , Mingyan Liu , David L. Neuhoff , S. Sandeep Pradhan

The problem of communication among nodes in an \emph{extended network} is considered, where radio power decay and interference are limiting factors. It has been shown previously that, with simple multi-hopping, the achievable total…

网络与互联网体系结构 · 计算机科学 2008-05-26 Sam Vakil , Ben Liang

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…

信息论 · 计算机科学 2007-07-13 Ayfer Ozgur , Olivier Leveque , David Tse

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…

信息论 · 计算机科学 2011-03-29 Won-Yong Shin , Daniel E. Lucani , Muriel Medard , Milica Stojanovic , Vahid Tarokh

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

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…

信息论 · 计算机科学 2007-07-13 Shuchin Aeron , Venkatesh Saligrama

We study the effect of node mobility on the throughput scaling of the covert communication over a wireless adhoc network. It is assumed that $n$ mobile nodes want to communicate each other in a unit disk while keeping the presence of the…

信息论 · 计算机科学 2020-04-22 Hyeon-Seong Im , Si-Hyeon Lee

We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic…

信息论 · 计算机科学 2016-11-18 Won-Yong Shin , Sae-Young Chung , Yong H. Lee

Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information…

信息论 · 计算机科学 2009-08-27 Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia

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…

信息论 · 计算机科学 2011-10-19 Si-Hyeon Lee , Sae-Young Chung

We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to…

网络与互联网体系结构 · 计算机科学 2017-04-25 Milad Mahdian , Edmund Yeh

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…

信息论 · 计算机科学 2019-07-01 Kang-Hee Cho , Si-Hyeon Lee , Vincent Y. F. Tan

We optimize the hierarchical cooperation protocol of Ozgur, Leveque and Tse, which is supposed to yield almost linear scaling of the capacity of a dense wireless network with the number of users $n$. Exploiting recent results on the…

信息论 · 计算机科学 2014-04-28 Song-Nam Hong , Giuseppe Caire

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…

信息论 · 计算机科学 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

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…

信息论 · 计算机科学 2010-05-10 Won-Yong Shin , Daniel E. Lucani , Muriel Medard , Milica Stojanovic , Vahid Tarokh

We study the scaling properties of a georouting scheme in a wireless multi-hop network of $n$ mobile nodes. Our aim is to increase the network capacity quasi linearly with $n$ while keeping the average delay bounded. In our model, mobile…

信息论 · 计算机科学 2011-08-02 Philippe Jacquet , Salman Malik , Bernard Mans , Alonso Silva

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…

信息论 · 计算机科学 2016-11-18 Won-Yong Shin , Sang-Woon Jeon , Natasha Devroye , Mai H. Vu , Sae-Young Chung , Yong H. Lee , Vahid Tarokh

WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…

信息论 · 计算机科学 2009-11-03 Georg Böcherer , Alexandre de Baynast

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…

信息论 · 计算机科学 2010-08-23 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral
‹ 上一页 1 2 3 10 下一页 ›