### Citations

12407 |
Elements of Information Theory
- Cover, Thomas
- 1991
(Show Context)
Citation Context ...alytically intractable, hence we need to use an iterative algorithm to find optimal γ, at each step γ is increased if ∑N n=1 Dn < D, or decreased if ∑N n=1Dn > D, similar to the Waterfilling solution =-=[19]-=-. For equidistant hops dn = d/N , q̂d := q̂dn ∀ n, the optimal γ = ln(q̂d) exp ( ln(q̂d)(D+N) N ) 1−exp ( ln(q̂d)(D+N) N ) , and D?n = DN ,∀ n if D is a multiple of N . APPENDIX F Using dn = d/N, ∀ n,... |

794 |
An Introduction to the Theory of Point Processes
- Daley, Vere-Jones
- 1998
(Show Context)
Citation Context ... interfering nodes for Rtm is Φ m t := {Φt\T tm}, where Φt := {T tk, k ∈ N}. Using the Slivnyak’s Theorem, the stationarity of the PPP, and the random translation invariance property of the PPP [17], =-=[18]-=-, the locations of interferers of Φmt are distributed as a PPP with intensity λ0, ∀ t,m [10]. We consider a slotted ALOHA like random access protocol, where each transmitter (source or any relay) atte... |

225 | An Aloha protocol for multihop mobile wireless networks.
- Baccelli, Blaszczyszyn, et al.
- 2006
(Show Context)
Citation Context ...INTRODUCTION The transmission capacity of an ad hoc network is the maximum allowable density of transmitting nodes, satisfying a per transmitter receiver rate, and outage probability constraints [1]– =-=[4]-=-. The transmission capacity is computed under the assumption that the transmitter locations are distributed as a Poisson point process (PPP) using tools from stochastic geometry [1]–[4]. The transmiss... |

189 | Veciana. Transmission capacity of wireless ad hoc networks with successive interference cancellation
- Weber, Andrews, et al.
- 2007
(Show Context)
Citation Context ... 2I. INTRODUCTION The transmission capacity of an ad hoc network is the maximum allowable density of transmitting nodes, satisfying a per transmitter receiver rate, and outage probability constraints =-=[1]-=-– [4]. The transmission capacity is computed under the assumption that the transmitter locations are distributed as a Poisson point process (PPP) using tools from stochastic geometry [1]–[4]. The tran... |

93 |
On distances in uniformly random networks,”
- Haenggi
- 2005
(Show Context)
Citation Context ...ut-delay-reliability (T-DR) tradeoff. Some other related papers on multi-hop networks include [11]–[13], where [11] computes the optimal number of hops that minimize the end-to-end delay, while [13], =-=[14]-=- derive the optimal number of hops in a line network with no interference. The analysis carried out in [10] assumes D → ∞, and independent packet success/failure events across time slots. The second a... |

70 | Routing in Ad Hoc networks: a case for long hops,” - Haenggi, Puccinelli - 2005 |

66 | Bandwidth- and power-efficient routing in linear wireless networks,”
- Sikora, Laneman, et al.
- 2006
(Show Context)
Citation Context ...lay-reliability (D-R) tradeoff, while the transmission capacity expression characterizes the throughput-delay-reliability (T-DR) tradeoff. Some other related papers on multi-hop networks include [11]–=-=[13]-=-, where [11] computes the optimal number of hops that minimize the end-to-end delay, while [13], [14] derive the optimal number of hops in a line network with no interference. The analysis carried out... |

39 | Transmission capacity of ad-hoc networks with multiple antennas using transmit stream adaptation and interference cancellation‟ Information Theory, - Vaze, Heath - 2012 |

39 |
Spatial and temporal correlation of the interference in ALOHA ad hoc networks
- Ganti, Haenggi
- 2009
(Show Context)
Citation Context ...[10] assumes D → ∞, and independent packet success/failure events across time slots. The second assumption can only be justified for very low density of transmitters, and does not hold true otherwise =-=[15]-=-. The result of [10] is useful in determining the optimal number of hops that maximize an upper bound on the transmission capacity with no retransmissions constraint, however, does not characterize th... |

33 | Spatial interference cancellation for multiantenna mobile ad hoc networks,” - Huang, Andrews, et al. - 2012 |

33 | Rethinking MIMO for wireless networks: linear throughput increases with multiple receive antennas
- Jindal, Andrews, et al.
- 2009
(Show Context)
Citation Context ...g tools from stochastic geometry [1]–[4]. The transmission capacity framework allows for tractable analysis with different physical layer transmission techniques, such as use of multiple antennas [5]–=-=[8]-=-, bandwidth partitioning [9], and successive interference cancelation [2]. Most of the prior work on computing the transmission capacity of ad hoc networks has been limited to single hop communication... |

19 | Random access transport capacity,”
- Andrews, Weber, et al.
- 2010
(Show Context)
Citation Context ...ccessive interference cancelation [2]. Most of the prior work on computing the transmission capacity of ad hoc networks has been limited to single hop communication. Recently, under some assumptions, =-=[10]-=- computed the transmission capacity of ad hoc network with multi-hop transmissions, and automatic repeat request (ARQ) on each hop. To account for retransmissions and multiple hops, [10] normalized th... |

16 | Capacity scaling of ad hoc networks with spatial diversity
- Hunter, Andrews, et al.
- 2008
(Show Context)
Citation Context ...using tools from stochastic geometry [1]–[4]. The transmission capacity framework allows for tractable analysis with different physical layer transmission techniques, such as use of multiple antennas =-=[5]-=-–[8], bandwidth partitioning [9], and successive interference cancelation [2]. Most of the prior work on computing the transmission capacity of ad hoc networks has been limited to single hop communica... |

14 |
Stochastic Gemoetry and its Applications
- Stoyan, Kendall, et al.
- 1995
(Show Context)
Citation Context ...unicate with each other without any centralized control. The location of each source node Sm, m ∈ N is modeled as a homogenous Poisson point process (PPP) on a two-dimensional plane with intensity λ0 =-=[17]-=- 1. We assume that source Sm is located at a distance d from its intended 1Our model precludes mobility of nodes, and is restricted to averaging with respect to the PPP spatial node distribution. 4rec... |

10 | A delay-minimizing routing strategy for wireless multi-hop networks - Stamatiou, Rossetto, et al. - 2009 |

6 | Transmission capacity: applying stochastic geometry to uncoordinated ad hoc networks,” Aug. 2008, available on http://arxiv.org - Weber, Andrews, et al. |

2 |
partitioning in decentralized wireless networks
- “Bandwidth
- 2007
(Show Context)
Citation Context ...etry [1]–[4]. The transmission capacity framework allows for tractable analysis with different physical layer transmission techniques, such as use of multiple antennas [5]–[8], bandwidth partitioning =-=[9]-=-, and successive interference cancelation [2]. Most of the prior work on computing the transmission capacity of ad hoc networks has been limited to single hop communication. Recently, under some assum... |