Panganamala Ramana Kumar

Learn More
When identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput ( ) obtainable by each node for a randomly chosen destination is log bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally(More)
Unlike wired networks, wireless networks do not come with links. Rather, links have to be fashioned out of the ether by nodes choosing neighbors to connect to. Moreover the location of the nodes may be random. The question that we resolve is: How many neighbors should each node be connected to in order that the overall network is connected in a multi-hop(More)
In wireless sensor networks, one is not interested in downloading all the data from all the sensors. Rather, one is only interested in collecting from a sink node a relevant function of the sensor measurements. This paper studies the maximum rate at which functions of sensor measurements can be computed and communicated to the sink node. It focuses on(More)
Recently, in an effort to improve the performance of wireless networks, there has been increased interest in protocols that rely on interactions between different layers. However, such cross-layer design can run at cross purposes with sound and longer-term architectural principles, and lead to various negative consequences. This motivates us to step back(More)
We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme.(More)
Transmit power control is a prototypical example of a cross-layer design problem. The transmit power level affects signal quality and, thus, impacts the physical layer, determines the neighboring nodes that can hear the packet and, thus, the network layer affects interference which causes congestion and, thus, affects the transport layer. It is also key to(More)
For the multiple-level relay channel, an achievable rate formula, and a simple coding scheme to achieve it, are presented. Generally, higher rates can be achieved with this coding scheme in the multiple-level relay case than previously known. For a class of degraded channels, this achievable rate is shown to be the exact capacity. An application of the(More)
Usually, the stability of queueing networks is established by explicitly determining the invariant distribution. Outside of the narrow class of queueing networks possessing a product form solution, however, such explicit solutions are rare, and consequently little is also known concerning stability. We develop here a programmatic procedure for establishing(More)