Raytheon Bbn Technologies Corp.

Verizon Corporate Services Group Inc.

Prithwish Basu

Jason Keith Redi

Subramanian Ramanathan

Christine Elaine Jones

William Nii Tetteh

Regina Rosales Hain

Rajesh Krishnan

Lillian Lei Dai

Richard Earl Hansen

Systems, methods and computer readable media consistent with the present invention address this and other needs by providing mechanisms for minimizing an energy cost within a wireless network having a plurality of nodes, including a plurality of transmitting nodes and a plurality of receiving nodes. An energy cost, including at least an overhearing cost, is determined. A transmission power assignment of a transmitting node is then adjusted to reduce the energy cost. These determining and adjusting stages are repeated to reduce the energy cost.

Systems, methods and computer readable media for energy conservation in sensor networks

A system may place nodes () within a non-biconnected network () that includes multiple interconnected nodes () to achieve biconnectivity within the network () and transform the network () from a non-biconnected one to a biconnected one. A non-biconnected network is one that necessarily becomes partitioned into two or more disconnected networks if a node in a critical position (termed a 'cutvertex' node) should fail or otherwise become unavailable. A biconnected network is one that includes at least one additional network link (sometimes termed an 'edge') between nodes belonging to each of the otherwise potentially disconnected networks for the purpose of maintaining network communication therebetween if and when the cutvertex node fails or otherwise becomes unavailable. To achieve biconnectivity, the system may identify one or more nodes () to move and determine the direction and distance to move the one or more nodes (). The system may then move the one or more nodes () in the determined direction and distance to transform the non-biconnected network () to a biconnected one.

Systems and methods for automatically placing nodes in an ad hoc network

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

In many aspects, the invention relates to systems and methods for synchronizing a communication network, particularly a slotted communication network, having a plurality of nodes. In slotted communication networks, the nodes are configured to transmit or receive data during selected time slots. During a selected time slot, each node transmits a synchronization message that is received by a neighboring node. The neighboring node adjusts its time slot boundary to coincide with the time of receipt of the synchronization message, thereby synchronizing each node with a neighboring node. Such systems and methods are energy efficient, accurate, fast, fault tolerant and easy to implement.

Growing community of inventors

Cambridge, MA, United States of America

Prithwish Basu