System for and method of relational database modeling of ad hoc distributed sensor networks

• US 6,816,862 B2
• Filed: 01/17/2002
• Issued: 11/09/2004
• Est. Priority Date: 01/17/2001
• Status: Expired due to Fees

• Current Assignee: Tiax, LLC
• Original Assignee: Tiax, LLC
• Inventors: Mulgund, Sandeep S., Fricke, Robert, Mohindra, Sanjeev
• Primary Examiner(s): CHOULES, JACK M
• Application Number:
  US10/051,844
• Publication Number:
  US 20020161751A1
• Time in Patent Office: 1,027 Days
• Field of Search: 707/10, 709/223, 709/224
• US Class Current: 1/1
• CPC Class Codes: H04L 41/024 using relational databases for representation of network management data, e.g. managing via structured query language [SQL]
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 40/30 for proactive routing
• CPC Class Codes: H04W 40/34 Modification of an existing route
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 88/08 Access point devices

Abstract

Method of and system for aggregating into a relational database model the state of an ad hoc network comprised of uniquely addressable distributed sensor nodes in communication using networking protocols with one another through links and to a database server through access points. A relational database logical design resident on the database server is dynamically updated with respect to the sensor network'"'"'s current and historical topological information through the use of a traversal and interrogating network modeling agent. The distributed sensors nodes may be mobile, and may communicate by wired or wireless means through networking protocols such as the Internet.

Claims

1. A method of aggregating into a relational database model the state of an ad hoc network comprised of uniquely addressable distributed sensor nodes in communication using networking protocols with one another through links and to a database server through access points, comprising the steps of:

providing a relational database logical design resident on the database server in communication with the distributed sensor network, wherein the logical design is comprised of one or more tables specifying sensor node identities and node activity indicators, timestamping information, link identification, linked nodes information, historical link information, historical node information, and acquired sensor output data;

discovering the distributed sensor network topology by applying at every access point an interrogating algorithm further comprising the steps of

visiting a first node,

marking the first node visited,

pushing the marked first node onto a stack, and

while the stack is non-empty,

querying the node at the top of the stack for a list of current links to the node at the top,

comparing the list of current links to a list of historical links to the node at the top of the stack and updating the historical link and historical node information, and if there are no unmarked nodes reachable from a current link then pop the stack,

otherwise visiting the next reachable unmarked node,

marking the next node and pushing it onto the stack;

building a database model of the distributed sensor network by updating the relational database logical design tables at each step of the discovering step;

maintaining the database model by periodically reapplying the interrogating algorithm, thereby updating the database model to account for sensor node and link additions and deletions.

2. The method of claim 1, wherein the distributed sensor nodes comprise mobile nodes.

3. The method of claim 1, wherein the database server is in communication with the distributed sensor network through wired means.

4. The method of claim 1, wherein the database server is in communication with the distributed sensor network through wireless means.

5. The method of claim 1, wherein the database server is in communication with the distributed sensor network via the Internet.

6. The method of claim 1, wherein the database server is located remotely from the distributed sensor network.

7. The method of claim 1, wherein the periodicity of reapplying the interrogating algorithm approximates real-time updating of the distributed sensor network state.

8. The method of claim 1, wherein the logical design further comprises data table information for mapping between one or more sensor nodes and the tables used to store the associated sensor output data associated with the one or more sensor nodes.

9. A network modeling agent for aggregating into a relational database model the state of an ad hoc network comprised of uniquely addressable distributed sensor nodes in communication using networking protocols with one another through links and to a database server through access points, the network modeling agent comprising:

a relational database logical design resident on the database server in communication with the distributed sensor network, wherein the logical design is comprised of one or more tables specifying sensor node identities and node activity indicators, timestamping information, link identification, linked nodes information, historical link information, historical node information, and acquired sensor output data;

computer code executable on the database server for executing at every access point the steps of;

discovering the distributed sensor network topology by visiting a first node,

marking the first node visited,

pushing the marked first node onto a stack, and

while the stack is non-empty,

querying the node at the top of the stack for a list of current links to the node at the top,

comparing the list of current links to a list of historical links to the node at the top of the stack and updating the historical link and historical node information,

and if there are no unmarked nodes reachable from a current link then pop the stack,

otherwise visiting the next reachable unmarked node, marking the next node and pushing it onto the stack;

building a database model of the distributed sensor network by updating the relational database logical design tables at each step of the discovering step; and

maintaining the database model by periodically rediscovering the distributed sensor network topology, thereby updating the database model to account for sensor node and link additions and deletions.