Abstract: A user can make a symbol with their hand, or other such gesture, at a distance from a computing device that can be captured by at least one imaging element of the device. The captured information can be analyzed to attempt to determine the location of distinguishing features of the symbol in the image information. The image information is then compared to hand gesture information stored in, for example, a library of hand gestures for the user. Upon identifying a match, an input to an application executing on the computing device is provided when the image information contains information matching at least one hand gesture with at least a minimum level of certainty. The hand gesture could include a single “static” gesture, such as a specific letter in sign language, for example, or include two or more “static” gestures. The gesture could also include motion, such as hand movement.

Abstract: A user can make a symbol with their hand, or other such gesture, at a distance from a computing device that can be captured by at least one imaging element of the device. The captured information can be analyzed to attempt to determine the location of distinguishing features of the symbol in the image information. The image information is then compared to hand gesture information stored in, for example, a library of hand gestures for the user. Upon identifying a match, an input to an application executing on the computing device is provided when the image information contains information matching at least one hand gesture with at least a minimum level of certainty. The hand gesture could include a single “static” gesture, such as a specific letter in sign language, for example, or include two or more “static” gestures. The gesture could also include motion, such as hand movement.

Abstract: A user can make a symbol with their hand, or other such gesture, at a distance from a computing device that can be captured by at least one imaging element of the device. The captured information can be analyzed to attempt to determine the location of distinguishing features of the symbol in the image information. The image information is then compared to hand gesture information stored in, for example, a library of hand gestures for the user. Upon identifying a match, an input to an application executing on the computing device is provided when the image information contains information matching at least one hand gesture with at least a minimum level of certainty. The hand gesture could include a single “static” gesture, such as a specific letter in sign language, for example, or include two or more “static” gestures. The gesture could also include motion, such as hand movement.

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 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: 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 system and method for performing topology control in a wireless network (100). The system and method operate to enable a node (102-1) to determine the link cost of a link between itself and another node (102-2), based on the number of nodes (102, 106, 107) that would be affected by message transmission by the node (102) and the other node (102-2), and the number of nodes (102, 106, 107) that would be affected by message reception by the node (102-1) and the other node (102-2). The number of nodes (102, 106, 107) affected by the message transmission and message reception at the node (102-1) and the other node (102-2) is affected by the transmit power of the control messages sent by the node (102-1) and the other node (102-2). The node (102-1) further bases routing decisions on the calculated link costs.

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

Abstract: 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.

Abstract: A system and method for data transmission using a multichannel medium access control (MAC) protocol to send small messages on the reservation channel directly without any RTS/CTS handshake or channel switching delays. The message is assigned a special type so that it can be distinguished from the RTS/CTS message. The message can also include information about congestion, activity, device type, mobility level, and so forth.

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 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 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 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 system and method for calculating a routing metric that can select the route providing the best throughput in a multihopping network (100), based on one or more parameters including completion rates, data rates, MAC overhead and congestion. The system and method are capable of selecting a route in a multihopping network (100) having a high throughput, comprising calculating a routing metric at one or more nodes (102, 106, 107), wherein the routing metric enables the one or more nodes (102, 106, 107) to select the route in the network (100). The routing metric can include network information such as the raw data rate, the completion rate, and the media access control overhead and congestion.

Abstract: 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.

Abstract: A system and method for characterizing the quality of a link, in particular, a bi-directional link, between nodes in a wireless communication network, such as a wireless ad-hoc peer-to-peer network, with minimum network overhead. The system and method determine the quality of link between two nodes by taking into consideration the view from both the nodes, and factors such as signal strength, signal-to-noise ratio or any statistic collected at the physical layer that is deemed representative of the quality of a link. The link quality can also be adjusted using a weighting factor.

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