SENSOR NODES IN MULTIPLE SENSOR NETWORK, METHOD FOR CREATING GRID-BASED TREE OF SENSOR NODES AND SPATIAL QUERY PROCESSING SYSTEM USING GRID-BASED TREE
First Claim
1. A method for creating a grid-based tree in a multiple sensor network, the method comprising:
- dividing an entire search area in which a base station node and a plurality of sensor nodes are disposed into a specific number of grid areas;
assigning a grid ID to each of the grid areas;
setting, sequentially from the base station node to each of the sensor node, level information, candidate child nodes and candidate parent nodes, and storing the same in the respective nodes;
storing, in the respective nodes, a grid ID of a grid area in which the respective nodes locate;
selecting, for the respective sensor nodes, a parent node based on the grid ID, the level information, and the candidate parent nodes stored in respective sensor nodes;
calculating, for the respective nodes, minimum bounding rectangles each of which includes a child node of corresponding node and nodes descended from the child node, and storing the minimum bounding rectangles in the respective nodes; and
creating the grid-based tree by using the minimum bounding rectangles.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for creating a grid-based tree in a multiple sensor network includes: dividing an entire area in which a base station node and a plurality of sensor nodes are disposed into grid areas; assigning a grid ID to each of the grid areas; setting, sequentially from the base station node to each of the sensor node, level information, candidate child nodes and candidate parent nodes; storing a grid ID of a grid area in which the respective nodes locate; selecting, for the respective sensor nodes, a parent node based on the grid ID, the level information, and the candidate parent nodes; and calculating, for the respective nodes, minimum bounding rectangles each of which includes a child node of corresponding node and nodes descended from the child node. The grid-based tree is calculated by using the minimum bounding rectangles.
-
Citations
15 Claims
-
1. A method for creating a grid-based tree in a multiple sensor network, the method comprising:
-
dividing an entire search area in which a base station node and a plurality of sensor nodes are disposed into a specific number of grid areas; assigning a grid ID to each of the grid areas; setting, sequentially from the base station node to each of the sensor node, level information, candidate child nodes and candidate parent nodes, and storing the same in the respective nodes; storing, in the respective nodes, a grid ID of a grid area in which the respective nodes locate; selecting, for the respective sensor nodes, a parent node based on the grid ID, the level information, and the candidate parent nodes stored in respective sensor nodes; calculating, for the respective nodes, minimum bounding rectangles each of which includes a child node of corresponding node and nodes descended from the child node, and storing the minimum bounding rectangles in the respective nodes; and creating the grid-based tree by using the minimum bounding rectangles. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A spatial query processing system in a multiple sensor network, wherein an entire search area of the network includes a plurality of sensor networks each having a plurality of nodes and is divided into grid areas having different grid IDs, the system comprising:
-
a query analyzing unit for analyzing an input query to divide the input query into queries to be transmitted to the respective sensor networks, the queries including a query relating to a spatial search and a query not relating to the spatial search; a query processing unit for receiving a query result data of the query not relating to the spatial search and changing, based on the received query result data, a spatial condition in the query related to the spatial search; and a query transmitting unit for transmitting to the respective sensor networks the query received from the query analyzing unit and the query changed by the query processing unit. - View Dependent Claims (12, 13)
-
-
14. Sensor nodes in a multiple sensor network, wherein an entire search area including a plurality of sensor networks is divided into grid areas having different grid IDs, each of the sensor nodes comprising:
-
a spatial search unit for receiving a query containing grid IDs as a spatial condition and performing a spatial search based on the grid IDs; a query processing unit for processing the query based on a spatial search result of the spatial search unit; and a result collection unit for collecting result data of the query processing unit, wherein the sensor nodes are connected in a Grid-based tree structure, and, each of the sensor nodes stores therein a grid ID of a grid in which the sensor node locates, level information of the sensor node, information on child nodes and a parent node of the sensor node and a minimum bounding rectangle for each of the child nodes, each minimum bounding rectangle including one of the child nodes and nodes descended from the child node. - View Dependent Claims (15)
-
Specification