Dendrites Inhibition in Rechargeable Lithium Metal Batteries

The specific high energy and power capacities of rechargeable lithium metal (Li⁰) batteries are ideally suited to portable devices and are valuable as storage units for intermittent renewable energy sources. Lithium, the lightest and most electropositive metal, would be the optimal anode material for rechargeable batteries if it were not for the fact that such devices fail unexpectedly by short-circuiting via the dendrites that grow across electrodes upon recharging. This phenomenon poses a major safety issue because it triggers a series of adverse events that start with overheating, potentially followed by the thermal decomposition and ultimately the ignition of the organic solvents used in such devices.

In this thesis, we developed experimental platform for monitoring and quantifying the dendrite populations grown in a Li battery prototype upon charging under various conditions. We explored the effects of pulse charging in the kHz range and temperature on dendrite growth, and also on loss capacity into detached “dead” lithium particles.

Simultaneously, we developed a computational framework for understanding the dynamics of dendrite propagation. The coarse-grained Monte Carlo model assisted us in the interpretation of pulsing experiments, whereas MD calculations provided insights into the mechanism of dendrites thermal relaxation. We also developed a computational framework for measuring the dead lithium crystals from the experimental images.

Coding for information storage

Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.

We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.

We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.

On erasure coding for distributed storage and streaming communications

The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications.

First, we examine the problem of allocating a given storage budget over a set of nodes for maximum reliability. The objective is to find an allocation of the budget that maximizes the probability of successful recovery by a data collector accessing a random subset of the nodes. This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation. We study several variations of the problem, assuming different allocation models and access models, and determine the optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) for a variety of cases. Although the optimal allocation can have nonintuitive structure and can be difficult to find in general, our results suggest that, as a simple heuristic, reliable storage can be achieved by spreading the budget maximally over all nodes when the budget is large, and spreading it minimally over a few nodes when it is small. Coding would therefore be beneficial in the former case, while uncoded replication would suffice in the latter case.

Second, we study how distributed storage allocations affect the recovery delay in a mobile setting. Specifically, two recovery delay optimization problems are considered for a network of mobile storage nodes: the maximization of the probability of successful recovery by a given deadline, and the minimization of the expected recovery delay. We show that the first problem is closely related to the earlier allocation problem, and solve the second problem completely for the case of symmetric allocations. It turns out that the optimal allocations for the two problems can be quite different. In a simulation study, we evaluated the performance of a simple data dissemination and storage protocol for mobile delay-tolerant networks, and observed that the choice of allocation can have a significant impact on the recovery delay under a variety of scenarios.

Third, we consider a real-time streaming system where messages created at regular time intervals at a source are encoded for transmission to a receiver over a packet erasure link; the receiver must subsequently decode each message within a given delay from its creation time. For erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts whose maximum length is sufficiently short or long, we show that a time-invariant intrasession code asymptotically achieves the maximum message size among all codes that allow decoding under all admissible erasure patterns. For the bursty erasure model, we also show that diagonally interleaved codes derived from specific systematic block codes are asymptotically optimal over all codes in certain cases. We also study an i.i.d. erasure model in which each transmitted packet is erased independently with the same probability; the objective is to maximize the decoding probability for a given message size. We derive an upper bound on the decoding probability for any time-invariant code, and show that the gap between this bound and the performance of a family of time-invariant intrasession codes is small when the message size and packet erasure probability are small. In a simulation study, these codes performed well against a family of random time-invariant convolutional codes under a number of scenarios.

Finally, we consider the joint problems of routing and caching for named data networking. We propose a backpressure-based policy that employs virtual interest packets to make routing and caching decisions. In a packet-level simulation, the proposed policy outperformed a basic protocol that combines shortest-path routing with least-recently-used (LRU) cache replacement.

Stability of Electrode-Electrolyte Interfaces during Charging in Lithium Batteries

In this thesis we study the growth of a Li electrode-electrolyte interface in the presence of an elastic prestress. In particular, we focus our interest on Li-air batteries with a solid electrolyte, LIPON, which is a new type of secondary or rechargeable battery. Theoretical studies and experimental evidence show that during the process of charging the battery the replated lithium adds unevenly to the electrode surface. This phenomenon eventually leads to dendrite formation as the battery is charged and discharged numerous times. In order to suppress or alleviate this deleterious effect of dendrite growth, we put forth a study based on a linear stability analysis. Taking into account all the mechanisms of mass transport and interfacial kinetics, we model the evolution of the interface. We find that, in the absence of stress, the stability of a planar interface depends on interfacial diffusion properties and interfacial energy. Specifically, if Herring-Mullins capillarity-driven interfacial diffusion is accounted for, interfaces are unstable against all perturbations of wavenumber larger than a critical value. We find that the effect of an elastic prestress is always to stabilize planar interfacial growth by increasing the critical wavenumber for instability. A parametric study results in quantifying the extent of the prestress stabilization in a manner that can potentially be used in the design of Li-air batteries. Moreover, employing the theory of finite differences we numerically solve the equation that describes the evolution of the surface profile and present visualization results of the surface evolution by time. Lastly, numerical simulations performed in a commercial finite element software validate the theoretical formulation of the interfacial elastic energy change with respect to the planar interface.