CN103369570B - Distributed T op-k querying method in wireless sensor network - Google Patents
Distributed T op-k querying method in wireless sensor network Download PDFInfo
- Publication number
- CN103369570B CN103369570B CN201310307014.3A CN201310307014A CN103369570B CN 103369570 B CN103369570 B CN 103369570B CN 201310307014 A CN201310307014 A CN 201310307014A CN 103369570 B CN103369570 B CN 103369570B
- Authority
- CN
- China
- Prior art keywords
- node
- rule
- data
- subset
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The present invention relates to one Distributed T op-k querying method in wireless sensor network, it comprises the steps: a, utilizes figure G to represent wireless sensor network G=(V, E); Corresponding UNICOM domination subset C is set up to described figure G, and obtains by rule node collection V ', in described UNICOM domination subset C, comprise some rule nodes; B, to all rule nodes comprised in above-mentioned UNICOM domination subset C, utilize BFS method, obtain with aggregation node v
1for the BFS of root sets; C, rule node are given out information to all by rule node, to make to be sent to corresponding rule node by the data that self holds by rule node, what rule node collected be together form data set S by its own domination by the data that the data of rule node and described rule node are held self; D, aggregation node v
1the data set S obtained with all rule nodes in above-mentioned BFS tree is for foundation, and inquiry obtains a required Top-k data.Step of the present invention is easy to operate, and search efficiency is high, wide accommodation.
Description
Technical field
The present invention relates to a kind of querying method, especially one Distributed T op-k querying method in wireless sensor network, belongs to the technical field of wireless sensor network query.
Background technology
Wireless sensor network is widely used in collects data, monitoring of environmental, utilize more efficiently, easily mode realize low cost, low-power consumption and the easy feature such as deployment.In wireless sensor network, how efficient and from sensor node, obtain desired data rapidly, be very important.
For wireless sensor network, its node is usually battery-powered, therefore how to allow network node efficiently work and one of main bugbear that prolong network lifetime is wireless sensor network to be faced.The height of wireless sensor network interior joint efficiency performs often by sensor node that energy that a specific task consumes weighs.For wireless sensor network, common object collects data to some meeting points (perception data of these data or node by the mode of single-hop or multi-hop from a series of wireless senser destination node, or the internal state data of node), network manager or user can analyze in real time to the data gathered, and grasp network operation situation.
But be subject to network data Routing Protocol, dispose the reason such as geographical position and transmission disturbance, wireless sensor network interior joint energy consumption is not balanced, and namely when part of nodes will exhaust energy soon, other node still has enough energy.In this case, in order to ensure the integrality of wireless sensor network data, the unique method extending network lifecycle is that the node being about to exhaust for energy supplements battery; And under the condition of budget restriction, a part of node replacement battery minimum for electricity is obviously most economical effective method.If we can find corresponding wireless sensor node fast, we just can rapidly for they change battery.Except above-mentioned sight, when wireless sensor network carries out data acquisition in use, in order to reduce Internet Transmission burden, usually only need to gather and critical data in awareness network.Such as, produce the state information etc. of some the most serious nodes of packet loss in network.
At present, based on top-k inquiry correlative study mainly for database Related Research Domain, SILBERSTEIN, A., BRAYNARD, R., ELLIS, C., MUNAGALA, K., ANDYANG, J.Asampling-basedapproachtooptimizingtop-kqueriesinsenso rnetworks.Proc.ofIntl.Conf.onDataEngineering (2006). disclose the inquiry for distributed network or wireless sensor network, but still can not meet requirement and the application demand of quick search in wireless sensor network.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, provide one Distributed T op-k querying method in wireless sensor network, its step is easy to operate, and search efficiency is high, and wide accommodation is safe and reliable.
According to technical scheme provided by the invention, one Distributed T op-k querying method in wireless sensor network, described Distributed T op-k querying method comprises the steps:
A, utilize figure G to represent wireless sensor network G=(V, E), wherein, V is the set V={v comprising all wireless sensor network nodes
1, v
2..., V
n, E comprises the limit between all wireless sensor nodes; Corresponding UNICOM domination subset C is set up to described figure G, and obtains by rule node collection V ', in described UNICOM domination subset C, comprise some rule nodes;
B, to all rule nodes comprised in above-mentioned UNICOM domination subset C, utilize BFS method, obtain with aggregation node v
1for the BFS of root sets;
C, rule node are given out information to all by rule node, to make to be sent to corresponding rule node by the data that self holds by rule node, what rule node collected be together form data set S by its own domination by the data that the data of rule node and described rule node are held self;
D, aggregation node v
1the data set S obtained with all rule nodes in above-mentioned BFS tree is for foundation, and inquiry obtains a required Top-k data.
In described step a, utilize greedy algorithm to set up for figure G and obtain UNICOM domination subset C.
Described step a comprises the steps:
The subset C ' of a1, setting figure G is C '={ v
1, and set V ' '=V/{v
1;
A2, for all node in set V ' ', according to the descending arrangement of degree, by some v maximum for degree
mremove from set V ' ' and join in subset C ', be i.e. C '=C ' ∪ { v
m, set V ' '=V ' '/{ v
m;
A3, by node v
mall neighbor nodes remove from set V ' ', and by all with node v
mrelevant limit is all deleted from E, all due to node v
mbe selected in subset C ' and cause self node of removing from set V ' ' to be formed by rule node, and described by rule node all with node v
mas rule node;
A4, repetition above-mentioned steps a2 and step a3, until the node in set V ' ' all has at least a neighbor node to be arranged in subset C ', nodes all in subset C ' constitutes the domination subset of figure G;
A5, greedy algorithm is utilized to select node from above-mentioned set V ' ', and the node of selection is joined in subset C ', make nodes all in subset C ' become the assembly of a UNICOM, obtain UNICOM domination subset C, obtained by rule node collection V ' by set V ' '.
Described steps d comprises the steps:
D1, setting numerical value L, numerical value U represent minimum value and the maximum of data interval to be checked respectively, and setup parameter variable t, utilize parametric variable t to be divided by the numerical intervals of numerical value L and numerical value U, obtain gathering { x
0, x
1..., x
t, x
t+1, wherein, x
0=L, x
t+1=U;
D2, aggregation node v
1according to parametric variable t, numerical value L and numerical value U to { x
1... x
tassignment;
D3, aggregation node v
1by the set { x after above-mentioned assignment
0, x
1..., x
t, x
t+1be broadcast to BFS tree in all rule nodes; Rule node receives aggregation node v
1set { the x of broadcast
0, x
1..., x
t, x
t+1after, the data of adding up in the data set S that described rule node self held are positioned at set { x
0, x
1..., x
t, x
t+1the number of respective bins, obtain statistic set { y
1..., y
i..., y
t, y
t+1, and by described statistic set { y
1..., y
i..., y
t, y
t+1be sent to aggregation node v
1; Wherein, y
irepresent that the data in data set S are positioned at interval (x
i-1, x
i] in data amount check, i ∈ [1, t+1];
D4, aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1, according to the k value of setting, search and compare set { x
0, x
1..., x
t, x
t+1in the large numerical value of kth, obtain numerical value x
k;
D5, aggregation node v
1by numerical value x
kbe broadcast to all rule nodes in BFS tree, self holds data to collect in S and is more than or equal to numerical value x by each rule node
kdata item, and described data item is reported aggregation node v
1, obtain Top-k data required in wireless sensor network.
Described steps d 4 comprises the steps:
D41, aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1add up all and be positioned at (x
0, x
1] interval data amount check r
1;
If d42 is r
1>k, then numerical value x
k∈ (x
0, x
1] within, make L=x
0, U=x
1, return steps d 2; Otherwise, make k=k-r
1;
D43, aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1add up all and be positioned at (x
1, x
2] interval data amount check r
2;
If d44 is r
2>k, then numerical value x
k∈ (x
1, x
2] within, make L=x
1, U=x
2, return steps d 2; Otherwise, make k=k-r
2;
D45, aggregation node v
1repeat above-mentioned comparison procedure, until carry out interval (x
j, x
j+1" time, k=0, then obtain the data x that in wireless sensor network, kth is large
k=x
j+1.
Described parametric variable t=8.
Advantage of the present invention: utilize figure G to represent wireless sensor network, the UNICOM setting up figure G arranges subset C and by rule node collection V ', utilizes width first traversal to obtain with aggregation node v
1for the BFS of root sets, collected the data acquisition being completed whole wireless sensor network by the data of rule node by rule node, aggregation node v
1according to number range to be checked and parametric variable t, the data set S to rule node adds up, and utilizes the result of statistics to search the large numerical value x of kth in wireless sensor network
k, aggregation node v
1by numerical value x
kobtain Top-k data in rule node data set S, step is easy to operate, and search efficiency is high, and wide accommodation is safe and reliable.
Embodiment
Below in conjunction with specific embodiment, the invention will be further described.
In the embodiment of the present invention, the wireless sensor network of given UNICOM has n node, uses v respectively
1, v
2..., v
nrepresent; Wherein, v is supposed
1for the aggregation node of specifying, namely other nodes will transfer data to node v by the mode of a jumping or multi-hop
1.Suppose that each sensor network nodes is held a data item respectively and (supposed node v
bthe data item A held
brepresent, wherein, b ∈ [1, n]).Here, A
bcan representative sensor node v
bstate parameter (as dump energy etc.) or collect sensing data (as humiture etc.).
For simplicity, we suppose any two node v
pand v
qthe value of the data item held is not identical, namely when p is not equal to q time, and A
pbe not equal to A
q.In actual applications, perhaps there will be A
pequal A
qsituation, at this moment we can compare v by employing
pwith v
qthe mode of node ID size determines A further
pand A
qsize.With first all data item are collected aggregation node v
1, then by aggregation node v
1use centralized algorithm completes the sequence work to all data item, and then obtain Top-k(here k be variable, the numerical value of k is determined by application demand) method different, the present invention designs a kind of distributed effective Top-k query method being applicable to wireless sensor network environment, under greatly transmitting the prerequisite of packet needed for reduction data, make aggregation node v
1in quick acquisition network, rank is the data item of front Top-k.Usual k is greater than the constant that 1 is less than n, and n is the number that wireless sensor network comprises node.In the embodiment of the present invention, Top-k is determined by application demand, is not strict maximum or minimum.Such as, if we want to obtain k minimum point of network node electricity, Top-k so here refers to the minimum k of an electricity point; For another example, if we want to obtain in network the temperature value of k the highest point of the temperature data that gathers, Top-k so here then refers in the temperature data that all-network node holds, the temperature data that maximum k the point of temperature value is held.For convenience of discussing, do not produce ambiguity, in the embodiment of the present invention, Top-k refers to the maximum k of the numerical value of all data item in network according to item.
Particularly, in the invention process, described Distributed T op-k querying method comprises the steps:
A, utilize figure G to represent wireless sensor network G=(V, E), wherein, V is the set V={v comprising all wireless sensor network nodes
1, v
2..., V
n, E comprises the limit between all wireless sensor nodes; Corresponding UNICOM domination subset C is set up to described figure G, and obtains by rule node collection V ', in described UNICOM domination subset C, comprise some rule nodes;
In the embodiment of the present invention, in described step a, utilize greedy algorithm to set up for figure G and obtain UNICOM domination subset C.Described step a comprises the steps:
The subset C ' of a1, setting figure G is C '={ v
1, and set V ' '=V/{v
1; Namely under initial situation, subset C ' only comprises aggregation node v
1, set V ' ' represents and comprises in set V except aggregation node v
1outer all nodes;
A2, for all node in set V ' ', according to the descending arrangement of degree, by some v maximum for degree
mremove from set V ' ' and join in subset C ', be i.e. C '=C ' ∪ { v
m, set V ' '=V ' '/{ v
m;
In the embodiment of the present invention, degree (degree) is the noun in graph theory, and referring to a node has how many limits.The object of sequence utilizes greedy algorithm, and all institutes be connected with this point (because the point that our degree of removing is maximum, are also a little all removed) at most by the node number at every turn removed simultaneously.
A3, by node v
mall neighbor nodes remove from set V ' ', and by all with node v
mrelevant limit is all deleted from E, all due to node v
mbe selected in subset C ' and cause self node of removing from set V ' ' to be formed by rule node, and described by rule node all with node v
mas rule node;
A4, repetition above-mentioned steps a2 and step a3, until the node in set V ' ' all has at least a neighbor node to be arranged in subset C ', nodes all in subset C ' constitutes the domination subset of figure G;
A5, greedy algorithm is utilized to select node from above-mentioned set V ' ', and the node of selection is joined in subset C ', make nodes all in subset C ' become the assembly of a UNICOM, obtain UNICOM domination subset C, obtained by rule node collection V ' by set V ' '.
Greedy algorithm is the method that the art is commonly used, and particularly, chooses a node at every turn and (be assumed to be v from set V ' '
h), v
hcan the non-UNICOM assembly of the middle maximum number of UNICOM subset C ', by v
hjoin in subset C ', and remove from set V ' '; Repeat this process, until all node UNICOMs in subset C ', obtain UNICOM domination subset C, obtained by rule node collection V ' by set V ' '.
B, to all rule nodes comprised in above-mentioned UNICOM domination subset C, utilize BFS method, obtain with aggregation node v
1for the BFS of root sets;
In mode of the present invention, utilizing BFS method (BFS) to set up BFS tree is the technological means of the art routine, repeats no more herein.
C, rule node are given out information to all by rule node, to make to be sent to corresponding rule node by the data that self holds by rule node, what rule node collected be together form data set S by its own domination by the data that the data of rule node and described rule node are held self;
In the embodiment of the present invention, after step c, data item all in wireless sensor network all set by BFS in rule node hold; In the embodiment of the present invention, the wireless sensor network disposed can't be changed after step a and step b, actual carry out collection data time, the BFS tree of setting up according to step a and step b, rule node, carried out the process of data acquisition by rule node.
D, aggregation node v
1the data set S obtained with all rule nodes in above-mentioned BFS tree is for foundation, and inquiry obtains a required Top-k data.
Described steps d comprises the steps:
D1, setting numerical value L, numerical value U represent minimum value and the maximum of data interval to be checked respectively, and setup parameter variable t, utilize parametric variable t to be divided by the numerical intervals of numerical value L and numerical value U, obtain gathering { x
0, x
1..., x
t, x
t+1, wherein, x
0=L, x
t+1=U;
In the embodiment of the present invention, described parametric variable t=8, as parametric variable t=8, can accelerate whole query search process better.Such as, if the data item in wireless sensor network is by the nonnegative integer of 4 byte representations, so under initial situation, L=0, U=65535; When inquiring about the electricity of network node in wireless sensor network, under initial situation, L=0, U=100, when inquiring about the data item in other situations, numerical value L and numerical value U has different values, will not enumerate herein.
D2, aggregation node v
1according to parametric variable t, numerical value L and numerical value U to { x
1... x
tassignment;
In the embodiment of the present invention, during assignment, be divided into isometric (t+1) individual interval, x by ascending for all numerical value between numerical value L and numerical value U
1..., x
tthe point of interface between interval respectively;
D3, aggregation node v
1by the set { x after above-mentioned assignment
0, x
1..., x
t, x
t+1be broadcast to BFS tree in all rule nodes; Rule node receives aggregation node v
1set { the x of broadcast
0, x
1..., x
t, x
t+1after, the data of adding up in the data set S that described rule node self held are positioned at set { x
0, x
1..., x
t, x
t+1the number of respective bins, obtain statistic set { y
1..., y
i..., y
t, y
t+1, and by described statistic set { y
1..., y
i..., y
t, y
t+1be sent to aggregation node v
1; Wherein, y
irepresent that the data in data set S are positioned at interval (x
i-1, x
i] in data amount check, i ∈ [1, t+1];
D4, aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1, according to the k value of setting, search and compare set { x
0, x
1..., x
t, x
t+1in the large numerical value of kth, obtain numerical value x
k;
Described steps d 4 comprises the steps:
D41, aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1add up all and be positioned at (x
0, x
1] interval data amount check r
1; In the embodiment of the present invention, data amount check r
1equal corresponding y in the statistic combination of all rule nodes transmission
1cumulative sum, the account form of following data amount check and data amount check r
1identical, repeat no more.
If d42 is r
1>k, then numerical value x
k∈ (x
0, x
1] within, make L=x
0, U=x
1, return steps d 2; Otherwise, make k=k-r
1;
D43, aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1add up all and be positioned at (x
1, x
2] interval data amount check r
2;
If d44 is r
2>k, then numerical value x
k∈ (x
1, x
2] within, make L=x
1, U=x
2, return steps d 2; Otherwise, make k=k-r
2;
D45, aggregation node v
1repeat above-mentioned comparison procedure, until carry out interval (x
j, x
j+1", time j ∈ [1, t], k=0, then obtain the data x that in wireless sensor network, kth is large
k=x
j+1.
D5, aggregation node v
1by numerical value x
kbe broadcast to all rule nodes in BFS tree, self holds data to collect in S and is more than or equal to numerical value x by each rule node
kdata item, and described data item is reported aggregation node v
1, obtain Top-k data required in wireless sensor network.
The present invention utilizes figure G to represent wireless sensor network, and the UNICOM setting up figure G arranges subset C and by rule node collection V ', utilizes width first traversal to obtain with aggregation node v
1for the BFS of root sets, collected the data acquisition being completed whole wireless sensor network by the data of rule node by rule node, aggregation node v
1according to number range to be checked and parametric variable t, the data set S to rule node adds up, and utilizes the result of statistics to search the large numerical value x of kth in wireless sensor network
k, aggregation node v
1by numerical value x
kobtain Top-k data in rule node data set S, step is easy to operate, and search efficiency is high, and wide accommodation is safe and reliable.
Claims (4)
1. a Distributed T op-k querying method in wireless sensor network, is characterized in that, described Distributed T op-k querying method comprises the steps:
(a), utilize figure G to represent wireless sensor network G=(V, E), wherein, V is the set V={v comprising all wireless sensor network nodes
1, v
2..., V
n, E comprises the limit between all wireless sensor nodes; Corresponding UNICOM domination subset C is set up to described figure G, and obtains by rule node collection V ', in described UNICOM domination subset C, comprise some rule nodes;
(b), to all rule nodes comprised in above-mentioned UNICOM domination subset C, utilize BFS method, obtain with aggregation node v
1for the BFS of root sets;
C (), rule node are given out information to all by rule node, to make to be sent to corresponding rule node by the data that self holds by rule node, what rule node collected be together form data set S by its own domination by the data that the data of rule node and described rule node are held self;
(d), aggregation node v
1the data set S obtained with all rule nodes in above-mentioned BFS tree is for foundation, and inquiry obtains a required Top-k data;
In described step (a), utilize greedy algorithm to set up for figure G and obtain UNICOM domination subset C;
Described step (a) comprises the steps:
(a1) the subset C ', setting figure G is C '={ v
1, and set V "=V/{v
1;
(a2), for set V " in all node, according to the descending arrangement of degree, by some v maximum for degree
mfrom set V " remove and join in subset C ', be i.e. C '=C ' ∪ { v
m, set V "=V "/{ v
m;
(a3), by node v
mall neighbor nodes are from set V " remove, and by all with node v
mrelevant limit is all deleted from E, all due to node v
mbe selected in subset C ' and cause self from set V " the node that removes formed by rule node, and described by rule node all with node v
mas rule node;
(a4), repeat above-mentioned steps (a2) and step (a3), until set V " in node all have at least a neighbor node to be arranged in subset C ', nodes all in subset C ' constitutes the domination subset of figure G;
(a5) greedy algorithm, is utilized from above-mentioned set V " select node; and the node of selection is joined in subset C '; make nodes all in subset C ' become the assembly of a UNICOM, obtain UNICOM domination subset C, " obtained by rule node collection V ' by set V.
2. according to claim 1 in wireless sensor network Distributed T op-k querying method, it is characterized in that, described step (d) comprises the steps:
(d1), setting numerical value L, numerical value U represent minimum value and the maximum of data interval to be checked respectively, and setup parameter variable t, utilize parametric variable t to be divided by the numerical intervals of numerical value L and numerical value U, obtain set { x
0, x
1..., x
t, x
t+1, wherein, x
0=L, x
t+1=U;
(d2), aggregation node v
1according to parametric variable t, numerical value L and numerical value U to { x
1... x
tassignment;
(d3), aggregation node v
1by the set { x after above-mentioned assignment
0, x
1..., x
t, x
t+1be broadcast to BFS tree in all rule nodes; Rule node receives aggregation node v
1set { the x of broadcast
0, x
1..., x
t, x
t+1after, the data of adding up in the data set S that described rule node self held are positioned at set { x
0, x
1..., x
t, x
t+1the number of respective bins, obtain statistic set { y
1..., y
i..., y
t, y
t+1, and by described statistic set { y
1..., y
i..., y
t, y
t+1be sent to aggregation node v
1; Wherein, y
irepresent that the data in data set S are positioned at interval (x
i-1, x
i] in data amount check, i ∈ [1, t+1];
(d4), aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1, according to the k value of setting, search and compare set { x
0, x
1..., x
t, x
t+1in the large numerical value of kth, obtain numerical value x
k;
(d5), aggregation node v
1by numerical value x
kbe broadcast to all rule nodes in BFS tree, self holds data to collect in S and is more than or equal to numerical value x by each rule node
kdata item, and described data item is reported aggregation node v
1, obtain Top-k data required in wireless sensor network.
3. according to claim 2 in wireless sensor network Distributed T op-k querying method, it is characterized in that, described step (d4) comprises the steps:
(d41), aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1add up all and be positioned at (x
0, x
1] interval data amount check r
1;
(d42) if r
1>k, then numerical value x
k∈ (x
0, x
1] within, make L=x
0, U=x
1, return step (d2); Otherwise, make k=k-r
1;
(d43), aggregation node v
1according to the statistic set { y that all rule nodes transmit
1..., y
i..., y
t, y
t+1add up all and be positioned at (x
1, x
2] interval data amount check r
2;
(d44) if r
2>k, then numerical value x
k∈ (x
1, x
2] within, make L=x
1, U=x
2, return step (d2); Otherwise, make k=k-r
2;
(d45), aggregation node v
1repeat above-mentioned comparison procedure, until carry out interval (x
j, x
j+1] time, k=0, then obtain the data x that in wireless sensor network, kth is large
k=x
j+1.
4. according to claim 2 in wireless sensor network Distributed T op-k querying method, it is characterized in that: described parametric variable t=8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310307014.3A CN103369570B (en) | 2013-07-19 | 2013-07-19 | Distributed T op-k querying method in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310307014.3A CN103369570B (en) | 2013-07-19 | 2013-07-19 | Distributed T op-k querying method in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103369570A CN103369570A (en) | 2013-10-23 |
| CN103369570B true CN103369570B (en) | 2016-04-06 |
Family
ID=49369878
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310307014.3A Active CN103369570B (en) | 2013-07-19 | 2013-07-19 | Distributed T op-k querying method in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103369570B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103617197B (en) * | 2013-11-13 | 2016-11-23 | 清华大学 | Based on the top-k querying method of composite data in wireless sensor network and system |
| CN104812015B (en) * | 2015-05-14 | 2018-09-11 | 江苏大学 | A kind of Distributed T op-k querying methods of internet of things oriented data |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143547B (en) * | 2011-01-24 | 2013-07-17 | 中国人民大学 | Continuous Top-k region query method in wireless sensor network |
| CN102163218B (en) * | 2011-03-28 | 2012-10-10 | 武汉大学 | Graph-index-based graph database keyword vicinity searching method |
| US8296306B1 (en) * | 2011-11-28 | 2012-10-23 | Korea Advanced Institute Of Science And Technology | Linear-time top-k sort method |
-
2013
- 2013-07-19 CN CN201310307014.3A patent/CN103369570B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN103369570A (en) | 2013-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106357305A (en) | Self-networking method, device and system of tree structure network | |
| Tang et al. | A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink | |
| Pham et al. | Minimizing latency for multiple-type data aggregation in wireless sensor networks | |
| Ahn et al. | Balanced chain-based routing protocol (BCBRP) for energy efficient wireless sensor networks | |
| Kumar et al. | Improving network life time using static cluster routing for wireless sensor networks | |
| Todolí-Ferrandis et al. | RPL routing in a real life scenario with an energy efficient objective function | |
| Ayoob et al. | Research of improvement on LEACH and SEP routing protocols in wireless sensor networks | |
| CN103369570B (en) | Distributed T op-k querying method in wireless sensor network | |
| Salah et al. | Energy efficient clustering based on LEACH | |
| Zhang et al. | Topology performance analysis of zigbee network in the smart home environment | |
| Mollanejad et al. | EHRP: Novel energy-aware hierarchical routing protocol in wireless sensor network | |
| CN107911834B (en) | Method for constructing optimal DAG (demand oriented architecture) in lifetime in data-centered wireless sensor network | |
| Chen et al. | Scheduling for data collection in multi-hop IEEE 802.15. 4e TSCH networks | |
| Huang et al. | A backbone-aware topology formation (BATF) scheme for ZigBee wireless sensor networks | |
| Cheng et al. | LDDP: A location-based directed diffusion routing protocol for smart home sensor network | |
| Wesnarat et al. | A power efficient algorithm for data gathering from wireless water meter networks | |
| CN107911851B (en) | Life period optimal DAG decomposition method in data-centered wireless sensor network | |
| Nayaka et al. | QoS analysis of WSN based cluster tree data fusion for integrated public utility management | |
| Tripathi et al. | Quantifying load imbalance: A practical implementation for data collection in low power lossy networks | |
| Kumar et al. | Data aggregation in wireless sensor networks | |
| Divya et al. | Comparison of GSTEB, HEED and PEGASIS protocols | |
| Semente et al. | Energy-efficient WSN systems | |
| Murdan | Optimisation of the Wireless Sensor Network with the Multi-hop LEACH protocol for the Smart Grid | |
| Deb et al. | Harvested profile aware multi hop routing protocol for wireless sensor network | |
| Din et al. | Energy source saving approach using multi-tier network design technique |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |