Abstract: A method provides for selecting a communication interface towards an access point by a wireless communication device. The method includes receiving one or more HELLO messages from the access point; determining whether any of a plurality of communication links is being used to reach the access point by evaluating at least one field of each of the received HELLO messages; penalizing a link metric of a communication link when the communication link is being used; and selecting a communication interface towards the access point, wherein the selected communication interface is coupled to a best communication link having a best link metric.

Abstract: Methods and apparatus are provided for determining and representing a location or position of a node in a network. When the node receives position measurement information from a reference node, the node generates, based on the position measurement information, a position probability space (PPS) which defines a space that encompasses possible positions where the node is possibly positioned in the network. The PPS includes a centroid (i.e., a set of coordinates), and a set of vectors which originate from the centroid and define the space around the centroid. The magnitude of each vector reflects the accuracy of the position in the direction of the vector.

Abstract: A node in a wireless communication system announces a channel switch operation to facilitate a smooth transition to other channel. The node detects a requirement to discontinue communications at a first channel and sends a message to a plurality of neighboring nodes in response to detecting the requirement. Generally, the message comprises at least a reason for discontinuation of communications at the first channel and a duration for the channel switch operation after which the node is available for communications at the first channel or an alternate channel. Each of the plurality of neighboring nodes can determine based on the message and the neighborhood conditions a requirement to scan alternate channels to initiate communications with other nodes.

Abstract: A message format for use in one or more multihop flow reservation messages in a multihop wireless network includes a reservation originator identification; a reservation terminator identification; a sequence control; and optionally a flow originator identification. A multihop flow reservation comprises forwarding a traffic stream request including the message format and forwarding a traffic stream reply including the message format along a multihop route. After the traffic stream reservation is completed, a data is forwarded along the multihop route.

Abstract: A device (100) and method for frequency scanning uses two radios. The device (100) includes a processor (515), a scan radio (130) including a receiver (135) coupled to the processor (515), and a data radio (105) including a transmitter (115) that is also coupled to the processor (515). The processor (515) determines a transmission schedule for the transmitter (115) of the data radio (105) in response to a capability to receive a frequency scanning signal at the receiver (135) of the scan radio (130).

Abstract: A method of adaptive beaconing includes operating a node within an ad hoc wireless communication network to calculate a probability P for an interval of time I; transmit a beacon when a uniformly distributed random number is less than the probability P; and wait for the interval of time “I” and repeat the calculate, transmit, and waiting operations when the uniformly distributed random number is greater than the probability P.

Abstract: Techniques are provided for determining a position of a node. For example, the node receives first position data from a first reference node and second position data from a second reference node. The second position data includes second position measurement information and a precision indicator which indicates accuracy of the second position measurement information. The node generates a timestamp which indicates when the second position data was received by node, and storing the second position data and associated timestamp. Upon receiving updated first position data at the node from the first reference node, the node determines whether updated second position data has been received from the second reference node, and if not, generates aged second position data based on the stored second position data and the associated timestamp. The node can then determine its position based on the aged second position data and the updated first position data.

Abstract: A method and device for routing to a non-mesh network a first data flow received at a first mesh gateway via a wireless link as provided improves network efficiency. According to one aspect, the method includes determining that available bandwidth of a backhaul link to the non-mesh network through the first mesh gateway is below a threshold value. The first data flow is then determined to have a higher priority than a second data flow that is currently routed through the first mesh gateway to the non-mesh network. The second data flow is then forwarded to a second mesh gateway, whereby the second mesh gateway routes the second data flow to the non-mesh network. The first data flow is then routed to the non-mesh network through the first mesh gateway after forwarding the second data flow to the second mesh gateway.

Abstract: A method for proximity detection in a wireless communication network. A node attempts to determine the proximity of the closest neighboring node by transmitting a ranging request. Other nodes respond, and the first node to receive and respond to the request will have the shortest response time and thus will be the closest node. Exact ranges can be determined by applying Time-Of-Arrival (TOA) techniques to node response times. To further avoid collisions, one or more frames of the response messages can be same, making the multiple responses appear as multi-path. The group of responders can be narrowed and individual groups probed in a search pattern until the single nearest node is known or range of the nearest node is known. The ranging node may then use ordinary unicast mechanisms to probe this node, or begin scanning the groups again, or interleave the two mechanisms as desired.

Abstract: A system and method for distributing proxying error information in wireless networks is provided. The includes associating a proxy node with a non-routable node; sending a data packet from an initiator node to the proxy node for delivery to the non-routable node; determining by the proxy node that the non-routable device has disassociated from the proxy node; sending a proxy error message from the proxy node to the initiator node to inform the initiator node that the non-routable node is no longer proxied by the proxy node; and starting a route discovery process for the non-routable device by the initiator node.

Abstract: A method provides for selecting a communication interface towards an access point by a wireless communication device. The method includes receiving one or more HELLO messages from the access point; determining whether any of a plurality of communication links is being used to reach the access point by evaluating at least one field of each of the received HELLO messages; penalizing a link metric of a communication link when the communication link is being used; and selecting a communication interface towards the access point, wherein the selected communication interface is coupled to a best communication link having a best link metric.

Abstract: A method for updating at a bridge node a virtual local area network (VLAN) status of a first node in a mesh network as provided enables improved network connectivity. The method includes processing a first VLAN status message that associates a first VLAN identifier with the first node, wherein the first VLAN status message was generated in response to a first bind request (BREQ) message. A second VLAN status message is then transmitted, wherein the second VLAN status message associates the first VLAN identifier with the first node. A third VLAN status message that associates a second VLAN identifier with the first node is then processed, wherein the third VLAN status message was generated in response to a second bind request (BREQ) message that associated the second VLAN identifier with the first node, and whereby the VLAN status of the first node is updated.

Abstract: A system and method of security authentication and key management scheme in a multi-hop wireless network is provided herein with a hop-by-hop security model. The scheme adapts the 802.11r key hierarchy into the meshed AP network. In this approach, a top key holder (R0KH) derives and holds the top Pairwise Master Key (PMK—0) for each supplicant wireless device after the authentication process. All authenticator AP take the level one key holder (R1KH) role and receive the next level Pairwise Master Key (PMK—1) from R0KH. The link level data protection key is derived from PMK—1 via the 802.11i 4-way handshaking.

Abstract: The present invention provides a system and method for multihop packet forwarding within a multihop wireless communication network. The method uses a data frame format including at least the four address fields to forward packets in a multihop wireless network. The method includes generating a route request packet at a routable device in response to receiving a packet destined for an unknown destination. The route request packet includes an originating device field including an address of an originating device, wherein the originating device generated the packet originally; and a source field, wherein the source field includes an address of the first routable device which generated the route request packet.

Abstract: A device (100) and method for frequency scanning uses two radios. The device (100) includes a processor (515), a scan radio (130) including a receiver (135) coupled to the processor (515), and a data radio (105) including a transmitter (115) that is also coupled to the processor (515). The processor (515) determines a transmission schedule for the transmitter (115) of the data radio (105) in response to a capability to receive a frequency scanning signal at the receiver (135) of the scan radio (130).

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: In a multihop network having a first type of node, a second type of node and a third type of node, techniques are provided for optimizing topology learning in the multihop network which can reduce the amount of control traffic that occurs due to frequent topology changes. For example, each of the nodes can transmit a node identifier and status information to the first type of node. The status information associated with each node can include a node type and a mobility state of the node. The first type of node can store the node identifier and the status information from each of the nodes. The first type of node can reserve or allocate a channel resource to each of the second type of nodes having a mobile state. The channel resource is used by the second type of node for exchanging topology information with the first type of node.

Abstract: A method of adaptive beaconing includes operating a node within an ad hoc wireless communication network to calculate a probability P for an interval of time I; transmit a beacon when a uniformly distributed random number is less than the probability P; and wait for the interval of time “I” and repeat the calculate, transmit, and waiting operations when the uniformly distributed random number is greater than the probability P.

Abstract: A node in a wireless communication system announces a channel switch operation to facilitate a smooth transition to other channel. The node detects a requirement to discontinue communications at a first channel and sends a message to a plurality of neighboring nodes in response to detecting the requirement. Generally, the message comprises at least a reason for discontinuation of communications at the first channel and a duration for the channel switch operation after which the node is available for communications at the first channel or an alternate channel. Each of the plurality of neighboring nodes can determine based on the message and the neighborhood conditions a requirement to scan alternate channels to initiate communications with other nodes.