SYSTEMS AND METHODS FOR DETERMINING ROUTES IN NETWORKS
The disclosure describes systems and methods for determining a route in a network. A method according, to one embodiment includes determining a set of neighbor nodes that are within wireless communications range of a current node, determining that a route is needed from a source to a destination node, selecting a first neighbor node that is located closest to the destination node as the next hop in the route, and sending:a route-request message to the first neighbor node. The process continues on a hop-by-hop basis until reaching the destination node, whereupon a route-reply message is sent beck to the source node confirming that the route has been determined.
1 . A method comprising:
determining a set of one or more neighbor nodes that are within wireless communications range of a current node;
determining that a route is needed from a source node to a destination node;
selecting a first neighbor node of the set of one or more neighbor nodes in response to determining that the route is needed from the source node to the destination node, wherein the first neighbor node is a neighbor node of the set of neighbor nodes that is located closest to the destination node; and
initiating the transmission of a route-request message from the current node to the first neighbor node, wherein the route-request message comprises information identifying the destination node.
2 . The method of claim 1 , wherein the route-request message comprises a source identifier corresponding to a source node that originated the route-request message, a destination identifier corresponding to the destination node, and location information corresponding to the destination node.
3 . The method of claim 1 , further comprising receiving a route-reply message at the current node in response to the route-request message, wherein the route-reply message comprises information associated with a route from the source node to the destination node.
4 . The method of claim 3 , further comprising updating a list of one or more routes at the current node based on the route-reply message.
5 . The method of any of claim 1 , further comprising:
determining that a route to the destination node should not include the first neighbor node;
selecting a second neighbor node in response to determining that the route to the destination node should not include the first neighbor node; and
initiating the transmission of the route-request message from the current node to the second neighbor node.
6 . The method of claim 5 , further comprising refraining from sending at least one subsequent route-request message associated with the destination node to the first neighbor node in response to determining that the route to the destination node should not include the first neighbor node.
7 . The method of claim 1 , wherein the current node is the source node, and wherein determining that the route is needed from the source node to the destination node is based on data originating at the current node.
8 . The method of claim 1 , wherein the current node is an intermediate node that is located between the source node and the destination node, and wherein determining that the route is needed from the source node to the destination node is based on receiving a route-request message.
9 . The method of claim 1 , wherein selecting a first neighbor node from the set of one or more neighbor nodes in response to determining that the route is needed from the source node to the destination node comprises:
calculating, for each neighbor node of the set of one or more neighbor nodes, a corresponding intersect point where a line drawn from the neighbor node would perpendicularly intersect a reference line defined by the equation y(x)=((y d −y c )/(x d −x c ))*(x−x c )+y c , wherein (x c , y c ) represents a location of the current node, wherein (x d , y d ) represents a location of the destination node, and wherein the first neighbor node has a corresponding intersect point on the reference line that is closest to the destination node.
10 . A computing device comprising:
one or more communications interfaces; and
one or more processors configured to determine a set of one or more neighbor nodes that are within wireless communications range of the computing device, select a first neighbor node of the set in response to determining that a route is needed from a source node to a destination node, and initiate the transmission of a route-request message from the one or more communications interfaces to the first neighbor node, wherein the first neighbor node is the neighbor node of the set that is located closest to the destination node.
11 . The computing device of claim 10 , wherein the one or more processors are configured to update a list of one or more routes based on a route-reply message received in response to the route-request message.
12 . The computing device of claim 10 , wherein the one or more processors are configured to determine that a route to the destination node should not include the first neighbor node, select a second neighbor node in response to determining that the route to the destination node should not include the first neighbor node, and initiate the transmission of a route-request message from the computing device to the second neighbor node.
13 . The computing device of claim 12 , wherein the one or more processors are configured to refrain from sending at least one subsequent route-request message associated with the destination node to the first neighbor node in response to determining that the route to the destination node should not include the first neighbor node.
14 . The computing device of claim 10 , wherein the computing device corresponds to the source node, and wherein the one or more processors are configured to determine that the route is needed from the source node to the destination node based on data originating at the computing device.
15 . The computing device of claim 10 , wherein the computing device corresponds to an intermediate node located between the source node and the destination node, and wherein the one or more processors are configured to determine that the route is needed from the source node to the destination node is based on receiving a route-request message.
16 . A tangible computer readable media having instructions stored thereon, the instructions comprising:
instructions for determining a set of one or more neighbor nodes that are within wireless communications range of a current node;
instructions for determining that a route is needed from a source node to a destination node;
instructions for selecting a first neighbor node of the set of one or more neighbor nodes in response to determining that the route is needed from the source node to the destination node, wherein the first neighbor node is a neighbor node of the set of one or more neighbor nodes that is located closest to the destination node; and
instructions for initiating the transmission of a route-request message from the current node to the first neighbor node, wherein the route-request message comprises information identifying the destination node.
17 . The tangible computer readable media of claim 16 , further comprising instructions for updating route data related to one or more routes based on a route-reply message received in response to the route-request message.
18 . The tangible computer readable media of claim 16 , further comprising:
instructions for determining that a route to the destination node should not include the first neighbor node;
instructions for selecting a second neighbor node in response to determining that the route to the destination node should not include the first neighbor node; and
instructions for initiating the transmission of a route-request message to the second neighbor node.
19 . The tangible computer readable media of claim 16 , wherein the instructions for determining that the route is needed from the source node to the destination node comprises at least one of analyzing data originating at the current node or analyzing a route-request message received from another node.
20 . The tangible computer readable of claim 16 , wherein the instructions for selecting a first neighbor node from the set of neighbor nodes comprises:
instructions for calculating for each neighbor node of the set of neighbor nodes, a corresponding intersect point where a line drawn from the neighbor node would perpendicularly intersect a reference line defined by the equation y(x)=((y d −y c )/(x d −x c ))*(x−x c )+y c , wherein (x c , y c ) represents a location of the current node, wherein (x d , y d ) represents a location of the destination node, and wherein the selected first neighbor node has a corresponding intersect point on the reference line that is closest to the destination node.