Raytheon Bbn Technologies Corp.

Gotenna Inc.

Verizon Corporate Services Group Inc.

Bbn Corporation

Raytheon Company

Verizon Patent and Licensing Inc.

Bbn Technologies Corporation

Bbnt Solutions Llc.

Subramanian Ramanathan

Christophe Servaes

Gregory Donald Troxel

Brig Barnum Elliott

Jason Keith Redi

William Nii Tetteh

Daniel Alan Coffin

Gentian Jakllari

John Robert Burgess

Ryan Edward Irwin

Seth Foster

Stephen Henry Polit

Ravindra Lambi

Jeffery Jay Logan

Joud Khoury

Charles T Hansen

Joseph Jacob Weinstein

William Scott Passman

Christine Elaine Jones

Marcos Antonio Bergamo

Michael Brandon Kremer

Isidro Marcos Castineyra

John Richard Zavgren, Jr

Prithwish Basu

Regina Rosales Hain

Christopher Paul Vander Valk

Cesar A Santivanez

Rajesh Krishnan

Richard Earl Hansen

Warren Ramanathan

A MANET protocol, comprising: receiving a data packet (DP) from a current sender (CS) by a recipient, defining: an identity of the CS, a prior sender (PS) from which CS received DP, and a target recipient (ID), a count (HC) of hops previously traversed by DP, and a sequence identifier (SI); updating a forwarding table (FT) to mark CS as being reachable in one hop, and PS as being reachable in two hops via CS as next hop; determining if ID is the recipient; determining whether to rebroadcast by recipient, if and only if the SI is not present in a list of prior SIs; and selectively rebroadcasting DP by recipient in dependence on said determining, modified by: replacement of CS with an identity of the recipient, PS with CS, and ID with a next hop from the FT if present, and incrementing HC.

Vine&#x2122;: zero-control routing using data packet inspection for wireless mesh networks

A mesh network protocol, comprising: receiving a packet from a sender, identifying the sender, a prior sender, a flood mode, a time-to-live, and a sequence identifier; marking the recipient as critical if during a full flood period, the recipient is the same as the prior sender, and marking the recipient as non-critical if no packet is received with the recipient the same as the prior sender; rebroadcasting the packet, modified by updating sender with the recipient, and sender as prior sender, decrementing the time to live until expiration, and, the identity of the recipient is different from the identity of the prior sender in full flood mode; or the identity of the recipient is different from the prior sender, and the recipient is critical, in partial flood mode.

System and method for efficient network-wide broadcast in a multi-hop wireless network using packet echos

A device, comprising a packet data interface port; a microcontroller, configured to control the packet data interface port, receive a input control signal through the packet data interface port, transmit a status report through the packet data interface port, and in dependence on the input control signal, produce an output control signal; and a radio frequency modification device, configured to modify a received radio frequency signal over a range selectively in dependence on the output control signal. A control processor, communicating through the packet data interface port with the microcontroller, may generate a plurality of the input control signals for a plurality of respective devices comprising the microcontroller and the radio frequency signal control device. The input control signals may be dynamically changed over time to emulate radio frequency conditions resulting from mobility of nodes in a mobile ad hoc radio frequency communication network.

Method and apparatus for modeling mobility and dynamic connectivity on a stationary wireless testbed

A system and method for managing congestion in a multi-hop wireless network, employing congestion notification messages. The technology has three main components: a mechanism at the Medium Access (MAC) layer for determining when a given source or transit node is deemed congested; a mechanism at the Network Layer (NL) determining how to propagate this information to applications, including suitably combining overload indications received from neighbors; and a mechanism at the Transport Layer (TL) of each source of traffic for determining when a source is generating excessive traffic, and combining it with Medium Access Control (MAC)-based overload indication from downstream nodes, thus providing a multi-layer approach to traffic throttling.

Method for utilization-based traffic throttling in a wireless mesh network

Vine: zero-control routing using data packet inspection for wireless mesh networks

Generally discussed herein are systems, devices, and methods for scheduling node performance of communication and/or function. A method can include receiving, from a plurality of nodes, parameters indicating a trajectory and position of each of the plurality of nodes, creating a directed communication graph, creating a communications conflict graph, creating a function conflict graph indicating which function performed by one node of the plurality of nodes interferes with at least one of a function and communication performed by another node of the plurality of nodes, creating a universal conflict graph based on the communications conflict graph and the function conflict graph, creating a schedule for communication and function performance for each of the nodes based on the universal conflict graph, and providing data indicative of the schedule to nodes of the plurality of nodes.

Scheduling access to a shared medium

The invention relates to systems and methods of operating a wireless network including allocating and assigning frequency channels using a dynamic and distributed process. For example, a network node in an ad hoc wireless network will assign frequency channels to one or more of its transceivers based on at least one of a list of allowed frequency channels and a neighbor-frequency channel list.

Distributed assignment of frequency channels to transceivers over dynamic spectrum

A system comprising a plurality of nodes forming a network and a link-state packet capable of being transmitted by a source node in the network to a destination node in the network over a communication link; wherein the source node subtracts a transmission cost associated with the communication link from a time-to-live value associated with the link-state packet prior to transmitting the link-state packet to the destination node. Each node in the network may be configured to use a routing protocol, such as a no-sight routing protocol, to assign the transmission cost to the communication link.

Variable translucency no-sight routing for ad-hoc networks

A system comprising a plurality of nodes forming a network, the plurality of nodes comprising source nodes and destination nodes; wherein a propagation limit restricts the travel of link-state information transmitted by the sources nodes to a subset of destination nodes within the network. A network-layer protocol provided at a layer above that of the network facilitates communication between nodes within and outside of this subset of nodes.

No-sight routing for ad-hoc networks

The systems and methods described herein include adaptive routing processes for packet-based wireless communication networks. This routing approach works both in MANETs (when a contemporaneous end-to-end path is available) and in DTNs (when a contemporaneous end to end path is not available, but one of formed over space and time). In particular, the methods include adaptively selecting a routing process for transmitting a packet through a node in the network based on available information on the network topology and/or the contents of the packet.

Systems and methods for adaptive routing in mobile ad-hoc networks and disruption tolerant networks

Variable translucency no-sight routing for AD-HOC networks

The systems and methods described herein include, among other things, processes for providing low latency packet transport in ad hoc networks. To this end, the systems, in certain embodiments, employ an architecture for communication nodes in MANETs, in which the delay introduced in 'routing' or 'relaying' the packet is reduced. In these systems invention, the data plane of the OSI stack at relay nodes is collapsed so that bits entering the node are re-energized &#x201c;on-the-fly&#x201d;, with only a brief pause. A transit key in each packet, inserted by the originator of the packet, is used to index into a transit table to determine one of three actions to perform&#x2014;drop, keep, or retransmit the packet. A control plane determines, for each packet, whether it should be re-energized or not. The control algorithm ensures that only nodes along the path from the source to the destination re-energize (relay) the packet.

Ultra-low latency packet transport in ad hoc networks

Growing community of inventors

Westford, MA, United States of America

Subramanian Ramanathan