Raytheon Company

Park, Sung

Johnnie, Darryn A.

Sung I Park

Darryn A Johnnie

Denh T Sy

Tyler J Ulinskas

Erwin Ward Bathrick, Iii

Daniel R Cormier

Michael A Born

Colleen M Touchard

Keith C Buerger

Tracy V Cramer

Methods for determining paths that satisfy a reliability requirement are generally described herein. The methods may include receiving path information. A reliability requirement is established, and paths that satisfy the reliability requirement are determined. Each path comprises nodes. Configuration of the nodes of the paths according to the reliability requirement is facilitated. A code rate may be determined that corresponds to the reliability requirement. The code rate may indicate network coding to be performed by least a subset of the nodes. The method may also include sending the code rate to the nodes of the paths.

Determining paths that satisfy a reliability requirement

In one aspect, a method includes scheduling network communications in a network comprising nodes connected by links, receiving at a first node updated bandwidth values from the other nodes, determining a cluster coefficient based on a number of one-hop neighbors of the first node and a number of neighbors N-hops and less of the first node, adjusting the cluster coefficient to form an adjusted cluster coefficient and determining a wait period based on the adjusted cluster coefficient. The method also includes implementing the updated bandwidth values received to determine updated node weight values of the other nodes after the wait period has expired.

Communication scheduling of network nodes using a cluster coefficient

In one aspect, a method to multicast in a network includes determining using a processor a least amount of relay nodes for use in multicasting a message to nodes in the network by using a neighbor matrix of a source node used in Node Activation Multiple Access (NAMA) scheduling. The method may include designating a one-hop neighbor that exclusively accesses the two-hop neighbor of the source node as a relay node. The method may also include designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node.

Multicasting in a network using neighbor information

In one aspect, a method to schedule network communications includes transmitting a node identification associated with a first node joining a network over a first portion of control timeslots based on a first probability, detecting nodes in the network using a second portion of the control timeslots and receiving acknowledgments from at least one of the nodes in the network. The method also includes that if a ratio of a number of acknowledgments received to a number of the nodes in the network detected is greater than a predetermined percentage: transmitting control data over the first portion of the control timeslots based on a second probability associated with a number of the nodes detected and transmitting data over the second portion of the control timeslots based on a network schedule.

Communication scheduling of network nodes

A method to schedule network communications includes determining nodes within a network, forming a node list based on the nodes in the network, determining a network schedule of communications for the nodes based on the node list. Determining a network schedule includes determining a timeslot. Each node receives data during the timeslot.

Growing community of inventors

Irvine, CA, United States of America

Sung I Park