Abstract: Embodiments may relate to pruning a distributed database for a peer-to-peer (P2P) network. A node may transmit a first multicast beacon over the P2P network. The node may receive a unicast synchronization request in response to the first multicast beacon, the unicast synchronization request comprising a removed list for the distributed database. The node may compare the removed list to a locally stored node list to determine a node removal. The node may determine if there is a failure in a node information call made to a node relating to the node removal. The node may, subsequent to a determination of the failure, update the locally stored node list based on the node removal. The node may transmit a second multicast beacon comprising the node removal. Nodes receiving the second multicast beacon may update a locally stored removed list using the node removal.

Abstract: Embodiments may relate to synchronizing nodes in a peer-to-peer network. A method comprises listening for a first multicast beacon during a duration of a discovery interval. The discovery interval comprises time intervals configured for a plurality of nodes in a squad. The method further comprises, in response to receiving the first multicast beacon during the duration of the discovery interval, transmitting a unicast synchronization request to a transmitter of the first multicast beacon. The unicast synchronization request comprises a node list.

Abstract: Embodiments may relate to pruning a distributed database for a peer-to-peer (P2P) network. A node may transmit a first multicast beacon over the P2P network. The node may receive a unicast synchronization request in response to the first multicast beacon, the unicast synchronization request comprising a removed list for the distributed database. The node may compare the removed list to a locally stored node list to determine a node removal. The node may determine if there is a failure in a node information call made to a node relating to the node removal. The node may, subsequent to a determination of the failure, update the locally stored node list based on the node removal. The node may transmit a second multicast beacon comprising the node removal. Nodes receiving the second multicast beacon may update a locally stored removed list using the node removal.

Abstract: Techniques are provided for providing information to a group of nodes over a medium. Before transmitting information to the group of nodes, a source can analyze factors to determine transmission reliability of a first transmission technique and a second transmission technique and generate an analysis result. Based on the result of this analysis, the source can select one of the first transmission technique and the second transmission technique for providing the information to the group of nodes over the medium.

Abstract: A method and device for providing an alternative backhaul portal at a mesh access point in a mesh network as provided enables improved backhaul services. The method includes processing a registration of the mesh access point as an alternative backhaul portal in the mesh network. It is then determined that additional backhaul capacity is required in the mesh network. Next, the mesh access point is activated as an alternative backhaul portal in the mesh network in response to determining that additional backhaul capacity is required. Mesh network data are then routed through the alternative backhaul portal at the mesh access point until it is determined that additional backhaul capacity is no longer required. The mesh access point is then deactivated as an alternative backhaul portal in the mesh network.

Abstract: A method for security authentication within a wireless network is disclosed. A method within an adhoc mesh network for two devices to quickly determine roles (i.e. which is the authenticator and which is the supplicant) while establishing a security association is provided for. The invention further provides for the inclusion of cached key information in the role negotiation process and the application of role negotiation to a shortened three-way handshake.

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 system and method for providing a traffic control scheme for QoS provision and congestion control across multiple interfaces of wireless nodes (102, 106 and 107), such as wireless access points (107 and 106), communicating in a wireless multihopping communication network (100). The nodes (102, 106 and 107) can include multiple transceivers. The system and method detects bottleneck interfaces in these nodes (102,106, 107) to control the traffic along the path of the corresponding traffic flow. Different measurements and cross-layer feedback are used to differentiate the cause of the congestion, such as wireless link quality degradation due to fading or degradation due to congestion in a shared medium. The nodes (102, 106, 107) inform each other on the status of their congestion level. High and low level signaling and interruption mechanisms are used to control the interfaces of the congested node (102, 106 or 107) to adjust traffic flow and alleviate the congestion.

Abstract: A system and method to control congestion in a multihopping wireless communication network (100). The system and method distribute the congestion information back to the ingress points (106) and traffic source nodes (102, 106, 107) in the network (100) through the actual route of the data flow that contributes to the congestion. The system and method therefore avoid bottleneck points (102-5) in the network (100) to reduce congestion. The system and method can be used for packet-based, route-based or flow-based traffic shaping in a multihop wireless network (100) employing different media access control (MAC) and routing layer protocols. Moreover, the system and method is capable of distributing congestion and service differentiation information between different interfaces in the network (100).

Abstract: A system and method that creates an abstraction of the physical layer of a wireless communication network (100), in particular, a wireless ad-hoc peer-to-peer communication network (100), and that normalizes the feedback from the physical layer to enable multiple types of nodes (102, 106, 107) in the wireless network to operate using a common wireless routing protocol. This routing protocol uses a link quality metric to determine the best route regardless of how it actually chooses the route or disseminates such link quality information. The generalized routing metric can be derived for any node (102, 106, 107), regardless of its relative performance or its media access control (MAC) technology. The system and method also create a transaction summary that can be used for link adaptation and link quality estimation to determine, for example, future data rates, link quality/routing metrics, and transmit powers.

Abstract: A system and method to avoid and control the bottleneck points in multi-hop wireless ad-hoc networks is described. This is achieved by using the overheard RTS/(N)CTS information to compute a weighted combination of the node's and neighbors weighted queue size. Rate limiting factor can be distributed by using ACK messages in case RTS/CTS is not enabled while node weight values can be distributed in DATA messages. Furthermore, rate limiting is based on two metrics that eliminate the problems of drop-tail schemes. Priority levels may be used for selective rejection to provide availability for emergency and system packets.

Abstract: A method and device for providing an alternative backhaul portal at a mesh access point in a mesh network as provided enables improved backhaul services. The method includes processing a registration of the mesh access point as an alternative backhaul portal in the mesh network. It is then determined that additional backhaul capacity is required in the mesh network. Next, the mesh access point is activated as an alternative backhaul portal in the mesh network in response to determining that additional backhaul capacity is required. Mesh network data are then routed through the alternative backhaul portal at the mesh access point until it is determined that additional backhaul capacity is no longer required. The mesh access point is then deactivated as an alternative backhaul portal in the mesh network.

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: 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: 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 communications network which is capable of effectively and efficiently handling mobility of wireless user terminals between access point nodes of a packet-switched network with minimal overhead and packet loss, and a method for using the same. The communications network employs a packet-switched core network and a plurality of access points coupled to the core network. Each access point is adapted to provide any user terminal with wireless communications access to the core network when that user terminal becomes affiliated with that access point. Each access point, as well as other nodes on the network such as a media server, DNS server and an IP gateway router, includes an address resolution cache which is adapted to store information representative of affiliation between the user terminals and the access points of the network.

Abstract: A system and method for providing the ability to selectively share data in a network routing device with an associated host. The system and method employs a hardware firewall in the routing device which restricts the host such that it can only access areas in shared memory which contains data destined for the host. The routing device CPU notifies the host of pending data and the location of that data in the shared memory. The hardware firewall is also notified of the location in shared memory which the host may access. When the host attempts to read the data, the firewall ensures that only the stated memory area or areas are accessed by the host. Once the data has been read by the host, the firewall is notified to cancel the host's ability to access the shared memory until such time as a new packet destined for the host arrives in the routing device.

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).