Learn More
Consider the following network communication setup, originating in a sensor networking application we refer to as the " sensor reachback " problem. We have a directed graph G = (V, E), where V = {v 0 v 1 ...v n } and E ⊆ V × V. If (v i , v j) ∈ E, then node i can send messages to node j over a discrete memoryless channel (X ij , p ij (y|x), Y ij), of(More)
—A coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes is presented 1. The messages are transmitted over punctured bits to hide data from eavesdroppers. It is shown by means of density evolution that the BER of an eavesdropper, who operates below the code's SNR threshold and has the ability to use a bitwise MAP(More)
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract—We propose a mechanism that incorporates network coding into TCP(More)
—This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of(More)
—A thorough understanding of the communications channel between vehicles is essential for realistic modeling of Vehicular Ad Hoc Networks (VANETs) and the development of related technology and applications. The impact of vehicles as obstacles on vehicle-to-vehicle (V2V) communication has been largely neglected in VANET research, especially in simulations.(More)
—Channel models for vehicular networks typically disregard the effect of vehicles as physical obstructions for the wireless signal. We aim to clarify the validity of this simplification by quantifying the impact of obstructions through a series of wireless experiments. Using two cars equipped with Dedicated Short Range Communications (DSRC) hardware(More)
— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. " nice but curious "). For this setup, which differs from wiretapping scenarios considered previously, we develop a natural algebraic(More)
—Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over independent packet erasure channels, we focus on the case of perfect feedback and heterogeneous erasure(More)
—The ability to exchange secret information is critical to many commercial, governmental, and military networks. Information -theoretic security—widely accepted as the strictest notion of security—relies on channel coding techniques that exploit the inherent randomness of the propagation channels to strengthen the security of digital communications systems.(More)