← Back to Patent Explorer
US5453977A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for network configuration via third party query

Assignee: Google LLC
•
Filing: 1994-02-08
•
Granted: 1995-09-26
•
Expires: 2014-02-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a mesh communication network, new network nodes acquire information about nearby nodes to which they may communicate through a third-party query whereby an established node with which a new node can communicate is queried to provide a list of nodes in the vicinity of the new nodes with which the new node is likely to be able to communicate. The new node uses this list in attempting to establish communication links and then repeats the third-party query for each node in the list to which it can communicate.

Inventors

  • 👤 George H. Flammer, III
  • 👤 William E. San Filippo, III

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 21:04
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/16

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 120 words
In network with a plurality of nodes, a method by which a node may acquire a list of communication links comprising the steps of: transmitting on random channels link acquisition packets; receiving a response packet from at least a first established node, said established node being a node that has acquired a plurality of links to neighboring nodes; obtaining from said first established node a link list of said first established node; utilizing said link list to direct acquisition packets to nodes on said link list; receiving a response packet from each node on said link list which can hear said acquisition packets; and adding each node from which a response packet is received to said list of communication links.
Claim 2
Dependent Claim 120 words
In network with a plurality of nodes, a method by which a node may acquire a list of communication links comprising the steps of: transmitting on random channels link acquisition packets; receiving a response packet from at least a first established node, said established node being a node that has acquired a plurality of links to neighboring nodes; obtaining from said first established node a link list of said first established node; utilizing said link list to direct acquisition packets to nodes on said link list; receiving a response packet from each node on said link list which can hear said acquisition packets; and adding each node from which a response packet is received to said list of communication links.
Claim 3
Dependent Claim 38 words
The method according to claim 1, further comprising the step of repeating said obtaining step, said utilizing step, said receiving step, and said adding step for each node that responds to any acquisition packet from said acquiring node.
Claim 4
Dependent Claim 12 words
The method according to claim 1 wherein said network uses non-directory-based routing.
Claim 5
Dependent Claim 169 words
In a digital mesh packet communication network having a plurality of stationary nodes and roaming nodes, each stationary node and roaming node capable of transmitting and receiving data packets on at least one of a plurality of channels to and from at least one other node, a method for configuring a node to acquire a list of new communication links comprising the steps of: transmitting link acquisition packets on a random sequence of channels until a response is received on at least one channel from at least a first established node, said established node being a node that has acquired a plurality of links to neighboring nodes; obtaining from said first established node a list of each node with which said first established node can communicate; directing link acquisition packets to nodes on said list; receiving a response packet from each node on said list which can hear said acquisition packets; and adding each node from which a response packet is received to said list of new communication links.
Claim 6
Dependent Claim 169 words
In a digital mesh packet communication network having a plurality of stationary nodes and roaming nodes, each stationary node and roaming node capable of transmitting and receiving data packets on at least one of a plurality of channels to and from at least one other node, a method for configuring a node to acquire a list of new communication links comprising the steps of: transmitting link acquisition packets on a random sequence of channels until a response is received on at least one channel from at least a first established node, said established node being a node that has acquired a plurality of links to neighboring nodes; obtaining from said first established node a list of each node with which said first established node can communicate; directing link acquisition packets to nodes on said list; receiving a response packet from each node on said list which can hear said acquisition packets; and adding each node from which a response packet is received to said list of new communication links.
Claim 7
Dependent Claim 38 words
The method according to claim 4 further comprising the step of repeating said obtaining step, said directing step, said receiving step, and said adding step for each node that responds to any acquisition packet from said acquiring node.
Claim 8
Dependent Claim 12 words
The method according to claim 4 wherein said network uses non-directory-based routing.
Claim 9
Dependent Claim 19 words
The method according to claim 4 wherein each of said stationary nodes is uniquely identified by absolute geographic coordinates.
Claim 10
Dependent Claim 57 words
The method according to claim 4 wherein a roaming node changing its geographic location from a first location at which it had established a list of communication links to a second location, transmits, at said second location, link acquisition packets to those nodes with which it was able to communicate when it was at said first location.
Claim 11
Dependent Claim 311 words
In a digital mesh packet communication network having a plurality of stationary nodes and roaming nodes, each stationary node and roaming node capable of transmitting and receiving data packets on at least one of a plurality of channels to and from at least one other node, a method for a new node to acquire information regarding available communication links in the network comprising the steps of: transmitting link acquisition packets on a plurality of channels until a response is received on at least one channel from at least a first established node, said established node being a node that has acquired a plurality of links neighboring nodes; storing at said new node data regarding the communication link with said first established node in a link table; obtaining from said first established node a first list of nodes with which said first established node can communicate; directing acquisition packets to nodes on said first list; receiving a response packet from each node on said first list which can hear said acquisition packets; adding data regarding communication links with each node on said first list that responds to said link table and storing information regarding nodes that do not respond in a failed communication table; acquiring from each of said responding nodes, a second list of nodes with which each of said responding nodes can communicate; comparing said nodes on said second lists with said nodes in said node link table and said failed communication table; directing link acquisition packets to nodes on said second lists that are not on said link table or said failed communication table; establishing communications links with nodes that respond by repeating said receiving step, said adding step, said acquiring step, said comparing step and said directing step for each node that is placed on said link table unit no new nodes are added to said link table.
Claim 12
Dependent Claim 311 words
In a digital mesh packet communication network having a plurality of stationary nodes and roaming nodes, each stationary node and roaming node capable of transmitting and receiving data packets on at least one of a plurality of channels to and from at least one other node, a method for a new node to acquire information regarding available communication links in the network comprising the steps of: transmitting link acquisition packets on a plurality of channels until a response is received on at least one channel from at least a first established node, said established node being a node that has acquired a plurality of links neighboring nodes; storing at said new node data regarding the communication link with said first established node in a link table; obtaining from said first established node a first list of nodes with which said first established node can communicate; directing acquisition packets to nodes on said first list; receiving a response packet from each node on said first list which can hear said acquisition packets; adding data regarding communication links with each node on said first list that responds to said link table and storing information regarding nodes that do not respond in a failed communication table; acquiring from each of said responding nodes, a second list of nodes with which each of said responding nodes can communicate; comparing said nodes on said second lists with said nodes in said node link table and said failed communication table; directing link acquisition packets to nodes on said second lists that are not on said link table or said failed communication table; establishing communications links with nodes that respond by repeating said receiving step, said adding step, said acquiring step, said comparing step and said directing step for each node that is placed on said link table unit no new nodes are added to said link table.
Claim 13
Dependent Claim 12 words
The method according to claim 9 wherein said network uses non-directory-based routing.
Claim 14
Dependent Claim 19 words
The method according to claim 9 wherein each of said stationary nodes is uniquely identified by absolute geographic coordinates.
Claim 15
Dependent Claim 58 words
The communications network according to claim 9 wherein a roaming node changing its geographic location from a first location at which it had established a list of communication links to a second location, transmits, at said second location, link acquisition packets to those nodes with which it was able to communicate when it was at said first location.

References Cited (Backward Citations)

US4939726A Cited
US5243592A Cited
US5276680A Cited
US5295154A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-09-25 1999-03-27 1999-09-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-09-25 2003-03-27 2003-09-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-09-25 2007-03-27 2007-09-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag