#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1997

2016

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

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn 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)

- 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)

- 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)

- Yufang Xi, Edmund M. Yeh
- IEEE/ACM Transactions on Networking
- 2010

Network coding techniques are used to find the minimum-cost transmission scheme for multicast sessions with or without elastic rate demand. It is shown that in wireline networks, solving for the optimal coding subgraphs in network coding is equivalent to finding the optimal routing scheme in a multicommodity flow problem. A set of node-based distributed… (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)

— 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)

- Yufang Xi, Edmund M. Yeh
- 2006 4th International Symposium on Modeling and…
- 2006

The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multi-hop wireless networks with random traffic arrivals and queueing. The practical implementation of the MDB policy in wireless networks with mutually interfering links, however, requires the development of… (More)

- Eren Şaşoğlu, Emre Telatar, Edmund Yeh
- 2010 IEEE Information Theory Workshop on…
- 2010

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 the Arikan 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)

- Zhenning Kong, Edmund M. Yeh
- IEEE INFOCOM 2008 - The 27th Conference on…
- 2008

We study connectivity and transmission latency in wireless networks with unreliable links from a percolation-based perspective. We first examine static models, where each link of the network is functional (active) with some probability, independently of all other links, where the probability may depend on the distance between the two nodes. We obtain… (More)