Patent application number | Description | Published |
20080317044 | SEAMLESSLY SWITCHING OVERLAY NETWORK RELAY TREES - Technologies for switching a set of nodes in an overlay network from one relay tree configuration to another without duplicate packets or packet loss at any of the nodes. A commander node calculates a new relay tree as well as a media stream set configuration for each node in the overlay network, each media stream set corresponding to the new relay tree. Media stream sets include a unique version number or the like that identifies the specific relay tree configuration of which they are a part. Also provided are technologies for associating a media stream with a particular relay tree configuration and the corresponding media stream set of each node in the overlay network. | 12-25-2008 |
20090252146 | CONTINUOUS NETWORK CODING IN WIRELESS RELAY NETWORKS - Described is continuous network coding, in which a relay sends probability data comprising a continuous number for use as parity data. The node receives streams of bits sent from sources towards a destination, and computes the probability data based on current noise data and/or fading data. A selected set of the bits (all or some subset thereof) are combined, e.g., XOR-ed or concatenated, and send to the destination. Phase modulation is performed to convey probability information based on the probability data. The destination demodulates the signal to obtain the probability information, and combines the probability information with the data directly received from sources to perform joint decoding. The number of bits in the set of selected bits may be adaptively chosen based on current channel conditions, e.g., increased when the channel conditions from the sources directly to a destination are poor relative to the channel conditions via the relay. | 10-08-2009 |
20090279462 | STATEFUL SCHEDULING WITH NETWORK CODING FOR ROADSIDE-TO-VEHICLE COMMUNICATION - Described is a technology by which a roadside-to-vehicle communication system may be implemented, including via a stateful scheduling with network coding scheme that enhances network capacity. Moving vehicles request and receive data from a roadside access points. Each of the access points operate a stateful scheduling algorithm that serves multiple vehicles by integrating network coding within a timeslot. In one aspect, the state of each vehicle's previously received and retained data is obtained, and used to enhance network capacity by combining as many packets as possible for multiple recipients in network coding. | 11-12-2009 |
20090285148 | NATURAL NETWORK CODING FOR MULTI-HOP WIRELESS NETWORK - Described herein is technology for, among other things, natural network coding in a wireless mesh network. The technology involves wireless mesh network systems, methods and devices based on the natural network coding. By encoding signals in their natural forms using their channel strengths, more efficient transmission of signals is possible in the wireless mesh network. | 11-19-2009 |
20090296670 | PULL-BASED DATA TRANSMISSION APPROACH - A network can include a number of nodes that link a source node to a sink node. When a first node in a network sends a packet to its downstream node, this information is also received at its upstream node. In response to learning that the first node has sent a packet, the upstream node sends another packet to the first node. In essence, a pull-based transmission approach is used to mitigate congestion and address the funneling effect in data transmission networks such as wireless video sensor networks. | 12-03-2009 |
20100250678 | PEER-TO-PEER AIDED LIVE VIDEO SHARING SYSTEM - Video data from an upload client is received at a hosting node. A request from a download client is received at a bootstrapping node to receive the video data. The download client to receive the video data directly from the hosting node when the hosting node is below a threshold, wherein the threshold is based at least in part on the maximum number of download clients the hosting node can stream to simultaneously. The download client to receive the video data from peers in a peer-to-peer overlay when the hosting node above the threshold. | 09-30-2010 |
20150117537 | SCALED VIDEO FOR PSEUDO-ANALOG TRANSMISSION IN SPATIAL DOMAIN - Scaled video for pseudo-analog transmission in the spatial domain is described. Boundaries are determined for M L-shaped chunks of coefficients of at least one frequency-transformed video frame of a group of pictures (GOP). The boundaries are determined based at least on variances of the coefficients of the M L-shaped chunks, such as by reducing or minimizing the sum of the square roots of the variances of the coefficients. Corresponding power scale factors for the M L-shaped chunks are determined based at least partly on the variances of the coefficients of the M L-shaped chunks, and the coefficients of the M L-shaped chunks are scaled using the corresponding power scale factors. The pixel values of the frames (e.g., the frames in the spatial domain) are transmitted on a pseudo-analog channel. At the receiver, retained spatial redundancy enables denoising in the spatial domain prior to de-scaling in the frequency domain. | 04-30-2015 |
20150124908 | Fast Decoding based on ZigZag Deconvolution for Random Projection Code - Multi-level symbols generated by applying a Random Projection Code (RPC) to a source bit sequence are received at a receiver via a noisy channel. The received multi-level symbols are represented in a bipartite graph as constraint nodes connected via weighted edges to binary variable nodes that represent the source bit sequence. A decoder uses ZigZag deconvolution to generate constraint node messages as part of an iterative belief propagation to decode the source bit sequence from the received multi-level symbols. | 05-07-2015 |