Patent application number | Description | Published |
20090003216 | Multipath Forwarding Algorithms Using Network Coding - A method of transmitting data across a wireless mesh network is described which uses network coding at each of the intermediate nodes between the source node and the destination node. Each intermediate node also controls the rate at which it broadcasts packets based on link congestion and the backlog of packets at each of the possible next-hop nodes for the data flow. | 01-01-2009 |
20090122700 | Spectrum and medium access allocation for fairness - Each node or link of an ad hoc network assists in the distributed allocation of a data channel to increase fairness, even in a multi-hop network, by tracking a measure of link weight for itself and sharing this information over a control channel with neighboring nodes. The metric can be provided over a dedicated control channel, added as a header to data communication on a data channel, or inferred by monitoring data traffic from the neighboring node. The link weight can be adjusted by a link quality factor based on provided or inferred metrics such as transmission rates, ratio of transmission errors, idle time, etc. For multiple flow queues at a subject node, one with a higher transmission rate can be selected for increased fairness. When a packet is received, medium access includes allocating bandwidth, including bonding multiple frequencies that are determined to be available to both nodes. | 05-14-2009 |
20090124205 | PHYSICAL AND MAC ADAPTATION FOR INTERFERENCE MITIGATION WITH COGNITIVE RADIO - A communication device cognitively monitors interference signals across a communication band so that adaptations for physical and medium access control (MAC) of data packet transmissions are appropriate for a particular interference signal. Characteristics of an interference signal of interest (e.g., bandwidth, power and/or duration relative to an average data packet transmitted over a communication channel of the communication device) are sensed for an appropriate adaptation (e.g., forward error correction, modulation technique, back off, request to send/clear to send protocol, etc.). Patterns for known types of interference sources can be compared so that when recognized an associated adaptation can be used. | 05-14-2009 |
20100027424 | Path Estimation in a Wireless Mesh Network - Methods and algorithms for path estimation in a wireless mesh network are described. In an embodiment, each node calculates its cost for a packet flow based on the back-log at the node and the cost of downstream neighbor nodes for the flow. The cost is communicated to the upstream neighbor nodes for the flow. When a node has an opportunity to transmit a packet, a flow is selected by the node based on the back-log at the node and the costs received from each of the downstream neighbor nodes. These costs are then also used to select a downstream neighbor node is selected based on the costs received from each of the downstream neighbor nodes. A packet re-ordering algorithm is also described which intercepts packets received at a node and delays delivery of the packet to the IP layer if an earlier packet in the sequence of packets has not been received. | 02-04-2010 |
20100232324 | Full-Duplex Wireless Communications - Full-duplex wireless communication is described. In an embodiment, a transceiver device having a transmitter circuit and a receiver circuit receives a data packet sent over a shared communication medium. In the embodiment, the transceiver reads the header of the data packet and starts transmitting an output signal on the same shared communication medium. Embodiments are described in which, whilst the transmission of the output signal is ongoing, the transceiver receives an impaired data signal which is made up of the payload of the data packet and interference from the output signal. In the embodiment, a cancellation signal is derived from the output signal, and this is combined with the impaired data signal to remove the interference and recover the payload of the data packet. | 09-16-2010 |
20110299408 | Dynamic Channel and Transmission Rate Selection - Dynamic channel and transmission rate selection is described. In an example, a communication resource for transmitting data to a receiver is selected from several channels, each having several associated rates. The selection comprises storing a weighting factor for each channel/rate combination, monitoring transmission performance on a selected channel and rate, and inferring performance for other rates on the selected channel from the monitored performance. Each weighting factor is then updated using the monitored and inferred performances, and used to select a channel/rate combination for subsequent transmission. In another example, a communication device comprises a transmitter, a processor, and a memory arranged to store a weighting factor associated with each receiver, channel and rate combination. The transmitter sends data to a receiver using one channel and rate, and the processor monitors the performance, updates the weighting factors accordingly, and selects a receiver, channel and rate combination for subsequent transmission. | 12-08-2011 |
20110310735 | Resource Allocation Framework for Wireless/Wired Networks - A resource allocation framework for wireless/wired networks is described. In an embodiment, methods of end host based traffic management are described which operate separately from the underlying access control protocol within the network (e.g. wireless MAC protocol or TCP). The rate limits for each flow are set based on per-flow weights, which may be user specified, and based on an estimate of the utilization of the shared resource and the rate limits are adjusted periodically so that the resource is not underutilized or saturated. Some embodiments compute a virtual capacity of the resource which is adjusted to optimize the value of the utilization and then the virtual capacity is shared between flows according to the per-flow weights. Methods for estimating the utilization of a wireless network and the capacity of a broadband access link are also described. | 12-22-2011 |
20120294232 | SHORT-RANGE NODES WITH ADAPTIVE PREAMBLES FOR COEXISTENCE - Wireless protocols in the unlicensed spectrum are developed for different requirements in terms of transmit range and power, which makes it difficult for multiple nodes having disparate transmit ranges to coexist in the same unlicensed spectrum. A short-range wireless node uses adaptive preambles to signal presence to long-range wireless nodes outside of its transmit range. In addition, a long-range wireless node detects an adapter preamble and backs-off transmissions for reservation period dedicated to short-range nodes. | 11-22-2012 |
20120294233 | Long-Range Nodes with Adaptive Preambles for Coexistence - Wireless protocols in the unlicensed spectrum are developed for different requirements in terms of transmit range and power, which makes it difficult for multiple nodes having disparate transmit ranges to coexist in the same unlicensed spectrum. A short-range wireless node uses adaptive preambles to signal presence to long-range wireless nodes outside of its transmit range. In addition, a long-range wireless node detects an adapter preamble and backs-off transmissions for reservation period dedicated to short-range nodes. | 11-22-2012 |
20120320887 | WIRELESS COMMUNICATIONS - The claimed subject matter provides a method for wireless communications. The method includes transmitting, by a first node in a wireless network, a first preamble. The method also includes detecting, in parallel with transmitting the first preamble, a transmission of a second preamble. A second node in the wireless network transmits the second preamble. Additionally, the method includes determining a later start between the transmission of the first preamble and the transmission of the second preamble. The method further includes terminating transmission of the first preamble the determining indicates that the transmission of the first preamble started after the transmission of the second preamble. | 12-20-2012 |
20120321009 | MULTIPLE INDEPENDENT NARROW CHANNELS IN WIRELESS NETWORKS - A multiple independent narrow-channel wireless network and method for transmitting and received data over a wireless network using a fragmented frequency spectrum. The system and method uses a plurality of narrow wireless channels obtained from splitting a wide wireless channel. Each narrow channel performs sending, receiving, and carrier sensing. Moreover, each narrow channel is independent such that data can be sent or received without any interference from other narrow channels and without synchronization. Embodiments of the system and method include a compound radio having a compound receiver and a compound transmitter. The compound transmitter includes an inter-radiolet symbol synchronization module, to permit use of a single inverse fast Fourier transform block, and a dynamically configurable filter array, to mitigate leakage between channels. The compound receiver uses fraction data rate processing to optimize efficiency. A throughput maximal metric technique is used to determine its frequency of operation in white spaces. | 12-20-2012 |
20130223262 | DYNAMIC CHANNEL AND TRANSMISSION RATE SELECTION - Dynamic channel and transmission rate selection is described. In an example, a communication resource for transmitting data to a receiver is selected from several channels, each having several associated rates. The selection comprises storing a weighting factor for each channel/rate combination, monitoring transmission performance on a selected channel and rate, and inferring performance for other rates on the selected channel from the monitored performance. Each weighting factor is then updated using the monitored and inferred performances, and used to select a channel/rate combination for subsequent transmission. In another example, a communication device comprises a transmitter, a processor, and a memory arranged to store a weighting factor associated with each receiver, channel and rate combination. The transmitter sends data to a receiver using one channel and rate, and the processor monitors the performance, updates the weighting factors accordingly, and selects a receiver, channel and rate combination for subsequent transmission. | 08-29-2013 |
20130246608 | COUNT TRACKING IN DISTRIBUTED ENVIRONMENTS - Count tracking in distributed environments is described, for example, as in data centers where many sites receive data and a coordinator node estimates a sum of the data received across the sites. Count tracking may be used in database applications, search engines, social networking applications and others. In various embodiments sites and a coordinator node work together to implement a process for summing data received at sites, where the sum takes into account both increments and decrements. In examples, a site decides whether to notify the coordinator node of a new data item according to a sampling probability that is related to an estimate of the current global sum of the data input across sites. In some examples a multi-mode algorithm is implemented which increases or decreases communication between the sites and the coordinator node according to behavior of the estimated global sum such that communications costs are optimized. | 09-19-2013 |
20140320497 | GRAPH PARTITIONING FOR MASSIVE SCALE GRAPHS - Graph partitioning for massive scale graphs is described, such as for graphs having vertices representing people and edges representing connections between people in a social networking system; or for graphs where the vertices represent other items and the edges represent relationships between the items. In various embodiments a graph data allocator receives a graph vertex and its edges and allocates the vertex to one of a plurality of clusters each associated with one or more computing devices. In various embodiments the allocation is made by optimizing an objective function which takes into account both a cost of edges between clusters and a cost related to sizes of the clusters. In some examples the cost related to sizes of the clusters comprises a convex function applied to each of the cluster sizes. In examples, computations on the graph data are carried out with reduced runtimes and communications cost. | 10-30-2014 |
20140348155 | MULTIPLE INDEPENDENT NARROW CHANNELS IN WIRELESS NETWORKS - A multiple independent narrow-channel wireless network and method for transmitting and received data over a wireless network using a fragmented frequency spectrum. The system and method uses a plurality of narrow wireless channels obtained from splitting a wide wireless channel. Each narrow channel performs sending, receiving, and carrier sensing. Moreover, each narrow channel is independent such that data can be sent or received without any interference from other narrow channels and without synchronization. Embodiments of the system and method include a compound radio having a compound receiver and a compound transmitter. The compound transmitter includes an inter-radiolet symbol synchronization module, to permit use of a single inverse fast Fourier transform block, and a dynamically configurable filter array, to mitigate leakage between channels. The compound receiver uses fraction data rate processing to optimize efficiency. A throughput maximal metric technique is used to determine its frequency of operation in white spaces. | 11-27-2014 |