English
Related papers

Related papers: Capacity of Ultra Wide Band Wireless Ad Hoc Networ…

200 papers

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Most prior work on finding the transmission capacity…

Information Theory · Computer Science 2010-09-09 Rahul Vaze , Kien T. Truong , Steven Weber , Robert W. Heath

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…

Information Theory · Computer Science 2015-03-20 Rahul Vaze

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…

Information Theory · Computer Science 2008-11-24 Vivek P. Mhatre , Catherine P. Rosenberg , Ravi R. Mazumdar

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

As a representative of a complex technological system, so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a…

Disordered Systems and Neural Networks · Physics 2007-05-23 Wolfram Krause , Ingmar Glauche , Rudolf Sollacher , Martin Greiner

The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver…

Information Theory · Computer Science 2007-07-13 Vivek P. Mhatre , Catherine P. Rosenberg

This paper derives the outage probability and transmission capacity of ad hoc wireless networks with nodes employing multiple antenna diversity techniques, for a general class of signal distributions. This analysis allows system performance…

Information Theory · Computer Science 2016-11-15 Andrew M. Hunter , Jeffrey G. Andrews , Steven Weber

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

Widely adopted at home, business places, and hot spots, wireless ad-hoc networks are expected to provide broadband services parallel to their wired counterparts in near future. To address this need, MIMO techniques, which are capable of…

Networking and Internet Architecture · Computer Science 2008-02-26 Jing Ma , Ying Jun Zhang

This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…

Information Theory · Computer Science 2007-08-01 Enrique J. Duarte-Melo , Awlok Josan , Mingyan Liu , David L. Neuhoff , Sandeep Pradhan

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR)…

Information Theory · Computer Science 2008-09-23 Zheng Wang , Shirish Karande , Hamid R. Sadjadpour , J. J. Garcia-Luna-Aceves

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

The transport capacity of a dense ad hoc network with n nodes scales like \sqrt(n). We show that the transport capacity divided by \sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit…

Information Theory · Computer Science 2010-10-11 Radha Krishna Ganti , Martin Haenggi

It is known at a qualitative level that directional antennas can be used to boost the capacity of wireless ad hoc networks. Lacking is a measure to quantify this advantage and to compare directional antennas of different footprint patterns.…

Information Theory · Computer Science 2007-07-13 Jialiang Zhang , Soung Chang Liew

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…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

In this paper, we study how to determine concurrent transmissions and the transmission power level of each link to maximize spectrum efficiency and minimize energy consumption in a wireless ad hoc network. The optimal joint transmission…

Networking and Internet Architecture · Computer Science 2017-06-20 Kamal Rahimi Malekshan , Weihua Zhuang

In this work, we evaluate local capacity of wireless ad hoc networks with several medium access protocols and identify the most optimal protocol. We define local capacity as the average information rate received by a receiver randomly…

Networking and Internet Architecture · Computer Science 2011-11-10 Salman Malik , Philippe Jacquet

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

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
‹ Prev 1 2 3 10 Next ›