Zhenning Kong

  1. Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks.

    Authors: Zhenning Kong, Emina Soljanin, Salah A. Aly
    Subjects: Information Theory
    Abstract

    We consider large-scale wireless sensor networks with $n$ nodes, out of which
    k are in possession, (e.g., have sensed or collected in some other way) k
    information packets.

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

    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.

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

    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.

RSS-материал