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 method and apparatus for calculating a location of a device is provided. A likelihood of the device being located at a particular location point or a particular location floor is determined using a likelihood calculation at each of a plurality of locations. The location point or location floor is then identified as that location having an associated highest likelihood calculation. The likelihood calculation includes calculating a distance from the device to each of a plurality of reference routers including one or more virtual coplanar reference routers, wherein each of the one or more virtual coplanar reference routers comprise a projection of a non-coplanar reference router onto the floor.

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 (step 805). A second VLAN status message is then transmitted, wherein the second VLAN status message associates the first VLAN identifier with the first node (step 810). 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 (step 815).

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: 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: 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 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: 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 and device for routing mesh network traffic from a mesh access point to a non-mesh network as provided improves network efficiency. According to one aspect, the method includes identifying a data flow in the mesh network traffic. A priority of the data flow is then determined. A preferred mesh gateway is then selected from a plurality of mesh gateways based on the priority of the data flow and preference information of the plurality of mesh gateways, where the plurality of mesh gateways provide routes to the non-meshed network. The data flow is then routed to the preferred mesh gateway, wherein the preferred mesh gateway routes the data flow to the non-mesh network.

Abstract: A multi-radio meshed node is provided which includes a first radio module, a second radio module, and a single routing manager module that is common to or shared by the first radio module and the second radio module. The multi-radio meshed node has a node MAC address associated therewith which uniquely identifies the multi-radio meshed node. The first radio module includes a first interface. The second radio module is designed to communicate simultaneously when the first radio module is communicating. The second radio module includes a second interface. The first radio module has a first interface MAC address associated therewith, and the second radio module has a second interface MAC address associated therewith. The single routing manager module determines which one of the first interface and the second interface is to be used for routing of a particular packet.

Abstract: In a wireless multi-hop network including a plurality of multi-radio meshed nodes, a method is provided for a particular recipient multi-radio meshed node to optimize a route to an intelligent access point (IAP). Each of the multi-radio meshed nodes include a plurality of radio modules, and each radio module comprises an interface. Each of the radio modules in each of the multi-radio meshed nodes transmit a HELLO message over-the-air (OTA). Each HELLO message transmitted by each of the radio modules comprises: a source node MAC address field which specifies a first MAC address of the multi-radio meshed node, and a source interface MAC address field associated with a particular radio module of the multi-radio meshed node and which specifies an interface MAC address of the radio module.

Abstract: A method is provided for a particular multi-radio meshed node to discover a route to a peer multi-radio meshed node in a wireless multi-hop network including a plurality of multi-radio meshed nodes. Each of the multi-radio meshed nodes each includes a plurality of radio modules, and each radio module comprises an interface. The particular multi-radio meshed node transmits route request (RREQ) messages from each interface of a particular multi-radio meshed node. When a particular recipient multi-radio meshed node receives at least one of the route request (RREQ) messages, it generates a reverse route to the particular multi-radio meshed node. A peer-to-peer route is established when the particular multi-radio meshed node receives a route reply (RREP) message and can then be used to forward traffic to and from the destination node.

Abstract: Unified groupcast data frame formats are provided for improving the efficiency of groupcast communications in multihop wireless mesh networks, and significantly reducing bandwidth consumption. The unified groupcast data frame formats modify existing BSS data frame formats by inserting a mesh end-to-end sequence number into a field that is normally reserved for a sequence control field. In some implementations, a time-to-live (TTL) value can also be inserted into a QoS control field.

Abstract: A method and system for routing data in a wireless network (400) that enables all nodes (106, 402, 404, 406, 408) to find routes to each other even if the nodes (106, 402, 404, 406, 408) are non-meshed which are incapable of operating as a router to route packets received from other nodes (106, 402, 404, 406, 408), and for associating and reassociating the non-meshed and meshed nodes with other meshed nodes (106, 402, 404, 406, 408). The non-meshed nodes (STA 13-STA 15) request association with one of the meshed nodes (AP5) which are capable of performing packet routing, to request that the meshed node (AP5) with which the non-meshed node (STA 13) is associating operate as a proxy node to route packets between the associated non-meshed node (STA 13) and other meshed or non-meshed nodes (106, 402, 404, 406, 408).

Abstract: A method and apparatus is provided for power conservation in a node operating in a multihop network. The method includes determining whether a broadcast frame in a beacon interval intended for the node has been previously received by the node and remaining awake for reception of the broadcast frame in the beacon interval if the broadcast frame intended for the node has not been previously received by the node.

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: 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 system and method to facilitate path selection in a multihop network includes receiving by a base station a path metric associated with each of a plurality of stations neighboring to a subscriber station; comparing each of the path metrics with a current path metric; and transmitting a path selection recommendation from the base station to the subscriber station when one of the compared path metrics is better than the current path metric.

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: A method and apparatus for calculating a location of a device is provided. A likelihood of the device being located at a particular location point or a particular location floor is determined using a likelihood calculation at each of a plurality of locations. The location point or location floor is then identified as that location having an associated highest likelihood calculation. The likelihood calculation includes calculating a distance from the device to each of a plurality of reference routers including one or more virtual coplanar reference routers, wherein each of the one or more virtual coplanar reference routers comprise a projection of a non-coplanar reference router onto the floor.