A deterministic approach to throughput scaling in wireless networks
By Sanjeev R. Kulkarni, Pramod Viswanath. IEEE Transactions on Information Theory, 2002
330 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/f9a507c3d447902ca1c89f4b285cc92abc72d3b8
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
- Jeffrey G. Andrews
- Martin Haenggi
- Devavrat Shah
- François Baccelli
- Olivier Dousse
- Massimo Franceschetti
- Abbas A. El Gamal
- Rayadurgam Srikant
In Electrical and Electronic Engineering
- Jeffrey G. Andrews
- Martin Haenggi
- Tony Q. S. Quek
- François Baccelli
- Robert W. Heath
- Abbas A. El Gamal
- Devavrat Shah
- Ekram Hossain
Citations in the corpus
- Optimal throughput-delay scaling in wireless networks - part I: the fluid model (2006, result): “In [13], throughput scaling in static networks is studied and results similar to that of [11] are obtained using a different and simpler approach.”
- Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks (2007, methodology): “Cell scheduling for intercell transmissions: 1) Let L = Hmax; 2) cells with depth L are scheduled according to [7], [9], [4].”
- Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory (2007, background): “Alternative strategies have also been proposed to achieve the same bound [5], [13], [17].”
- Stochastic geometry and random graphs for the analysis and design of wireless networks (2009, background): “On one side, under the same restrictive model, simpler strategies achieving the same square root law have been proposed [41], [76].”