Learn More
In this paper, we present an experimental and simulation based study to evaluate the use of full-duplex as a mode in practical IEEE 802.11 networks. To enable the study, we designed a 20 MHz multi-antenna OFDM full-duplex physical layer and a full-duplex capable MAC protocol which is backward compatible with current 802.11. Our extensive over-the-air(More)
The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of(More)
—Full duplex communication requires nodes to cancel their own interference. Recent work have proved the feasibility of full duplex communications using software radios. In this paper, we address capacity comparisons when the total amount of analog radio hardware is bounded. Under this constraint, it is not immediately clear if one should use these radios to(More)
A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the " help-by-transfer " property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded(More)
—The sum capacity of a class of layered erasure one-sided interference channels is developed under the assumption of no channel state information at the transmitters. Outer bounds are presented for this model and are shown to be tight for the following sub-classes: i) weak, ii) strong (mix of strong but not very strong (SnVS) and very strong (VS)), iii)(More)
—In this paper, we consider end-to-end secure communication in a large wireless network, where the locations of eavesdroppers are uncertain. Our framework attempts to bridge the gap between physical layer security under uncertain channel state information of the eavesdropper and network level connectivity under security constraints, by modeling location(More)
— " If we know more, we can achieve more. " This adage also applies to communication networks, where more information about the network state translates into higher sum-rates. In this paper, we formalize this increase of sum-rate with increased knowledge of the network state. The knowledge of network state is measured in terms of the number of hops, h, of(More)
—A new class of exact-repair regenerating codes is constructed by combining two layers of erasure correction codes together with combinatorial block designs. The proposed codes have the " uncoded repair " property where the nodes participating in the repair simply transfer part of the stored data directly, without performing any computation. The layered(More)
Proportional Fair (PF) scheduling algorithms are the <i>de facto</i> standard in cellular networks. They exploit the users' channel state diversity (induced by fast-fading) and are optimal for stationary channel state distributions and an infinite time-horizon. However, <i>mobile users</i> experience a nonstationary channel, due to <i>slow-fading</i> (on(More)