#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1997

2016

- This year (0)
- Last 5 years (20)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We introduce a technique for accelerating the gossip algorithm of Boyd et. al. (INFOCOM 2005) for distributed averaging in a network. By employing memory in the form of a small shift-register in the computation at each node, we can speed up the algorithm’s convergence by a factor of 10. Our accelerated algorithm is inspired by the observation that the… (More)

- Zhenning Kong, Edmund M. Yeh
- MobiHoc
- 2008

In wireless networks, node mobility may be exploited to assist in information dissemination over time. We analyze the latency for information dissemination in large-scale mobile wireless networks. To study this problem, we map a network of mobile nodes to a network of stationary nodes with dynamic links. We then use results from percolation theory to show… (More)

- Edmund M. Yeh
- 2001

Two fundamental issues in the design of wireless communication networks are the interference among multiple users and the time-varying nature of the fading wireless channel. We apply fundamental techniques in information theory and queueing theory to gain insights into the structure of these problems. In a terrestrial cellular or space network, multi-user… (More)

- Yufang Xi, Edmund M. Yeh
- MobiHoc
- 2007

We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing the total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate simultaneously on the same frequency band, we first devise a spectrum allocation scheme that divides the whole… (More)

- Eren Sasoglu, Emre Telatar, Edmund M. Yeh
- IEEE Transactions on Information Theory
- 2012

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded transmission is optimal. The sum rate achieved by this coding technique is the one that corresponds to… (More)

- Edmund M. Yeh, Randall Berry
- IEEE Transactions on Information Theory
- 2005

In cooperative relaying, multiple nodes cooperate to forward a packet within a network. To date, such schemes have been primarily investigated at the physical layer with the focus on communication of a single end-to-end flow. This paper considers cooperative relay networks with multiple stochastically varying flows, which may be queued within the network.… (More)

- Jelena Kovacevic, Robert J. Safranek, Edmund M. Yeh
- IEEE Trans. Image Processing
- 1997

We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is… (More)

- Zhenning Kong, Edmund M. Yeh
- MobiHoc
- 2007

In battery-constrained wireless sensor networks, it is important to employ effective energy management while maintaining some level of network connectivity. Viewing this problem from a percolation-based connectivity perspective, we propose a fully distributed energy management algorithm for large-scale wireless sensor networks. This algorithm allows each… (More)

- Yufang Xi, Edmund M. Yeh
- IEEE Transactions on Information Theory
- 2008

In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integrated manner. In this work, an interference-limited wireless network is considered, whereby power control and routing variables are chosen to minimize the sum of link costs which depend on… (More)

- Zhenning Kong, Edmund M. Yeh
- 2007 5th International Symposium on Modeling and…
- 2007

Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density lambda<sub>c</sub> <sup>(d)</sup> for d-dimensional Poisson random geometric graphs in continuum percolation theory. By using a probabilistic analysis which incorporates the clustering… (More)