Patent US96237A successfully refreshed from Google Patents.
Patent US5115433A successfully refreshed from Google Patents.
US5115433A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for routing packets in a packet communication network
Assignee: Proxim Wireless Corp
•
Filing: 1990-04-20
•
Granted: 1992-05-19
•
Expires: 2010-04-20
Abstract
Abstract A packet network routing method and system based on geographic coordinate identifiers is described. Each node in a network is uniquely identified by absolute geographical coordinates or by a code indicating absolute location in an external coordinate-based reference system (node coordinates), and such absolute geographical coordinates or the equivalent are employed as part of a packet identifier for each packet generated for use in making routing decisions. The node coordinates of a local node and its neighboring nodes and the packet coordinates are used by means at each node through which a packet is routed for determining a desired forwarding route of a data packet. The routing may be prioritized according to preselected criteria, preferably achieving maximum forward progress using the least amount of power. The packet routing protocol according to the invention requires no routing directory or table to perform data routing.
Inventors
- 👤 Paul Baran
- 👤 George H. Flammer, III
- 👤 Robert L. Kalkwarf
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 12:32
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/04
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
160 words
A method for routing packets of data without a network director comprising the steps of: assigning to each node in a network an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid; addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; at a lock node, selecting at least one of a plurality of neighboring nodes by using said packet header and other information specific to said lock node according to preselected criteria; forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node; and selecting one neighboring node requiring the least amount of power for forwarding said packet.
Claim 2
Independent Claim
160 words
A method for routing packets of data without a network director comprising the steps of: assigning to each node in a network an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid; addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; at a lock node, selecting at least one of a plurality of neighboring nodes by using said packet header and other information specific to said lock node according to preselected criteria; forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node; and selecting one neighboring node requiring the least amount of power for forwarding said packet.
Claim 3
Dependent Claim
30 words
The method according to claim 1 wherein said selecting step includes using said packet header to determine distance of said plurality of neighboring nodes relative to said ultimate destination node.
Claim 4
Dependent Claim
29 words
The method according to claim 1 wherein said selecting step includes developing a local table for maintaining communication history between said lock node and said plurality of neighboring nodes.
Claim 5
Dependent Claim
59 words
The method according to claim 3 wherein said lock table maintains information about said neighboring nodes on at least one of the following criteria: distance, output power required to establish communication, retry history, throughput history, speed of transfer, network delay, data priority, link utilization percentage, closeness to desired destination closeness to desired bearing, randomness, and closeness to local bearing.
Claim 6
Dependent Claim
18 words
The method according to claim 3 wherein a link quality factor is employed to define preferred communication paths.
Claim 7
Independent Claim
107 words
A system for routing packets of data in a packet data communication network without a network director comprising: a plurality of nodes in a network, each node including an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid; and means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node.
Claim 8
Independent Claim
107 words
A system for routing packets of data in a packet data communication network without a network director comprising: a plurality of nodes in a network, each node including an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid; and means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node.
Claim 9
Independent Claim
152 words
A system for routing packets of data without a network director comprising: a plurality of nodes in a network, each node including an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid; means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; at a lock node, means for selecting at least one of a plurality of neighboring nodes by using said packet header and other information specific to said lock node according to preselected criteria; and means for forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node.
Claim 10
Independent Claim
152 words
A system for routing packets of data without a network director comprising: a plurality of nodes in a network, each node including an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid; means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; at a lock node, means for selecting at least one of a plurality of neighboring nodes by using said packet header and other information specific to said lock node according to preselected criteria; and means for forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node.
Claim 11
Dependent Claim
27 words
The system according to claim 7 wherein said selecting means comprises means for selecting one neighboring node requiring the least amount of power for forwarding said packet.
Claim 12
Dependent Claim
32 words
The system according to claim 7 wherein said selecting means includes means for using said packet header to determine distance of said plurality of neighboring nodes relative to said ultimate destination node.
Claim 13
Dependent Claim
29 words
The system according to claim 7 wherein said selecting means includes means for developing a local table for maintaining communication history between said local node and said neighboring nodes.
Claim 14
Dependent Claim
59 words
The system according to claim 10 wherein said local table maintains information about said neighboring nodes on at least one of the following criteria: distance, output power required to establish communication, retry history, throughput history, speed of transfer, network delay, data priority, link utilization percentage, closeness to desired destination, closeness to desired bearing, randomness, and closeness to local bearing.
Claim 15
Dependent Claim
18 words
The system according to claim 10 wherein a link quality factor is employed to define preferred communication paths.
References Cited (Backward Citations)
US4135156A
Cited
US4074232A
Cited
US4168400A
Cited
US4320500A
Cited
US4516239A
Cited
US4534024A
Cited
US4598400A
Cited
US4525830A
Cited
US4550402A
Cited
US4663758A
Cited
US4661947A
Cited
US4644532A
Cited
US4679189A
Cited
US4894822A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-05-19 | 1995-11-18 | 1996-05-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-05-19 | 1999-11-18 | 2000-05-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-05-19 | 2003-11-18 | 2004-05-19 | $7700.00 | Window Closed / Lapsed |