Bae Systems Information and Electronic Systems Integration Inc.

Phong C Khuu

Jessica Y Hsu

Reza Ghanadan

John Gu

Gregory S Sadosuk

Brian D Loop

Matthew J Sherman

Michael J Weber

Keith Faulk Conner

Kevin M McNeill

David Claypool

Tim McNevin

Apurva N Mody

Ranga Reddy

Thomas Kiernan

Dan E Dudgeon

Ghanadan Reza

Qui M Le

Kevin McNeil

Systems and methods provide adaptability in a mobile ad hoc network (MANET), based on an existing protocol, such as adaptive hybrid domain routing (AHDR). The systems and methods are especially suited for fast changing topologies that may change after a reactive route discovery has been completed.

Topology aware MANET for mobile networks

The present invention relates to a system and method for providing channel access synchronization in a time division multiple access (TDMA) multi-hop network employing a plurality of time slots defined within a frame structure which repeats. The system and method includes nodes which have local clock variables. The local clock variables generate an expected arrival time of signals from other nodes in the network. Each node then determines whether the local clock variable needs adjusting after receiving a transmission and comparing the expected arrival time with the actual arrival time. Thus, time synchronization across the network is distributed and updated locally at each node. Networks may be merged by casting out nodes in one network and joining those cast out nodes with the other network. Newly joined nodes are thereafter time synchronized into their new network by comparing actual and expected arrival times and updating their clock accordingly.

System and method to provide channel access synchronization without time-stamp exchange in time division multiple access (TDMA) multi-hop networks

A node in a wireless communication network comprises a processor that receives information regarding a first plurality of packets to be transmitted in an epoch, a first path of nodes for the first plurality of packets, and a first flow rate. The processor receives information regarding a second plurality of packets to be transmitted in the epoch, a second path of nodes for the second plurality of packets, and a second flow rate. The processor determines weights for the paths based on the flow rates. The processor assigns pipelines for the paths and creates groups of pipelines based on the weights. The groups may be assigned to a schedule.

System and method for assigning time slots for transmission of packets in a wireless communication network utilizing knowledge of a data path

Various cognitive communications system architectures and their corresponding Protocol Reference Models (PRMs) are disclosed. Such PRMs incorporate a Cognitive Plane in addition to conventional Data and Management Planes. The additional Cognitive Plane functionality may include, for example, spectrum sensing, spectrum management, geolocation, and security functions. The Cognitive Plane may further include a Policy Engine and a Learning and Reasoning Module. In some embodiments, Management Plane functions may be effectively combined to form a database of primitives (and their respective values) called a Management Information Base (MIB). In addition, techniques are provided by which various components of cognitive and non-cognitive, as well as mesh-enabled and non-mesh-enabled nodes in a network, inter-operate with each other. The architectures allow a Spectrum Manager (or Signal Space Manager) to combine information from various network layers (e.g., PHY/MAC Layers, Spectrum Sensing Function, Geolocation Function, and/or Security Sublayers), and to make informed decisions on spectrum utilization.

Protocol reference model, security and inter-operability in a cognitive communications system

Wireless medium access in a communication network having a number of terminals is controlled by defining protocol message units for transmission by a given terminal which units correspond to operational states of at least one of the terminal and the medium. A number of time slots are allocated for transmission of packets from each terminal, and a number of contention opportunities are defined at the beginning of each time slot. Priority and backoff mechanisms are defined and applied at each terminal during the contention opportunities in the slots. Packets are then transmitted by the terminal within the slots while (1) minimizing the occurrence of empty slots at times when packets are available for transmission, and (2) minimizing the number of slots during which two or more packets are detected on the medium simultaneously at the terminal.

Contention protocols for wireless medium access in communication networks

A process and system for enhancing connectivity among nodes of a wireless communications network by adapting to changes in the network topology. Nodes of the network are configured to operate according to either (i) an ad hoc protocol wherein a given node assumes a role of a mesh node capable of connecting with other like-configured nodes, or (ii) a point-to-multipoint protocol wherein the given node assumes a role of either a base station, or a subscriber station being served by another node which is assuming the role of a base station. A determination is made as to whether each node should operate according to the ad hoc protocol or the point-to-multipoint protocol, in order to maintain an optimum state of connectivity among all nodes of the network. The determined operating protocol is then implemented for each node.

Enhancement of node connectivity in a wireless communications network with changing topology via adaptive role changing

A method and apparatus is provided for using a distributed multi-path QoS-aware routing scheme that considers basic MANET characteristics to meet transport service requirements of real-time applications and makes use of multiple discovered paths to calculate a next-hop decision. The QoS Routing scheme superimposes distributed neighborhood congestion, neighborhood density, and link stability and delay information over the multiple discovered paths when the next-hop decision is calculated.

Growing community of inventors

Ashburn, VA, United States of America

Phong C Khuu