Abstract: 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.

Abstract: An apparatus includes a network node configured to communicate with other network nodes via a communication network. The network node includes a plurality of transceivers and a controller. The controller includes a link management module and a packet management module. The link management module is configured to produce link profiles associated with communication links available to the network node, wherein a link profile indicates link characteristics that include a busy indication of a transceiver. The packet management module is configured to identify a link profile solution set that includes a set of link profiles corresponding to communication links for multicasting the message packet, map the link profiles of the link profile solution set to at least a portion of the plurality of transceivers, and initiate transmission of the message packet using the communication links corresponding to the link profile solution set.

Abstract: Embodiments of a system and method for finding optimal routes for simultaneous transmissions over broadcast medium are generally described herein. In some embodiments, nodes are placed into a cost matrix representing a connected graph of nodes, virtual nodes are identified by applying matrix operations to the cost matrix and backtracking is performed incrementally to build candidates of virtual nodes for a solution set from the identified virtual nodes and to eliminate unsuitable candidates.

Abstract: Embodiments of a system and method for providing frequency assignment with managed transceiver resources. A frequency assignment protocol manages transceiver resources in making channel assignment decisions based on a number of links and state of transceivers. Long-term traffic patterns are captured and transceiver resource decisions are made based on an analysis of the captured long-term traffic patterns to increase a selected metric, such as connectivity, capacity or any other measurable quantity.

Abstract: An apparatus includes a network node configured to communicate with other network nodes via a communication network. The network node includes a plurality of transceivers and a controller. The controller includes a packet management module that identifies a link profile solution set that includes a set of link profiles corresponding to communication links for multicasting the message packet. The link profile solution set maximizes coverage of network target nodes of the multicast message packet. The packet management module places a first message clone of the message packet in a transceiver queue for transmission to one or more of the network target nodes, updates the link profile solution set when the first message clone reaches the end of the transceiver queue, and initiates transmission of the first message clone or drop the first message clone according to the updated link profile solution set.

Abstract: 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.

Abstract: 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.

Abstract: Embodiments of a system and method for finding optimal routes for simultaneous transmissions over broadcast medium are generally described herein. In some embodiments, nodes are placed into a cost matrix representing a connected graph of nodes, virtual nodes are identified by applying matrix operations to the cost matrix and backtracking is performed incrementally to build candidates of virtual nodes for a solution set from the identified virtual nodes and to eliminate unsuitable candidates.

Abstract: A system, method and apparatus arranged for efficient usage of network resources. Embodiments include nodes linked together, and the links having differing costs, e.g., bandwidth, frequency, and/or monetary cost, or any combination of these. Embodiments may identify neighboring nodes as either next-hop-neighbors or non-next-hop-neighbors. Next-hop-neighbors lie on the shortest path to any node, while non-next-hop-neighbors are nodes linked directly to a node, but the link is more costly than an alternative multi-hop path to the same node. Accordingly, embodiments may suppress packets to the non-next-hop-neighbors.

Abstract: Embodiments for providing channel assignments for high density multi-channel multi-radio (MC-MR) wireless networks are generally described herein. In some embodiments, N nodes are provided in the network. T transceiver node groups are provided that include a first number of groups of nodes, wherein the first number of groups of nodes for a first of the T transceiver node groups have the N nodes assigned consecutively with a second number of nodes per each of the groups of nodes being a function of N. The first number of group of nodes for a remaining number of the transceiver node groups comprises N nodes with transceivers arranged to provide access to any node within a predetermined number of hops. The arrangement of the second number of nodes per each of the groups of nodes in the T transceiver node groups provides an optimized throughput per node.

Abstract: Embodiments of a system and method for managing transceiver resources in a wireless network are generally described herein. In some embodiments, a transceiver resource manager (MXRM) dynamically adapts the number of transceivers to an offered load. A node computes the number of transceiver it needs based on queue depth and queue usage. MXRM then shares the number of the transceivers to be requested, A, with next-hop neighbors. A node assigns X transceivers such that X is the maximum of their own A value and the highest A value they receive if they are next-hop targets. MXRM processes requests for additional transceivers from nodes and previous-hop neighbors such that the sender-receiver pair assigns a compatible number of transceivers. MXRM is also used to drive frequency assignments to increase capacity along the traffic flows. Therefore, MXRM adapts transceiver assignments to the traffic paths.

Abstract: Embodiments of a system and method for providing frequency assignment with managed transceiver resources. A frequency assignment protocol manages transceiver resources in making channel assignment decisions based on a number of links and state of transceivers. Long-term traffic patterns are captured and transceiver resource decisions are made based on an analysis of the captured long-term traffic patterns to increase a selected metric, such as connectivity, capacity or any other measurable quantity.

Abstract: A system, method and apparatus arranged for efficient usage of network resources. Embodiments include nodes linked together, and the links having differing costs, e.g., bandwidth, frequency, and/or monetary cost, or any combination of these. Embodiments may identify neighboring nodes as either next-hop-neighbors or non-next-hop-neighbors. Next-hop-neighbors lie on the shortest path to any node, while non-next-hop-neighbors are nodes linked directly to a node, but the link is more costly than an alternative multi-hop path to the same node. Accordingly, embodiments may suppress packets to the non-next-hop-neighbors.

Abstract: An apparatus includes network node configured to communicate with other network nodes via a communication network. The network node includes a plurality of transceivers and a controller. The controller includes a link management module and a packet management module. The link management module is configured to produce link profiles associated with communication links available to the network node, wherein a link profile indicates link characteristics of a communication link. The packet management module is configured to identify a link profile solution set that includes a set of link profiles corresponding to communication links for multicasting the message packet, map the link profiles of the link profile solution set to at least a portion of the plurality of transceivers, and initiate transmission of the message packet using the communication links corresponding to the link profile solution set.

Abstract: An apparatus includes a network node configured to communicate with other network nodes via a communication network. The network node includes a plurality of transceivers and a controller. The controller includes a packet management module that identifies a link profile solution set that includes a set of link profiles corresponding to communication links for multicasting the message packet. The link profile solution set maximizes coverage of network target nodes of the multicast message packet. The packet management module places a first message clone of the message packet in a transceiver queue for transmission to one or more of the network target nodes, updates the link profile solution set when the first message clone reaches the end of the transceiver queue, and initiates transmission of the first message clone or drop the first message clone according to the updated link profile solution set.

Abstract: Systems and methods are disclosed herein for multicasting a data packet through a wireless network. The method includes a packet metadata which maintains a set of next-hop nodes on the routing path as well as the assigned destination nodes of the packet. In addition, each node maintains only a single self-rooted forwarding tree for determining the routing path. By using the metadata in conjunction with a single forwarding tree at each node, the method introduces a highly scalable alternative to multicast protocols based on link state routing source-based trees while substantially reducing the processor load. Furthermore, the method does not require a consistent view of the network topology, making it useful in mobile scenarios. Also included is a mechanism to minimize the packet metadata size for minimal impact to performance while supporting arbitrarily large multicast group sizes.

Abstract: 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.

Abstract: 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.

Abstract: 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.