Selecting nodes close to another node in a network using location information for the nodes
First Claim
Patent Images
1. A method of identifying at least one node close to a first node in a network, comprising:
- selecting a set of candidate nodes from a plurality of nodes based on location information for the candidate nodes and the first node, wherein the selection is made based on comparing a distance from the first node and a distance from each node of the plurality of nodes to each one of a plurality of global landmark nodes;
applying a clustering algorithm, using a computer processor, to the location information for the candidate nodes and the first node; and
identifying a subset of the set of candidate nodes closest to the first node based on results of applying the clustering algorithm.
2 Assignments
0 Petitions
Accused Products
Abstract
A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.
68 Citations
20 Claims
-
1. A method of identifying at least one node close to a first node in a network, comprising:
-
selecting a set of candidate nodes from a plurality of nodes based on location information for the candidate nodes and the first node, wherein the selection is made based on comparing a distance from the first node and a distance from each node of the plurality of nodes to each one of a plurality of global landmark nodes; applying a clustering algorithm, using a computer processor, to the location information for the candidate nodes and the first node; and identifying a subset of the set of candidate nodes closest to the first node based on results of applying the clustering algorithm. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A node in a network comprising:
-
means for selecting a set of candidate nodes from a plurality of nodes based on location information for the candidate nodes and a first node, wherein the selection is made based on comparing a distance from the first node and a distance from each node of the plurality of nodes to each one of a plurality of global landmark nodes; means for applying a clustering algorithm to the location information for the candidate nodes and the first node; and means for identifying a subset of the set of candidate nodes closest to the first node based on results of applying the clustering algorithm. - View Dependent Claims (15, 16, 17)
-
-
18. Computer software embedded on a non-transitory computer readable medium, the computer software comprising instructions performing:
-
selecting a set of candidate nodes from a plurality of nodes based on location information for the candidate nodes and a first node, wherein the selection is made based on comparing a distance from the first node and a distance from each node of the plurality of nodes to each one of a plurality of global landmark nodes; applying a clustering algorithm to the location information for the candidate nodes and the first node; and identifying a subset of the set of candidate nodes closest to the first node based on results of applying the clustering algorithm. - View Dependent Claims (19, 20)
-
Specification