#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2007

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sundaram Vanka, Sunil Srinivasa, Zhenhua Gong, Peter Vizi, Kostas Stamatiou, Martin Haenggi
- IEEE Trans. Wireless Communications
- 2012

We design and implement a software-radio system for Superposition Coding (SC), a multiuser transmission scheme that deliberately introduces interference among user signals at the transmitter, using a library of off-the-shelf point-to-point channel codes. We experimentally determine the set of ratepairs achieved by this transmission scheme under a… (More)

- Sundaram Vanka, Vinitkumar Gupta, Martin Haenggi
- 2008 46th Annual Allerton Conference on…
- 2008

We study the convergence of the average consensus algorithm in wireless networks in the presence of interference. For regular lattices with periodic boundary conditions, we characterize the convergence properties of optimal MAC protocol that maximizes the speed of convergence on these networks. We provide analytical upper and lower bounds for the… (More)

- Sundaram Vanka, Martin Haenggi, Vijay Gupta
- IEEE Journal of Selected Topics in Signal…
- 2011

We analyze the effect of interference on the convergence rate of average consensus algorithms, which iteratively compute the measurement average by message passing among nodes. It is usually assumed that these algorithms converge faster with a greater exchange of information (i.e., by increased network connectivity) in every iteration. However, when… (More)

- Sundaram Vanka, Sunil Srinivasa, Martin Haenggi
- ICC
- 2012

We propose and experimentally demonstrate a novel approach to improve the packet delivery efficiency on a vulnerable downlink (e.g., from a transmitter to a far-away receiver) using superposition coding, a multiuser transmission scheme that forgoes orthogonal transmission and deliberately introduces interference among signals at the transmitter. On a… (More)

- Radha Krishna Ganti, Zhenhua Gong, +5 authors Peter Vizi
- ICC
- 2010

Superposition coding is a well-known capacityachieving coding scheme for stochastically degraded broadcast channels. Although well-studied in theory, it is important to understand issues that arise when implementing this scheme in a practical setting. In this paper, we present a software-radio based design of a superposition coding system on the GNU Radio… (More)

- Sundaram Vanka, Martin Haenggi
- 2010 IEEE International Symposium on Information…
- 2010

Network-wide adoption of a multipacket transmission scheme such as Superposition Coding (SC) for local “one-to-many” communication results in mutually interfering “broadcast” clusters. We analyze the benefits of SC and traditional Frequency Division (FD) with this interference via a utility function that measures the rate of… (More)

- Sundaram Vanka, Martin Haenggi
- GLOBECOM
- 2010

This paper studies the value of allowing multiple transmitters to share all of the available bandwidth to concurrently transmit to a single receiver with multi-packet decoding capability. While such coordination can be bandwidth-efficient, it increases the density of interferers when many such multiple-access clusters exist in the network. On the other… (More)

- Zhen Tong, Christina Russ, Sundaram Vanka, Martin Haenggi
- IEEE Trans. Communications
- 2015

We design and implement a software-radio system for rapid on-off-division duplex (RODD), a scheme to achieve virtual full-duplex communication at the level of a transmission frame. RODD is based on the insight that it is not necessary to separate a node’s transmission and reception at the timescale of a frame. Instead, RODD allows each node in a network to… (More)

- Sundaram Vanka, Martin Haenggi, Vijay Gupta
- GLOBECOM
- 2009

We consider the effect of network throughput on the convergence of a specific class of distributed averaging algorithms, called consensus algorithms. These algorithms rely on iterative computation of the desired average by message passing among the nodes. It is thus assumed that the rate of convergence should benefit from greater network connectivity.… (More)

We consider average consensus algorithms executed over stochastically varying communication topologies that may be unbalanced. It is known that the state values will reach consensus, under fairly weak conditions. However, the consensus value is a random variable. We provide concentration bounds for the distance of the state vector from the consensus… (More)