Method for routing packets in a packet communication network

• US 4,939,726 A
• Filed: 07/18/1989
• Issued: 07/03/1990
• Est. Priority Date: 07/18/1989
• Status: Expired due to Term

• Current Assignee: Proxim Wireless Corporation
• Original Assignee: Metricom, Inc.
• Inventors: Flammer, George H., Kalkwarf, Robert L.
• Primary Examiner(s): Olms, Douglas W.
• Application Number:
  US07/383,273
• Time in Patent Office: 350 Days
• Field of Search: 370/60, 370/94, 370/60.1, 370/94.1, 370/94.2, 370/94.3, 340/825.5, 340/825.51
• US Class Current: 370/400
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00

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. Each node of the network collects in a table or is otherwise provided with information about the quality of communication between itself and its neighboring nodes. When a data packet has been received at a node, it is routed further through the network based on criteria derived from the history of communication between the local node and its neighbors.

Claims

1. A method for routing packets of data in a packet data communication network without a network directory 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; and

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.

2. A method for routing packets of data without a network directory 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 said local node, selecting at least one of said neighboring nodes by using said packet header and other information specific to said local node according to preselected criteria; and

forwarding said packet to said selected neighboring nodes for eventual delivery to said ultimate destination node.