Abstract: Systems and methods are provided for determining a number of spatial channels to use to transmit a data packet from a source node to a destination node. This determination can be made based on a Probability of Channel non-Correlation (PCC) function that is generated and updated by the source node based on feedback from the destination node. The PCC function indicates a probability of whether a plurality of spatial channels are non-correlated.

Abstract: Systems and methods are provided for determining a link metric for a communication link along a path between a source node to a destination node is provided. A node can generate a link metric (LM) for the communication link between the particular node and next-hop node towards the destination node in the path based on a plurality of variables. The node can determine the LM for the communication link based on a plurality of variables including: bandwidth on the communication link, a number of spatial streams used to transmit over the communication link, and a guard interval used used to transmit over the communication link.

Abstract: Systems and methods are provided for improving efficiency and reliability of broadcast transmission in a multi-hop wireless mesh communication network. When an intelligent access point (IAP) receives a broadcast packet (BP), the IAP can determine a list of downlink child mesh nodes (DLCMNs) of the IAP based on route information provided in its routing table. After the IAP knows its DLCMNs, the IAP can determine a first lowest data rate (LDR) between the IAP and each of its DLCMNs, and then re-transmit the BP at the first LDR. The BP is then received by at least one “parent” mesh node, which can then perform similar processing, and can then re-transmit the BP to its DLCMNs. This process repeats until the BP reaches a leaf mesh node. In other words, each mesh node can determine its DLCMNs, determine the LDR between itself and each of its DLCMNs, and can then re-transmit the BP at this LDR.

Abstract: Systems and methods are provided for improving efficiency and reliability of broadcast transmission in a multi-hop wireless mesh communication network. In some implementations, systems and methods are provided for a leaf mesh node to acknowledge reception of a broadcast packet broadcast by an Intelligent Access Point (IAP), and for allowing the IAP to determine whether to re-communicate the broadcast packet that it had previously re-transmitted when no acknowledgment is received from a leaf mesh node.

Abstract: A dynamic and distributive aggregation method in which a node determines the frame size of an aggregated frame based on or according to a transmission time of one or more of the received frames. This scheme to aggregate frames is based on the average packet size and average transmission time in the neighborhood. The method enables the aggregated packet size to dynamically change based on the neighborhood conditions. Usage of link rates and fair transmission time assignment enables the high data rate nodes to send more traffic but not to an extent of over-utilizing the channel thus achieving higher throughput efficiencies while maintaining fairness within a high data rate multi-hop wireless communication network.

Abstract: When a source node (SN) seeks to transmit a first communication stream (FCS) to a destination node (DN), a method is provided for allowing the SN to preempt a lower priority communication stream (LPCS). User priorities are supported during slot scheduling based on stream-identifiers (IDs) and stream priority values exchanged by each of the nodes. A scout request message (SRM), which includes a stream ID and a user priority value of the SN, is transmitted to a next-hop node along a route towards the DN. A node along the route determines if free time slots are available along the route to meet QoS requirements of the FCS, and if not, the node determines whether there is a LPCS in the neighborhood, and if so, the node frees the particular time slots currently being used by the LPCS, and allocates the particular time slots for the FCS.

Abstract: A hybrid TDMA-CSMA MAC protocol is provided for allocating time slots within a frame having a structure in which transmission time is divided into a first number of actual TDMA time slots and a second number of “virtual” CSMA time slots. Each time a given node receives a Hello message, it can calculate variables based on an HSN field. A ratio of the first number to the second number can be dynamically adjusted depending upon the traffic conditions. When TDMA time slots within the frame are freed (e.g., no longer being used), slot position optimization techniques are provided for moving these freed TDMA time slots back into the CSMA portion of the frame and reallocating or moving other TDMA time slots into the portion of the frame that was previously occupied by the freed TDMA time slots to thereby maximize resource utilization.

Abstract: Disclosed is a method for dynamically identifying locations of a plurality of mobile nodes in a time division multiple access (TDMA) based ad hoc communication network, wherein one or more mobile nodes are being moved in and out of a predefined region. The method comprises allocating a hello slot in a dedicated channel of the TDMA based ad hoc communication network to each of the mobile nodes and announcing the allocation to the mobile nodes through hello slot allocation map, receiving location information from each of the mobile nodes during their hello slot and determining mobile nodes that are inside the predefined region based on the received location information, allocating a data slot to each determined mobile nodes inside the predefined region and announcing the allocation to the mobile nodes through data slot allocation map, and receiving updated location information from each determined mobile nodes during their data slot.

Abstract: A hybrid TDMA-CSMA MAC protocol is provided for allocating time slots within a frame having a structure in which transmission time is divided into a first number of actual TDMA time slots and a second number of “virtual” CSMA time slots. Each of the nodes in a multi-hop network can transmit a Highest Slot Number (HSN) field. Each time one of the Hello messages is received from a neighbor node, a given node can calculate variables based on the HSN field. The given node can use these variables to calculate a ratio of the first number to the second number. This ratio can be dynamically adjusted depending upon the traffic conditions observed by nodes within the multi-hop ad hoc network at any particular time to thereby change the relative percentages of the frame which are allocated for a TDMA portion and a CSMA portion of the frame.

Abstract: In a network comprising a source, a destination, and intermediate nodes along a route between the source and the destination, techniques are provided for allocating one or more time slots to transmit a particular data stream along the route based on the QoS requirements to transmit the particular data stream. In one implementation, a Scout Request message (SRM) is sent from the source to the destination to allocate time slots along the route to transmit a particular data stream to the destination. The SRM can include QoS requirements to transmit the particular data stream. Each intermediate node along the route can allocate one or more time slots to transmit the particular data stream based on the QoS requirements needed to transmit the particular data stream along the route.

Abstract: In a network comprising a source, a destination, and intermediate nodes along a route between the source and the destination, techniques are provided for allocating one or more time slots to transmit a particular data stream along the route based on the QoS requirements to transmit the particular data stream. In one implementation, a Scout Request message (SRM) is sent from the source to the destination to allocate time slots along the route to transmit a particular data stream to the destination. The SRM can include QoS requirements to transmit the particular data stream. Each intermediate node along the route can allocate one or more time slots to transmit the particular data stream based on the QoS requirements needed to transmit the particular data stream along the route.