Parallel Opportunistic Routing in Wireless Networks

We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic routing is novel in a sense that it is massively parallel, i.e., it is performed by many nodes simultaneously to maximize the opportunistic gain while controlling the inter-user interference. The scaling behavior of conventional multi-hop transmission that does not employ opportunistic routing is also examined for comparison. Our results indicate that our opportunistic routing can exhibit a net improvement in overall power--delay trade-off over the conventional routing by providing up to a logarithmic boost in the scaling law. Such a gain is possible since the receivers can tolerate more interference due to the increased received signal power provided by the multi-user diversity gain, which means that having more simultaneous transmissions is possible.Comment: 18 pages, 7 figures, Under Review for Possible Publication in IEEE Transactions on Information Theor

Nonmonotonic behavior of resistance in a superconductor-Luttinger liquid junction

Transport through a superconductor-Luttinger liquid junction is considered. When the interaction in the Luttinger liquid is repulsive, the resistance of the junction with a sufficiently clean interface shows nonmonotonic temperature- or voltage-dependence due to the competition between the superconductivity and the repulsive interaction. The result is discussed in connection with recent experiments on single-wall carbon nanotubes in contact with superconducting leads.Comment: Revtex4, 2 eps figure files, slightly revised from an earlier version submitted to PRL on 2001.12.

Impurity scattering in a d-wave superconductor

The influence of (non-magnetic and magnetic) impurities on the transition temperature of a d-wave superconductor is studied anew within the framework of BCS theory. Pairing interaction decreases linearly with the impurity concentration. Accordingly $T_{c}$ suppression is proportional to the (potential or exchange) scattering rate, $1/\tau$, due to impurities. The initial slope versus $1/\tau$ is found to depend on the superconductor contrary to Abrikosov-Gor'kov type theory. Near the critical impurity concentration $T_{c}$ drops abruptly to zero. Because the potential scattering rate is generally much larger than the exchange scattering rate, magnetic impurities will also act as non-magnetic impurities as far as the $T_{c}$ decrease is concerned. The implication for the impurity doping effect in high $T_{c}$ superconductors is also discussed.Comment: 12 pages and 1 figure, PlainTex, submitted to Mod. Phys. Lett. B, For more information, please see "http://taesan.kaist.ac.kr/~yjkim

A joint time-invariant filtering approach to the linear Gaussian relay problem

In this paper, the linear Gaussian relay problem is considered. Under the linear time-invariant (LTI) model the problem is formulated in the frequency domain based on the Toeplitz distribution theorem. Under the further assumption of realizable input spectra, the LTI Gaussian relay problem is converted to a joint design problem of source and relay filters under two power constraints, one at the source and the other at the relay, and a practical solution to this problem is proposed based on the projected subgradient method. Numerical results show that the proposed method yields a noticeable gain over the instantaneous amplify-and-forward (AF) scheme in inter-symbol interference (ISI) channels. Also, the optimality of the AF scheme within the class of one-tap relay filters is established in flat-fading channels.Comment: 30 pages, 10 figure

Estimation of petroleum reservoir properties

We present an algorithm for estimating the absolute and relative permeabilities in petroleum reservoir models based on regularization and spline approximation. A computational example is included

Nested Lattice Codes for Gaussian Relay Networks with Interference

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast capacity of these networks. As a subclass, we first focus on Gaussian relay networks with interference and find an achievable rate using a lattice coding scheme. It is shown that there is a constant gap between our achievable rate and the information theoretic cut-set bound. This is similar to the recent result by Avestimehr, Diggavi, and Tse, who showed such an approximate characterization of the capacity of general Gaussian relay networks. However, our achievability uses a structured code instead of a random one. Using the same idea used in the Gaussian case, we also consider linear finite-field symmetric networks with interference and characterize the capacity using a linear coding scheme.Comment: 23 pages, 5 figures, submitted to IEEE Transactions on Information Theor