#### DMCA

## On the Fundamental Relationship Determining the Capacity of Static and Mobile Wireless Networks

### Citations

3235 | Capacity of wireless networks
- Gupta, Kumar
- 1999
(Show Context)
Citation Context ...ently connected networks, are being increasingly used in military and civilian applications. Studying the capacity of these networks is an important problem. Since the seminal work of Gupta and Kumar =-=[1]-=-, extensive research has been done in the area. Particularly, it was shown in [1] that in an ad-hoc network with a total of n nodes uniformly and i.i.d. on an area of unit size and each node is capabl... |

1211 | Mobility increases the capacity of ad hoc wireless networks
- Grossglauser, Tse
- 2002
(Show Context)
Citation Context ...transmission range, the per-node throughput can also reach λ (n) = Θ ( 1√ n ) even when nodes are randomly deployed. The existence of such highway was established using the percolation theory [3]. In =-=[4]-=- Grossglauser and Tse showed that in mobile networks, by leveraging on the nodes’ mobility, a per-node throughput of Θ(1) can be achieved at the expense G. Mao is with the School of Electrical and Inf... |

238 | Closing the gap in the capacity of wireless networks via percolation theory
- Franceschetti, Dousse, et al.
- 2007
(Show Context)
Citation Context ...ting at a fixed rate of W bits/s. A node chooses its destination randomly and independently of other nodes and the total number of source-destination pairs equals to n, viz. m = n. In some literature =-=[2]-=-, [6], [8], a different network area is considered and their results are converted into a unit square and discussed. A. Static ad-hoc networks In [1], Gupta and Kumar first considered the network defi... |

238 | Stochastic geometry and random graphs for the analysis and design of wireless networks - Haenggi, Andrews, et al. - 2009 |

190 | Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks - Neely, Modiano - 2005 |

100 | An overview of the transmission capacity of wireless networks
- Weber, Andrews, et al.
- 2010
(Show Context)
Citation Context ...ping equal-radius circles that can be packed into A and then studied as a densest circle packing problem (see [11] for an example). E (Y ) can also be studied as the transmission capacity of networks =-=[12]-=-. For unicast transmission, k (n) becomes the average number of hops between two randomly chosen source-destination pairs and has been studied extensively [13]. As will also be shown in Section III, E... |

87 | Veciana, “Capacity of ad hoc wireless networks with infrastructure support
- Zemlianov, de
- 2005
(Show Context)
Citation Context ... obtained results often vary greatly with the mobility models being considered, see [5] for an example. Further, there is also a significant amount of work studying the impact of infrastructure nodes =-=[6]-=- and multiple-access protocol [7] on capacity and the multicast capacity [8]. We refer readers to [9] for a more comprehensive review of related work. In this letter, we sift through these capacity-im... |

67 | Multicast capacity of wireless ad hoc networks
- Li
(Show Context)
Citation Context ...ed, see [5] for an example. Further, there is also a significant amount of work studying the impact of infrastructure nodes [6] and multiple-access protocol [7] on capacity and the multicast capacity =-=[8]-=-. We refer readers to [9] for a more comprehensive review of related work. In this letter, we sift through these capacity-impacting parameters, e.g. routing protocols, traffic distribution, mobility, ... |

53 |
Queueing Systems. Volume 1: Theory. Wiley-Interscience
- Kleinrock
- 1975
(Show Context)
Citation Context ...etwork on the network level by considering the number of simultaneous transmissions in the entire network, viz. ´ T 0 Ytdt. Equation (6) can also be obtained using Little’s formula in queueing theory =-=[10]-=-. Equation (6) is obtained under a very generic setting and is applicable for network of any size. It reveals that the network capacity is fundamentally determined by the average number of simultaneou... |

23 | Capacity of large-scale csma wireless networks. - Chau, Chen, et al. - 2009 |

13 |
Continuum Percolation, Cambridge Tracts
- Meester, Roy
- 1996
(Show Context)
Citation Context ...smaller transmission range, the per-node throughput can also reach λ (n) = Θ ( 1√ n ) even when nodes are randomly deployed. The existence of such highway was established using the percolation theory =-=[3]-=-. In [4] Grossglauser and Tse showed that in mobile networks, by leveraging on the nodes’ mobility, a per-node throughput of Θ(1) can be achieved at the expense G. Mao is with the School of Electrical... |

13 | The Probability Distribution of the Distance Between Two Random Points in a Box
- Philip
- 2007
(Show Context)
Citation Context ...node as a transmitter or receiver is small and has little impact on E (Y ). Further, it can be shown that the average Euclidean distance between a randomly chosen pair of infrastructure nodes is Θ(1) =-=[15]-=-. That is, a packet transmitted between two infrastructure nodes moves by an Euclidean distance of Θ(1) whereas a packet transmitted by a pair of directly connected ordinary nodes moves by an Euclidea... |

8 | 2009).On the giant component of wireless multihop networks in the presence of shadowing
- Ta, Mao, et al.
(Show Context)
Citation Context ... range is required to connect most nodes in the network (i.e. forming a giant component) whereas the larger transmission range of Θ (√ logn n ) is only required to connect the few hard-to-reach nodes =-=[14]-=-, a routing scheme can be designed, which achieves a per-node throughput of λ (n) = Θ ( 1√ n ) and does not have to use the highway system, such that a node uses smaller transmission ranges for most c... |

6 |
Connectivity of large-scale csma networks
- Yang, Mao, et al.
- 2012
(Show Context)
Citation Context ...er bound on E (Y ), can be converted into one that finds the maximum number of non-overlapping equal-radius circles that can be packed into A and then studied as a densest circle packing problem (see =-=[11]-=- for an example). E (Y ) can also be studied as the transmission capacity of networks [12]. For unicast transmission, k (n) becomes the average number of hops between two randomly chosen source-destin... |

3 |
Probability of k-hop connection under random connection model
- Mao, Zhang, et al.
- 2010
(Show Context)
Citation Context ...as the transmission capacity of networks [12]. For unicast transmission, k (n) becomes the average number of hops between two randomly chosen source-destination pairs and has been studied extensively =-=[13]-=-. As will also be shown in Section III, E (Y ) and k (n) can be optimized separately to maximize the network capacity. We also note an important special case of (6): when the total number of source-de... |