Главная

Edmund M. Yeh

  1. Deterministic Network Model Revisited: An Algebraic Network Coding Approach.

    Втр, 03/08/2011 - 16:01 — SomNambul
    Authors: Edmund M. Yeh, Muriel Medard, MinJi Kim, Elona Erez
    Subjects: Information Theory
    Abstract

    The capacity of multiuser networks has been a long-standing problem in
    information theory. Recently, Avestimehr et al. have proposed a deterministic
    network model to approximate multiuser wireless networks. This model, known as
    the ADT network model, takes into account the broadcast nature of wireless
    medium and interference.

  2. The Impact of Incomplete Information on Games in Parallel Relay Networks.

    Пнд, 01/24/2011 - 16:01 — SomNambul
    Authors: Edmund M. Yeh, Hongda Xiao
    Subjects: Computer Science and Game Theory
    Abstract

    We consider the impact of incomplete information on incentives for node
    cooperation in parallel relay networks with one source node, one destination
    node, and multiple relay nodes. All nodes are selfish and strategic, interested
    in maximizing their own profit instead of the social welfare. We consider the
    practical situation where the channel state on any given relay path is not
    observable to the source or to the other relays.

  3. Percolation Processes and Wireless Network Resilience to Degree-Dependent and Cascading Node Failures.

    Пнд, 08/31/2009 - 17:16 — SomNambul
    Authors: Zhenning Kong, Edmund M. Yeh
    Subjects: Networking and Internet Architecture
    Abstract

    We study the problem of wireless network resilience to node failures from a
    percolation-based perspective. In practical wireless networks, it is often the
    case that the failure probability of a node depends on its degree (number of
    neighbors). We model this phenomenon as a degree-dependent site percolation
    process on random geometric graphs. In particular, we obtain analytical
    conditions for the existence of phase transitions within this model.
    Furthermore, in networks carrying traffic load, the failure of one node can
    result in redistribution of the load onto other nearby nodes.

  4. Coding Improves the Throughput-Delay Trade-off in Mobile Wireless Networks.

    Пнд, 08/31/2009 - 17:16 — SomNambul
    Authors: Zhenning Kong, Edmund M. Yeh, Emina Soljanin
    Subjects: Information Theory
    Abstract

    We study the throughput-delay performance tradeoff in large-scale wireless ad
    hoc networks. It has been shown that the per source-destination pair throughput
    can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to
    move and a 2-hop relay scheme is employed. The price paid for such an
    improvement on throughput is large delay. Indeed, the delay scaling of the
    2-hop relay scheme is Theta(n log n) under the random walk mobility model. In
    this paper, we employ coding techniques to improve the throughput-delay
    trade-off for mobile wireless networks.

Math-arch

RSS-материал