Patents by Inventor Muriel Médard

Muriel Médard has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method and Apparatus for Secure Communication
    Publication number: 20160154970
    Abstract: Secrecy scheme systems and associated methods using list source codes for enabling secure communications in communications networks are provided herein. Additionally, improved information-theoretic metrics for characterizing and optimizing said secrecy scheme systems and associated methods are provided herein. One method of secure communication comprises receiving a data file at a first location, encoding the data file using a list source code to generate an encoded file, encrypting a select portion of the data file using a key to generate an encrypted file, and transmitting the encoded file and the encrypted file to an end user at a destination location, wherein the encoded file cannot be decoded at the destination location until the encrypted file has been received and decrypted by the end user, wherein the end user possesses the key.
    Type: Application
    Filed: March 13, 2014
    Publication date: June 2, 2016
    Inventors: Flavio du Pin Calmon, Muriel Medard, Linda M. Zeger, Mark M. Christiansen, Kenneth R. Duffy
  • Energy-efficient time-stampless adaptive nonuniform sampling
    Patent number: 9294113
    Abstract: Described herein is a sampling system and related sampling scheme. The system and sampling scheme is based upon a framework for adaptive non-uniform sampling schemes. In the system and schemes described herein, time intervals between samples can be computed by using a function of previously taken samples. Therefore, keeping sampling times (time-stamps), except initialization times, is not necessary. One aim of this sampling framework is to provide a balance between reconstruction distortion and average sampling rate. The function by which sampling time intervals can be computed is called the sampling function. The sampling scheme described herein can be applied appropriately on different signal models such as deterministic or stochastic, and continuous or discrete signals. For each different signal model, sampling functions can be derived.
    Type: Grant
    Filed: July 5, 2012
    Date of Patent: March 22, 2016
    Assignee: Massachusetts Institute of Technology
    Inventors: Soheil Feizi-Khankandi, Vivek K. Goyal, Muriel Médard
  • Wireless reliability architecture and methods using network coding
    Patent number: 9271123
    Abstract: Network-coding-enabled reliability architectures and techniques are provided that are capable of enhancing data transfer reliability and efficiency in next generation wireless networks. In some embodiments, the techniques and architectures utilize a flexible thread-based coding approach to implement network coding. The techniques and architectures may also, or alternatively, utilize systematic intra-session random linear network coding as a packet erasure code to support reliable data transfer.
    Type: Grant
    Filed: August 29, 2013
    Date of Patent: February 23, 2016
    Assignee: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Muriel Medard, Xiaomeng Shi, Marie-Jose Montpetit, Surat Teerapittayanon, Kerim Fouli
  • Wireless reliability architecture and methods using network coding
    Patent number: 9253608
    Abstract: Network-coding-enabled reliability architectures and techniques are provided that are capable of enhancing data transfer reliability and efficiency in next generation wireless networks. In some embodiments, the techniques and architectures utilize a flexible thread-based coding approach to implement network coding. The techniques and architectures may also, or alternatively, utilize systematic intra-session random linear network coding as a packet erasure code to support reliable data transfer.
    Type: Grant
    Filed: August 29, 2013
    Date of Patent: February 2, 2016
    Assignee: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Muriel Medard, Xiaomeng Shi, Marie-Jose Montpetit, Surat Teerapittayanon, Kerim Fouli
  • Method And Apparatus For Performing Finite Memory Network Coding In An Arbitrary Network
    Publication number: 20160006676
    Abstract: Techniques for performing finite memory network coding in an arbitrary network limit an amount of memory that is provided within a node of the network for the performance of network coding operations during data relay operations. When a new data packet is received by a node, the data stored within the limited amount of memory may be updated by linearly combining the new packet with the stored data. In some implementations, different storage buffers may be provided within a node for the performance of network coding operations and decoding operations.
    Type: Application
    Filed: September 2, 2015
    Publication date: January 7, 2016
    Inventors: Bernhard Haeupler, Muriel Medard
  • Secure Network Coding for Multi-Resolution Wireless Transmission
    Publication number: 20150372809
    Abstract: Described herein is a method and system for hierarchical wireless video with network coding which limits encryption operations to a critical set of network coding coefficients in combination with multi-resolution video coding. Such a method and system achieves hierarchical fidelity levels, robustness against wireless packet loss and efficient security by exploiting the algebraic structure of network coding.
    Type: Application
    Filed: August 10, 2015
    Publication date: December 24, 2015
    Inventors: Luisa Lima, Steluta Gheorghiu, Joao Barros, Muriel Medard, Alberto Lopez Toledo, Joao Vilela
  • Network Coding for Multi-Resolution Multicast
    Publication number: 20150365724
    Abstract: A method, apparatus and computer program product for utilizing network coding for multi-resolution multicast is presented. A network source partitions source content into a base layer and one or more refinement layers. The network source receives a respective one or more push-back messages from one or more network destination receivers, the push-back messages identifying the one or more refinement layers suited for each one of the one or more network destination receivers. The network source computes a network code involving the base layer and the one or more refinement layers for at least one of the one or more network destination receivers, and transmits the network code to the one or more network destination receivers in accordance with the push-back messages.
    Type: Application
    Filed: August 25, 2015
    Publication date: December 17, 2015
    Applicant: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Daniel Lucani, Minji Kim, Fang Zhao, Xiaomeng Shi, Muriel Medard, Marie-Jose Montpetit
  • Traffic Backfilling Via Network Coding In A Multi-Packet Reception Network
    Publication number: 20150365222
    Abstract: Network coding and multiple packet reception (MPR) are used together to improve message dissemination speed in a wireless network using half duplex communication. In at least one embodiment, MPR is used to initially distribute data packets from a number of source nodes in the network to the other nodes of the network. Network coding techniques may then be used to perform backfilling within the network to supply data packets to the source nodes that were originally missed due to the half duplex constraint.
    Type: Application
    Filed: August 14, 2015
    Publication date: December 17, 2015
    Applicant: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Linda M. Zeger, Muriel Medard, Arman Rezaee
  • Method and Apparatus For Reducing Feedback and Enhancing Message Dissemination Efficiency in a Multicast Network
    Publication number: 20150358136
    Abstract: Message dissemination speed is increased during multicast operations in a network by intelligently selecting one or more feedback time slots for use by destination nodes. In at least one implementation, a feedback time slot is selected based upon probabilities that a plurality of data packets will be successfully distributed to a plurality of destination nodes by various future time slots. These probabilities may be estimated based on, for example, packet erasure probabilities in the network. In some implementations, only destination nodes that have not yet successfully received a plurality of data packets are permitted to transmit feedback during feedback time slots.
    Type: Application
    Filed: October 18, 2012
    Publication date: December 10, 2015
    Applicant: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Muriel Medard, Linda M. Zeger, Arman Rezaee
  • Joint Use Of Multi-Packet Reception And Network Coding For Performance Improvement
    Publication number: 20150358973
    Abstract: Network coding and multiple packet reception (MPR) are used together in a wireless network. In at least one implementation, a novel medium access control (MAC) protocol is provided that enhances throughput in a wireless mesh network that uses network coding and MPR by providing fairness to information flows, rather than fairness to individual nodes.
    Type: Application
    Filed: October 18, 2012
    Publication date: December 10, 2015
    Inventors: Linda M. Zeger, Jason M. Cloud, Muriel Medard
  • Coded Seeking Apparatus and Techniques for Data Retrieval
    Publication number: 20150348584
    Abstract: Data blocks to be stored on a disk-based data storage device (e.g., a hard disk drive, etc.) are coded together to form a plurality of linearly independent network coded blocks. The network coded blocks are then stored on the data storage device. Coded seeking may then be used to retrieve the original data blocks from the data storage device in a time-efficient manner. A read request may be sent to the data storage device requesting an innovative coded packet associated with the original data blocks. In response to the read request, the data storage device may read an innovative coded packet from the disk that is closest to current position of a read element of the device.
    Type: Application
    Filed: March 25, 2015
    Publication date: December 3, 2015
    Inventors: Muriel Medard, Ulric J. Ferner
  • Partial packet recovery in wireless networks
    Patent number: 9203441
    Abstract: Systems and methods for improved packet throughput using partial packets are provided in which data recovery of partial packets of a plurality of received coded packets is performed across the plurality of received coded packets. The plurality of received coded packets, including the received partial packets, can be buffered in a memory and used in recovering the data for the partial packets. As soon as the total number of received packets (including valid and partial) becomes greater than the generation size, a decoding process can be attempted utilizing the partial packets as part of the redundancy used for data recovery. During the decoding process, the received packets are evaluated across packets instead of on a per-packet basis.
    Type: Grant
    Filed: May 30, 2012
    Date of Patent: December 1, 2015
    Assignee: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Georgios Angelopoulos, Muriel Medard, Anantha P. Chandrakasan
  • Wireless reliability architecture and methods using network coding
    Patent number: 9185529
    Abstract: Network-coding-enabled reliability architectures and techniques are provided that are capable of enhancing data transfer reliability and efficiency in next generation wireless networks. In some embodiments, the techniques and architectures utilize a flexible thread-based coding approach to implement network coding. The techniques and architectures may also, or alternatively, utilize systematic intra-session random linear network coding as a packet erasure code to support reliable data transfer.
    Type: Grant
    Filed: August 16, 2013
    Date of Patent: November 10, 2015
    Assignee: Massachusetts Institute of Technology
    Inventors: Muriel Medard, Xiaomeng Shi, Marie-Jose Montpetit, Surat Teerapittayanon, Kerim Fouli
  • Random Linear Coding Approach To Distributed Data Storage
    Publication number: 20150304419
    Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.
    Type: Application
    Filed: July 1, 2015
    Publication date: October 22, 2015
    Inventors: Muriel Medard, Supratim Deb, Ralf Koetter
  • Random linear coding approach to distributed data storage
    Patent number: 9165013
    Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.
    Type: Grant
    Filed: November 16, 2012
    Date of Patent: October 20, 2015
    Assignee: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Muriel Medard, Supratim Deb, Ralf Koetter
  • Method and apparatus for performing finite memory network coding in an arbitrary network
    Patent number: 9160687
    Abstract: Techniques for performing finite memory network coding in an arbitrary network limit an amount of memory that is provided within a node of the network for the performance of network coding operations during data relay operations. When a new data packet is received by a node, the data stored within the limited amount of memory may be updated by linearly combining the new packet with the stored data. In some implementations, different storage buffers may be provided within a node for the performance of network coding operations and decoding operations.
    Type: Grant
    Filed: February 7, 2013
    Date of Patent: October 13, 2015
    Assignee: Massachusetts Institute of Technology
    Inventors: Bernhard Haeupler, Muriel Medard
  • Method for coding-based, delay-efficient data transmission
    Patent number: 9160440
    Abstract: A method, apparatus and computer program product for -based, delay-efficient data transmission for broadcasting a single file is presented. A file (f) comprised of K packets to be broadcast to a plurality of receivers is determined. A plurality of packets (Pk) of the file are selected for transmission during a timeslot (t). Next, a linear combination of the selected packets (P[t]) are produced, the linear combination of packets are selected at random within the file. The linear combination of selected packets is then transmitted to a plurality of receivers over unreliable channels.
    Type: Grant
    Filed: May 31, 2007
    Date of Patent: October 13, 2015
    Assignee: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Muriel Medard, Atilla Eryilmaz, Asuman Ozdaglar
  • Network coding for multi-resolution multicast
    Patent number: 9148291
    Abstract: A method, apparatus and computer program product for utilizing network coding for multi-resolution multicast is presented. A network source partitions source content into a base layer and one or more refinement layers. The network source receives a respective one or more push-back messages from one or more network destination receivers, the push-back messages identifying the one or more refinement layers suited for each one of the one or more network destination receivers. The network source computes a network code involving the base layer and the one or more refinement layers for at least one of the one or more network destination receivers, and transmits the network code to the one or more network destination receivers in accordance with the push-back messages.
    Type: Grant
    Filed: May 14, 2013
    Date of Patent: September 29, 2015
    Assignee: Massachusetts Institute of Technology
    Inventors: Daniel Lucani, Minji Kim, Fang Zhao, Xiaomeng Shi, Muriel Medard, Marie-Joseph Montpetit
  • Traffic backfilling via network coding in a multi-packet reception network
    Patent number: 9143274
    Abstract: Network coding and multiple packet reception (MPR) are used together to improve message dissemination speed in a wireless network using half duplex communication. In at least one embodiment, MPR is used to initially distribute data packets from a number of source nodes in the network to the other nodes of the network. Network coding techniques may then be used to perform backfilling within the network to supply data packets to the source nodes that were originally missed due to the half duplex constraint.
    Type: Grant
    Filed: October 18, 2012
    Date of Patent: September 22, 2015
    Assignee: Massachusetts Institute of Technology
    Inventors: Linda M. Zeger, Muriel Medard, Arman Rezaee
  • Secure network coding for multi-resolution wireless transmission
    Patent number: 9137492
    Abstract: Described herein is a method and system for hierarchical wireless video with network coding which limits encryption operations to a critical set of network coding coefficients in combination with multi-resolution video coding. Such a method and system achieves hierarchical fidelity levels, robustness against wireless packet loss and efficient security by exploiting the algebraic structure of network coding.
    Type: Grant
    Filed: March 15, 2013
    Date of Patent: September 15, 2015
    Assignee: Massachusetts Institute of Technology
    Inventors: Luisa Lima, Steluta Gheorghiu, Joao Barros, Muriel Medard, Alberto Lopez Toledo, Joao Vilela