Abstract: A method and system for updating a multicast state of a multicast group at a first mesh access point as provided improves network efficiency. According to one aspect, the method includes processing a multicast member join request for the multicast group received from a first wireless node. A proxy update message for the first wireless node received from a third mesh access point is then processed. The first wireless node connects to a second mesh access point after joining the multicast group via the first mesh access point, and the third mesh access point is a root node of a mesh tree of which the second mesh access point is a node. An Internet Group Management Protocol (IGMP) query message for the multicast group is then generated. A multicast update (MUPD) packet is then transmitted to an upstream node, whereby a multicast state is updated at the upstream node.

Abstract: Techniques are provided for determining respective roles of a first meshed node (MN) and a second MN during an authentication process. The first MN and the second MN determine whether at least one of the first MN and the second MN have a secure connection to an authentication server. When the first MN and the second MN each have a secure connection to the authentication server, the first MN and the second MN determine whether a first authentication message forwarding cost (AMFC) associated with the first MN is the same as a second AMFC associated with the second MN. When the first AMFC associated with the first MN is the different than the second AMFC associated with the second MN, the MN having the lower AMFC to an IAP (coupled to the authentication server) assumes the authenticator role, and the other MN having the higher AMFC assumes the supplicant role.

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: 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: 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 system and method for supporting multicast in highly dynamic wireless multi-hop networks, such as ad-hoc networks, with good scalability. The system and method provide a multicast routing algorithm to work in wireless ad-hoc networks without any fixed infrastructure nodes present. In doing so, the system and method provide a technique to build a multicast source specific tree on demand, while using a core source node to limit routing overhead. The system and method further provide a repair process to reduce the latency of discovery of topology change, employ a node sequence number mechanism to differentiate between upstream nodes and downstream nodes on the multicast tree in the repair process, and provide an active joining process to reduce the latency of discovery of membership change.

Abstract: Techniques are provided for determining whether a particular Access Point (AP) is to be designated as an Infrastructure Access Point (IAP) or a Backhaul Mesh Access Point (BMAP) based on the connectivity of the particular AP to a network which includes at least one multicast heartbeat message (MCHBM) source. Techniques are provided which can allow an Infrastructure Access Point (IAP) to change its device type to a Backhaul Mesh Access Point (BMAP) device type when the IAP determines that connectivity to the network is lost. Other techniques are provided which can allow a Backhaul Mesh Access Point (BMAP) to change its device type to an Infrastructure Access Point (IAP) device type when the BMAP determines that connectivity to the network is established.

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: Techniques and technologies are provided for dynamically selecting one of a default channel bandwidth and an alternate channel bandwidth for transmitting information over a wireless communication link which couples a transmitter node to a receiver node. The transmitter node and the receiver node are designed to transmit and receive at the default channel bandwidth and at the alternate channel bandwidth.

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 and technologies are provided for managing establishment, maintenance and removal of security associations (SAs) between nodes in an ad hoc network, such as a wireless mesh network.

Abstract: A multi-hop wireless network includes an originator node, a proxy node, and at least one other node. The originator node generates a data packet and transmits the data packet to the proxy node. The proxy node receives and forwards to the at least one other node the data packet including an originator node address and a proxy node sequence number for an end-to-end groupcast sequence number.

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 for distributed call admission control in a wireless network includes the steps of: initiating a communication call within the wireless network; computing a resource metric at each of a plurality of nodes along a communication route of the wireless network, wherein each of the resource metrics is representative of a network dynamic; distributing the resource metrics along a communication route to at least one call admission control point within the wireless network; and performing a call admission process for the communication call at the at least one call admission control point using the resource metrics.

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 are incapable of operating as a router to route packets received from other nodes (106, 402, 404, 406, 408). The meshed nodes (106, 402) which are capable of performing packet routing act as proxy nodes for their associated non-meshed nodes (STA 13-STA 15) to route packets from their associated non-meshed nodes (STA 13-STA 15) to destination nodes. Some of the meshed nodes further operate as intelligent access points (106) to provide the non-meshed nodes and other meshed nodes with access to other networks, such as the Internet (402).

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 method for managing secure routing keys (200) for on-demand routing protocols used in a wireless mesh network includes sending an secure routing key from a key distribution node to an access node (201). A temporary communications route which is time and usage limited is initiated (203) between a wireless device and an internet access point when the wireless device initially joins the network. A secure routing key is sent (205) from the internet access point connected with the key distribution center to the wireless device. Thereafter, the secure routing operation can be started to establish secure routes among all wireless devices which have obtained the same secure routing key in the same manner. Thus, the invention defines a simple and efficient key management technique using initial key establishment and re-keying through dynamically updated key vectors.

Abstract: A method for tree based spatial TDMA scheduling in a multi-hop wireless network (100). A time slot is requested (101) for non-use by a requesting node to all neighboring nodes. Similarly, the requested time slot is next requested (103) for non-use from the requesting node to its parent nodes. If available, a time slot assignment is then requested (109) from the requesting node to its parent node where the time slot assignment is requested (111) from the parent node to the grandparent node of the requesting node. Finally, all neighboring nodes are then informed (117, 119, 121) if both the grandparent node and parent node grant the time slot request to the requesting node. The invention works to reduce packet collisions by providing link-slot formulation in combination with link direction to compensate for spatial reuse loss in a local optimization setting.

Abstract: A communication network (600) includes a first communication device (102-1) and at least one other communication device (102-3), wherein the first communication device (102-1) and the at least one other communication device (102-3) are proximately located. The communication network further includes a transaction detector (625) coupled between the first communication device (102-1) and the at least one other communication device (102-3) for detecting one or more transactions intended for each of the proximately located communication devices. The communication network (600) further includes a bandwidth allocator (610) adapted to impede communication activity for a predetermined time for the at least one other proximately located communication devices (102-3), and activate communication activity for the predetermined time for the first communication device (102-1) in response to the transaction detector (625) detecting a transaction intended for the first communication device (102-1).