Analysis of Dense Ad Hoc Networks with Spatial Diversity

Louie, Raymond H. Y.; Collings, Iain B.; McKay, Matthew R.

doi:10.1109/glocom.2007.241

Cited by 4 publications

(2 citation statements)

References 9 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Early work on characterizing the throughput gains from MIMO in ad hoc networks includes [14]- [17] although these generally primarily employed simulations, while more recently [18]- [20] used tools similar to those used in the paper and developed by the present authors. However, none of these works have characterized the maximum throughput gains achievable with receiver processing only.…”

Section: B Related Workmentioning

confidence: 99%

Multi-Antenna Communication in Ad Hoc Networks: Achieving MIMO Gains with SIMO Transmission

Jindal

Andrews

Weber

2011

IEEE Trans. Commun.

179

196

View full text Add to dashboard Cite

The benefit of multi-antenna receivers is investigated in wireless ad hoc networks, and the main finding is that network throughput can be made to scale linearly with the number of receive antennas n R even if each transmitting node uses only a single antenna. This is in contrast to a large body of prior work in single-user, multiuser, and ad hoc wireless networks that have shown linear scaling is achievable when multiple receive and transmit antennas (i.e., MIMO transmission) are employed, but that throughput increases logarithmically or sublinearly with n R when only a single transmit antenna (i.e., SIMO transmission) is used. The linear gain is achieved by using the receive degrees of freedom to simultaneously suppress interference and increase the power of the desired signal, and exploiting the subsequent performance benefit to increase the density of simultaneous transmissions instead of the transmission rate. This result is proven in the transmission capacity framework, which presumes single-hop transmissions in the presence of randomly located interferers, but it is also illustrated that the result holds under several relaxations of the model, including imperfect channel knowledge, multihop transmission, and regular networks (i.e., interferers are deterministically located on grids). N. Jindal is with the Univ. of Minnesota, J. Andrews is with the Univ. of Texas at Austin, S. Weber is with Drexel Univ. The contact author is N. Jindal, nihar@umn.edu. Preliminary results appeared at ICC 2009 [1]. arXiv:0809.5008v2 [cs.IT]

show abstract

Section: B Related Workmentioning

confidence: 99%

Multi-Antenna Communication in Ad Hoc Networks: Achieving MIMO Gains with SIMO Transmission

Jindal

Andrews

Weber

2011

IEEE Trans. Commun.

179

196

View full text Add to dashboard Cite

show abstract

“…This approach has allowed closed-form derivation of outage probability as well as the maximum allowable transmission density at a specified outage probability and data rate, the latter of which we have termed the transmission capacity [13], [14], [15]. The analytical tractability of this approach (using tools from stochastic geometry [16], [17]) has to date allowed quantitative design tradeoffs for spread spectrum [13], [18], [19], interference cancellation [20], [21], multiple-antenna architectures [22], [23], [24], [25], cognitive radio and capacity overlays [26], [27], [28] and power control [14], [29].…”

Section: A Motivation and Related Workmentioning

confidence: 99%

Random access transport capacity

Andrews

Weber

Kountouris

et al. 2010

IEEE Trans. Wireless Commun.

104

View full text Add to dashboard Cite

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 average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants as well. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability. I. INTRODUCTIONDetermining the capacity of distributed wireless networks (i.e., ad hoc networks) is one of the most general and challenging open problems in information theory. Straightforward applications of known information theoretic tools and inequalities becomes intractable almost immediately and have hence yielded little in the way of results. This motivates the exploration of approaches to describing ad hoc network throughput that, while falling short of strict information theory upper bound standards, do provide insight into the fundamental trends on achievable throughput.

show abstract

Multihop Virtual MIMO Systems With Channel Reuse in a Poisson Field of Nodes

Buratti

Zanella

2011

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Analysis of Dense Ad Hoc Networks with Spatial Diversity

Cited by 4 publications

References 9 publications

Multi-Antenna Communication in Ad Hoc Networks: Achieving MIMO Gains with SIMO Transmission

Multi-Antenna Communication in Ad Hoc Networks: Achieving MIMO Gains with SIMO Transmission

Random access transport capacity

Multihop Virtual MIMO Systems With Channel Reuse in a Poisson Field of Nodes

Contact Info

Product

Resources

About