Optimal Geographic Routing for Wireless Networks with Near-Arbitrary Holes and Traffic (2009)
Sundar Subramanian, Sanjay Shakkottai, Piyush Gupta
Abstract—We consider the problem of throughput-optimal routing over large-scale wireless ad-hoc networks. Gupta and Kumar (2000) showed that a throughput capacity (a uniform 1) is achievable n log...
Consumer Preferences in Cyberspace : a Comparison of Websites Ranking Across the Globe. (2009)
Color poster with text, charts, and graphs describing research conducted by Piyush Gupta, advised by Bruce W. N. Lo.
Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks (2009)
Ma, Nan, Ishwar, Prakash, Gupta, Piyush
We study the limits of communication efficiency for function computation in collocated networks within the framework of multi-terminal block source coding theory. With the goal of computing a desired...
The Capacity Region of Large Wireless Networks (2008)
Niesen, Urs, Gupta, Piyush, Shah, Devavrat
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n^2 node pairs. In this paper, we consider the question of determining...
On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic (2008)
Sundar Subramanian, Sanjay Shakkottai, Piyush Gupta
Abstract — Geographic forwarding has been widely studied as a routing strategy for large wireless networks, mainly due to the low complexity of the routing algorithm, scalability of the routing...
Gerhard Kramer, Piyush Gupta, Michael Gastpar
An achievable rate region for memoryless relay networks is developed based on an existing region for additive white Gaussian noise (AWGN) channels. It is shown that multi–hopping achieves the...
in the deployment of Wireless Local Area Networks (2008)
Piyush Gupta, Yogesh Sankarasubramaniam, Er Stolyar
Abstract — Recent years have seen tremendous growth
When n identical randomly located nodes, each capable of transmitting at W bits/sec and using a xed range, form a wireless network, the throughput (n) obtainable by each node for a randomly chosen...
Learning Decentralized Goal-based Vector Quantization (2007)
In this paper we consider the following generalization of classical vector quantization: to (vector) quantize or, equivalently, to partition the domain of a given function such that each cell in the...
What is the Traffic Hauling Capacity of Wireless Networks? (2007)
We consider multi-hop radio networks, also known as packet radio networks, or ad hoc networks. Consider n nodes located in a disk of area A sq.m., with each node capable of transmitting at W bits/sec...
Depth-Optimal O(n)-node Neural Networks for n-bit addition (2007)
In this paper, we study the problem of depth-optimal n-bit addition using feedforward Neural Networks with threshold type nodes. Three two-layer architectures are given requiring respectively (3n...
Randomized Neural Networks for Learning Stochastic Dependences (2007)
We consider the problem of learning the dependence of one random variable on another, from a finite string of i.i.d. copies of the pair. The problem is first converted to that of learning a function...
Piyush Gupta, Robert Gray, P. R. Kumar
We report on the results of an experimental study of scaling laws in ad hoc networks employing IEEE 802.11 technology. Our results show that the per node throughput declines like c n 1:68 bits/sec,...
Critical Power for Asymptotic Connectivity 1 (2007)
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...
It is shown that when n identical randomly located nodes form a wireless network, the throughput (n) obtainable by each node is \Theta(
Internets in the Sky: The Capacity of (2007)
Three Dimensional Wireless, Piyush Gupta
Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can...
On Capacity Scaling in Arbitrary Wireless Networks (2007)
Niesen, Urs, Gupta, Piyush, Shah, Devavrat
We consider the problem of characterizing per node throughput scaling in arbitrary extended wireless networks. Recently, Ozgur, Leveque, and Tse (2007) obtained a complete characterization of...
Screening for Retinopathy of Prematurity in Developing Countries (2007)
Sharma, Rohit, Gupta, Ved P., Dhaliwal, Upreet, Gupta, Piyush
Improved survival of low birth weight, premature babies in India has increased the incidence of retinopathy of prematurity. Western reports describe screening criteria to pick up babies most at risk....
Screening for Retinopathy of Prematurity in Developing Countries (2006)
Sharma, Rohit, Gupta, Ved P., Dhaliwal, Upreet, Gupta, Piyush
Improved survival of low birth weight, premature babies in India has increased the incidence of retinopathy of prematurity. Western reports describe screening criteria to pick up babies most at risk....
Screening for Retinopathy of Prematurity in Developing Countries (2006)
Sharma, Rohit, Gupta, Ved P., Dhaliwal, Upreet, Gupta, Piyush
Improved survival of low birth weight, premature babies in India has increased the incidence of retinopathy of prematurity. Western reports describe screening criteria to pick up babies most at risk....
Contribution of Bone Marrow-Derived Cells to the Tumor Stroma in Human Breast Cancer (2005)
Gupta, Piyush, Weinberg, Robert A.
Breast cancer is a disease whose progression requires the involvement of many different cell types. These cell types, in addition to the mutated cancerous cells that initiate formation of the tumor...
Georgia Techs Packaging Research Centers vision of System on Package (SOP) requires that the ball grid array (BGA) package be eliminated and the integrated circuit (IC) directly assembled on the...
Georgia Techs Packaging Research Centers vision of System on Package (SOP) requires that the ball grid array (BGA) package be eliminated and the integrated circuit (IC) directly assembled on the...
Georgia Techs Packaging Research Centers vision of System on Package (SOP) requires that the ball grid array (BGA) package be eliminated and the integrated circuit (IC) directly assembled on the...
Georgia Techs Packaging Research Centers vision of System on Package (SOP) requires that the ball grid array (BGA) package be eliminated and the integrated circuit (IC) directly assembled on the...
Gupta, Piyush, Narang, Manish, Banerjee, BD, Basu, Srikanta
Abstract Background The objective of this study was to assess the status of oxidative stress in term small for gestational age (SGA) newborn infants born to undernourished mothers by estimating...
Thesis (M.S.)--Materials Science and Engineering, Georgia Institute of Technology, 2005.
Thesis (M.S.)--Materials Science and Engineering, Georgia Institute of Technology, 2005.
Towards an Information Theory of Large Networks: An Achievable Rate Region (2003)
Abstract — We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive...
Towards an Information Theory of Large Networks: An Achievable Rate Region (2003)
We study communication networks of arbitrary size and topology under a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable...
Towards an Information Theory of Large Networks: An Achievable Rate Region (2003)
We study communication networks of arbitrary size and topology under a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable...
Towards an Information Theory of Large Networks: An Achievable Rate Region (2003)
We study communication networks of arbitrary size and topology under a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable...
Towards an Information Theory of Large Networks: An Achievable Rate Region (2003)
Abstract | We analyze communication networks of arbitrary size in an information-theoretic framework. We rst obtain an achievable lower bound on the capacity of a network of nodes with a single...
Internets in the sky: the capacity of three dimensional wireless networks (2001)
Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can...
Internets in the Sky: The Capacity of Three Dimensional Wireless Networks (2001)
Piyush Gupta, P. R. Kumar, W (v N
Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can...
Internets in the Sky: The Capacity of Three Dimensional Wireless Networks (2001)
Piyush Gupta And, Piyush Gupta, P. R. Kumar, W (v N
Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can...
The capacity of wireless networks (2000)
Piyush Gupta, Student Member, P. R. Kumar
Abstract—When identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a...
The capacity of wireless networks (2000)
Piyush Gupta, Student Member, P. R. Kumar
Abstract—When identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a...
Randomized Neural Networks for Learning Stochastic Dependences (1999)
Borkar, Vivek S, Gupta, Piyush
We consider the problem of learning the dependence of one random variable on another, from a finite string of independently identically distributed (i.i.d.) copies of the pair. The problem is first...
Randomized Neural Networks for Learning Stochastic Dependences (1999)
Borkar, Vivek S, Gupta, Piyush
We consider the problem of learning the dependence of one random variable on another, from a finite string of independently identically distributed (i.i.d.) copies of the pair. The problem is first...
The Capacity of Wireless Networks (1999)
It is shown that when n identical randomly located nodes form a wireless network, the throughput (n) obtainable by each node is \Theta( 1 p n log n ). This result is true whether the situation is...
Contribution of Bone Marrow-Derived Cells to the Tumor Stroma in Human Breast Cancer (1998)
Gupta, Piyush, Weinberg, Robert A.
Breast cancer is a disease whose progression requires the involvement of many different cell types. These cell types, in addition to the mutated cancerous cells that initiate formation of the tumor...
Critical Power for Asymptotic Connectivity in Wireless Networks (1998)
continuum percolation. ABSTRACT: In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other...
Critical Power for Asymptotic Connectivity in Wireless Networks (1998)
: In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel....
A System and Traffic Dependent Adaptive Routing Algorithm for Ad Hoc Networks (1997)
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing...
A System and Traffic Dependent Adaptive Routing Algorithm for Ad Hoc Networks (1997)
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing...
Vita.