IP Library Granted Patent US 8,144,671
Granted Patent B2
US 8,144,671 · App. 11/428,535 · Granted Mar 27, 2012

Communicating via nondeterministic and deterministic network routing

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,144,671
App. No.
11/428,535
Granted
Mar 27, 2012
Kind
B2
Abstract

In a wireless network that includes a plurality of nodes, a method of communicating a message from an originating node, intended for receipt by a destination node, via one or more intermediate nodes, includes the steps of: (a) communicating with just a single node within the communications range of the originating node—including sending the message and the known network pathway—if a network pathway to the destination node is known by the originating node, the single node being the first intermediate node identified in the known network pathway; and (b) communicating with one or more first intermediate nodes within the communications range of the originating node—including sending the message—if a network pathway to the destination node is unknown by the originating node.

Claims (66)

1. In a wireless network comprising a plurality of nodes, a method of communicating a message from an originating node, intended for receipt by a destination node, via one or more intermediate nodes, comprising the steps of:

(a) determining if a network pathway to the destination node is known by the originating node; and

(b) communicating with just a single node within the communications range of the originating node if a network pathway to the destination node is known by the originating node, the single node being the first intermediate node identified in the known network pathway, said step of communicating including sending the message and the known network pathway to the first intermediate node;

(c) communicating with one or more first intermediate nodes within the communications range of the originating node if a network pathway to the destination node is unknown by the originating node, said step of communicating including sending the message; and

(d) communicating the message by each first intermediate node, wherein each first intermediate node is configured for

(i) communicating with just a single node within the communications range of the first intermediate node if a single network pathway to the destination node is known by the first intermediate node, the single node being the node identified next after the first intermediate node in the single network pathway, including sending, to the single node,

(A) the message,

(B) the known network pathway, and

(C) the link quality between the originating node and the first intermediate node,

(ii) if a plurality of network pathways to the destination node are known by the first intermediate node, then,

(A) determining a preferred network pathway from the plurality of known network pathways in accordance with an algorithm, and

(B) communicating with just a single node within the communications range of the first intermediate node, the single node being the node identified next after the first intermediate node in the preferred network pathway, including sending, to the next identified node,

(I) the message,

(II) the preferred network pathway, and

(III) the link quality between the originating node and the first intermediate node, and

(iii) if no network pathway is known by the first intermediate node, then communicating with one or more nodes within the communications range of the first intermediate node, including sending,

(A) the message, and

(B) the link quality between the originating node and the first intermediate node.

2. The method of claim 1 , wherein determining a preferred network pathway from the known network pathways in accordance with an algorithm comprises comparing, for each known network pathway, the number of hops, between nodes, that are required to reach the destination node.

3. The method of claim 1 , wherein messages are communicated between nodes utilizing transmission control protocol (TCP).

4. The method of claim 1 , wherein messages are communicated between nodes of the wireless network via data packets.

5. In a wireless network comprising a plurality of nodes, a method of communicating a message from an originating node, intended for receipt by a destination node, via one or more intermediate nodes, comprising the steps of:

(a) determining if a network pathway to the destination node is known by the originating node; and

(b) communicating with just a single node within the communications range of the originating node if a network pathway to the destination node is known by the originating node, the single node being the first intermediate node identified in the known network pathway, said step of communicating including sending the message and the known network pathway to the first intermediate node;

(c) communicating with one or more first intermediate nodes within the communications range of the originating node if a network pathway to the destination node is unknown by the originating node, said step of communicating including sending the message; and

(d) communicating the message by each first intermediate node, wherein each first intermediate node is configured for

(i) communicating with just a single node within the communications range of the first intermediate node if a single network pathway to the destination node is known by the first intermediate node, the single node being the node identified next after the first intermediate node in the single network pathway, including sending, to the single node,

(A) the message,

(B) the known network pathway, and

(C) the link quality between the originating node and the first intermediate node,

(ii) if a plurality of network pathways to the destination node are known by the first intermediate node, then,

(A) determining a preferred network pathway from the plurality of known network pathways in accordance with an algorithm, and

(B) communicating with just a single node within the communications range of the first intermediate node, the single node being the node identified next after the first intermediate node in the preferred network pathway, including sending, to the next identified node,

(I) the message,

(II) the preferred network pathway, and

(III) the link quality between the originating node and the first intermediate node, and

(iii) if no network pathway is known by the first intermediate node, then communicating with one or more nodes within the communications range of the first intermediate node, including sending,

(A) the message, and

(B) the link quality between the originating node and the first intermediate node;

(e) wherein determining a preferred network pathway from the known network pathways in accordance with an algorithm comprises comparing the overall link quality of the respective known network pathways.

6. The method of claim 5 , wherein messages are communicated between nodes utilizing transmission control protocol (TCP).

7. The method of claim 5 , wherein messages are communicated between nodes of the wireless network via data packets.

8. In a wireless network comprising a plurality of nodes, a method of communicating a message from an originating node, intended for receipt by a destination node, via one or more intermediate nodes, comprising the steps of:

(a) first,

(i) communicating with just a single node within the communications range of the originating node if a network pathway to the destination node is known by the originating node, the single node being the first intermediate node identified in the known network pathway, said step of communicating including sending the message and the known network pathway to the first intermediate node, or

(ii) communicating with one or more first intermediate nodes within the communications range of the originating node if a network pathway to the destination node is unknown by the originating node, said step of communicating including sending the message; and

(b) thereafter, further communicating the message by each first intermediate node by:

(i) communicating with just a single node within the communications range of that first intermediate node if a single network pathway to the destination node is known by that first intermediate node, the single node being the node identified next after that first intermediate node in the single network pathway, including sending, to the single node,

(A) the message, and

(B) the known network pathway, and

(ii) if a plurality of network pathways to the destination node are known by that first intermediate node, then,

(A) determining a preferred network pathway from the plurality of known network pathways in accordance with an algorithm, and

(B) communicating with just a single node within the communications range of that first intermediate node, the single node being the node identified next after that first intermediate node in the preferred network pathway, including sending, to the next identified node,

(I) the message, and

(II) the preferred network pathway, or

(iii) by each first intermediate node, if no network pathway is known, then communicating with one or more nodes within the communications range of that first intermediate node, including sending the message;

(c) wherein the originating node is configured to

(i) determine if a network pathway to the destination node is known,

(ii) attempt to communicate with just a single node of a known network pathway if a network pathway is known, and

(iii) attempt to communicate with one or more nodes within the communications range of the originating node if no network pathway to the destination node is known; and

(d) wherein each first intermediate node is configured to

(i) determine if one or more network pathways to the destination node are known,

(ii) attempt to communicate, if just a single network pathway to the destination node is known by that first intermediate node, with just a single node of that single known network pathway,

(iii) determine, if a plurality of network pathways to the destination node are known by that first intermediate node, a preferred network pathway, and attempt to communicate with just a single node of such a determined preferred network pathway, and

(iv) attempt to communicate, if no network pathway to the destination node is known by that first intermediate node, with one or more nodes within the communications range of that first intermediate node.

9. The method of claim 8 , wherein the determining of a preferred network pathway from the known network pathways in accordance with an algorithm comprises both (a) comparing, for each known network pathway, the number of hops, between nodes, that are required to reach the destination node, and (b) comparing the overall link quality of the respective known network pathways.

Assignments (4)
CHANGE OF NAME Recorded Oct 2, 2017
From: GOOGLE INC.
To: GOOGLE LLC
Reel/Frame 044101/0405 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 24, 2012
From: KLJ CONSULTING LLC
To: GOOGLE INC.
Reel/Frame 028100/0701 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2011
From: TERAHOP NETWORKS, INC.
To: KLJ CONSULTING LLC
Reel/Frame 027422/0740 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 29, 2006
From: TWITCHELL, ROBERT W., JR.
To: TERAHOP NETWORKS, INC.
Reel/Frame 018564/0353 →
Continuity (2)
Provisional Application 60696159 · Jul 1, 2005
Related Publication 20070002792A1 · Jan 4, 2007