The capacity of wireless networks

By Piyush Gupta, P. Arun Raj Kumar, K. Kambli. IEEE Transactions on Information Theory, 2000

2,698 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/3761a4b7e29bbb235417996be243075a3aa795c3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Fundamental Limits of Wideband Localization— Part II: Cooperative Networks (2010, background): “We focus on two types of random networks: dense networks and extended networks [47], [48].”
Cognitive radio: brain-empowered wireless communications (2005, methodology): “Under a protocol model of noninterference, Gupta and Kumar derive two significant results.”
Wireless Device-to-Device Caching Networks: Basic Principles and System Performance (2013, methodology): “By means of extensive simulations, this paper relaxes some restrictive assumptions of the theoretical scaling laws analysis based on the “protocol model” of [29], and provides more in-depth practical results with the goal of assessing the true potential of the various methods in a realistic propagat”
Joint rate control and scheduling in multihop wireless networks (2004, background): “One approach to improve the capacity of a wireless network is to use multi-hop instead of traditional single-hop communication [1], [2].”
A location-based routing method for mobile ad hoc networks (2005, methodology): “However, for networks of 500 to 1,000 nodes, we verified by simulations that we are not in the asymptotic regime of [15].”
Cooperative diversity in wireless networks: algorithms and architectures (2002, background): “These include, for example, various network source coding problems [26, 6, 8, 21], and network channel coding, medium access, and power control problems [9, 31, 32, 46, 83].”
A Routing-Driven Elliptic Curve Cryptography based Key Management Scheme for Heterogeneous Sensor Networks (2014, background): “Research has demonstrated its performance bottleneck both theoretically [1], [2] and through simulation experiments and testbed measurements [3].”
The Guard Zone in Wireless Ad hoc Networks (2007, background): “Lately, there has been a growing interest in determining the capacity of ad hoc networks [7]–[16].”
Capacity of Ad Hoc wireless networks (2001, methodology): “Gupta and Kumar [8] show that the per node capacity in an n-node random ad hoc network is (1= p n log n), using a geometric analysis.”
Fundamental Limits of Caching in Wireless D2D Networks (2014, methodology): “Such sets form the receivers side information, such that for any arbitrary set of user demands a common multicast coded message can be sent from the base station to all users in order to satisfy their demands.”
The Number of Neighbors Needed for Connectivity of Wireless Networks (2004, background): “This problem has been addressed in [8] for the case of connectivity based on distance.”
Gossip-based ad hoc routing (2002, background): “While there are fundamental limits to the amount of nonlocal traffic that can be sent in large networks, due to problems of scaling [8], [14], gossiping should still be useful in large networks when nonlocal messages need to be sent.”
Ad hoc networking with directional antennas: a complete system solution (2005, background): “Ad hoc networks suffer from fundamental capacity limitations [1], connectivity/survivability problems, and are prone to jamming and eavesdropping.”
Unreliable sensor grids: coverage, connectivity and diameter (2003, methodology): “For the same random placement model, the authors also derived the data carrying capacity of the network [4] in terms of the number of bit-meters/second.”
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) (2003, methodology): “This contrasts with the result shown by Gupta and Kumar [5], which states that as the number of nodes per unit area increases, the throughput of each connection decreases at a rate 1 √ n , where n is the number of nodes.”
Practical relay networks: a generalization of hybrid-ARQ (2005, background): “If a network is constrained to use only point-to-point links, then the average throughput furnished to each source diminishes to zero as the number of nodes tends to infinity [3].”