(Enter summary)
Abstract: In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others' packets, as is the case in ad hoc wireless networks, ([5]), and [7]), then each node should transmit with just enough power to... (Update)
Cited by: More
Coverage and Connectivity of Ad Hoc Networks in Presence of.. - Miorandi, Altman
(Correct)
Connectivity in Ad-Hoc Networks: an Infinite-Server Queue.. - Miorandi, Altman (2003)
(Correct)
Similar documents (at the sentence level): More
73.4%: Critical Power for Asymptotic Connectivity - Gupta, Kuma (1998)
(Correct)
16.4%: Critical Power for Asymptotic Connectivity In Wireless Networks - Gupta, Kumar (1998)
(Correct)
15.1%: Critical Power for Asymptotic Connectivity in Wireless Networks - Gupta, Kumar (1998)
(Correct)
Active bibliography (related documents): More All
0.0: Channel Access Algorithms with Active Link Protection for.. - Bambos, Chen, Pottie (2000)
(Correct)
0.0: Joint Scheduling and Power Control for Wireless Ad Hoc Networks - ElBatt, Ephremides (2002)
(Correct)
0.0: Power Control and Capacity of Spread Spectrum Wireless Networks - Hanly, Tse (1999)
(Correct)
Similar documents based on text: More All
0.4: What is the Traffic Hauling Capacity of Wireless Networks? - Gupta, Kumar
(Correct)
0.3: Towards an Information Theory of Large Networks: An Achievable .. - Gupta, Kumar (2001)
(Correct)
0.3: Internets in the Sky: The Capacity of Three Dimensional.. - Gupta, Kumar (2001)
(Correct)
Related documents from co-citation: More All
2: Outage probability in multiple access packet radio networks in the presence of f..
- Zorzi, Pupolin
2: Adaptive Wireless Transceivers (context) - Hanzo, Wong et al.
2: A network information theory for wireless communication: Scaling laws and optima..
- Xie, Kumar - 2002
BibTeX entry: (Update)
P. Gupta and P. R. Kumar, Critical power for asymptotic connectivity, in Proc. of Conf. on Decision and Control, Tampa, USA, 1998. http://citeseer.ist.psu.edu/article/gupta98critical.html More
@misc{ gupta98critical,
author = "P. Gupta and P. Kumar",
title = "Critical power for asymptotic connectivity",
text = "P. Gupta and P. R. Kumar, Critical power for asymptotic connectivity,
in Proc. of Conf. on Decision and Control, Tampa, USA, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/article/gupta98critical.html" }
Citations (may not include all citations):
723
Dynamic source routing in ad hoc wireless networks
- Johnson, Maltz - 1996
411
Random Graphs (context) - Bollob - 1985
64
Cambridge University Press (context) - Meester, Roy et al. - 1996
58
Percolation Theory for Mathematicians (context) - Kesten - 1982
56
Introduction to the Theory of Coverage Processes (context) - Hall - 1988
45
Stochastic power control for cellular radio systems
- Ulukus, Yates - 1996
42
Radio link admission algorithms for wireless networks with p..
- Bambos, Chen et al. - 1996
2
To appear in Stochastic Analysis (context) - Gupta, Kumar et al. - 1998
2
A system and traf- c dependent adaptive routing algorithm fo.. (context) - Gupta, Kumar - 1997
Documents on the same site (http://black.csl.uiuc.edu/~piyush/./pub_list.html): More
Depth-Optimal O(n)-node Neural Networks for n-bit addition - Gupta, Poonacha
(Correct)
Critical Power for Asymptotic Connectivity in Wireless Networks - Gupta, Kumar (1998)
(Correct)
Randomized Neural Networks for Learning Stochastic Dependences - Borkar, Gupta
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC