| Patent application number | Description | Published |
|---|
| 20080226071 | METHOD FOR ESTABLISHING SECURE ASSOCIATIONS WITHIN A COMMUNICATION NETWORK - 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. | 09-18-2008 |
| 20080316951 | METHOD FOR DISCOVERING A ROUTE TO AN INTELLIGENT ACCESS POINT (IAP) - 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. | 12-25-2008 |
| 20080316997 | MULTI-RADIO NODE WITH A SINGLE ROUTING MODULE WHICH MANAGES ROUTING FOR MULTIPLE DIFFERENT RADIO MODULES - 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. | 12-25-2008 |
| 20080317047 | METHOD FOR DISCOVERING A ROUTE TO A PEER NODE IN A MULTI-HOP WIRELESS MESH NETWORK - 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. | 12-25-2008 |
| 20090154359 | METHOD FOR CALCULATING SERVICE REDUNDANCY OF A WIRELESS NETWORK - A method for calculating service redundancy of a wireless network is provided. The method comprises determining one or more of a plurality of routes through which a node can communicate to reach a destination. A routing metric is calculated for each of the plurality of routes. Using the calculated routing metrics a route having a best routing metric is identified as a best route to the destination. Service redundancy for each node within the wireless network is calculated using a sum of weighted ratios of the best routing metric to at least one alternate routing metric. | 06-18-2009 |
| 20090168674 | DETERMINING POSITION OF A NODE BASED ON AGED POSITION DATA - 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. | 07-02-2009 |
| 20090170526 | DETERMINING POSITION OF A NODE AND REPRESENTING THE POSITION AS A POSITION PROBABILITY SPACE - 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. | 07-02-2009 |
| 20090190558 | METHOD AND APPARATUS FOR LINK ADAPTATION BY STOCHASTICALLY SELECTING A TRANSMIT PARAMETER - A method and apparatus for link adaptation is provided. A node stores a set of transmit parameters and corresponding selection probabilities for each of the transmit parameters. The node stochastically selects a particular transmit parameter based on the selection probabilities, and then transmits a packet according to the particular selected transmit parameter. From received transmission feedback information, the node derives performance statistics, and uses the performance statistics to specify an estimated performance function for the particular transmit parameter. The node updates a selection probability computation function (SPCF), and uses the SPCF to generate updated selection probabilities corresponding to each transmit parameter in the set of available transmit parameters. | 07-30-2009 |
| 20100056174 | METHOD FOR PROXIMITY DETECTION IN A WIRELESS COMMUNICATION NETWORK - 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. | 03-04-2010 |
| 20100135267 | METHOD FOR ADAPTIVE BEACONING - 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. | 06-03-2010 |
