CN103369570A - Method for inquiring distributed Top-k data in wireless sensor network - Google Patents
Method for inquiring distributed Top-k data in wireless sensor network Download PDFInfo
- Publication number
- CN103369570A CN103369570A CN2013103070143A CN201310307014A CN103369570A CN 103369570 A CN103369570 A CN 103369570A CN 2013103070143 A CN2013103070143 A CN 2013103070143A CN 201310307014 A CN201310307014 A CN 201310307014A CN 103369570 A CN103369570 A CN 103369570A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- rule
- nodes
- subset
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000002776 aggregation Effects 0.000 claims abstract description 50
- 238000004220 aggregation Methods 0.000 claims abstract description 50
- 230000005540 biological transmission Effects 0.000 claims description 13
- 230000004308 accommodation Effects 0.000 description 3
- 238000013459 approach Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention relates to a method for inquiring distributed Top-k data in the wireless sensor network. The method comprises the following steps that firstly, an image G is utilized for expressing the wireless sensor network, wherein G=(V, E), a corresponding communication predominating subset C for the image G is set, and a predominated node set V' is obtained, and the communication predominating subset C comprises a plurality of predominating nodes; secondly, a BFS tree with an aggregation node v1 as a root is obtained by the adoption of the breadth-first search method for all predominating nodes included by the communication predominating subset C; thirdly, the predominating nodes send information to all predominated nodes so that the predominated nodes can send data held by the predominated nodes to the corresponding predominating nodes, and a data set S is formed by the data collected by the predominating nodes and dominated by the predominated nodes and the data held by the predominating nodes; fourthly, the aggregation node v1 inquires and obtains the needed Top-k data based on the data set S obtained by all predominating nodes. The steps are carried out conveniently, inquiring efficiency is high, and the application range is wide.
Description
Technical field
The present invention relates to a kind of querying method, especially a kind of in wireless sensor network Distributed T op-k querying method, belong to the technical field of wireless sensor network query.
Background technology
Wireless sensor network is widely used in collects data, monitoring of environmental, utilizes more efficient, mode realizes low cost easily, the characteristics such as low-power consumption and easy deployment.In wireless sensor network, how efficient and from sensor node, obtain desired data rapidly, be very important.
Therefore for wireless sensor network, its node is usually battery-powered, how to allow network node efficient operation and the prolong network lifetime be one of main bugbears of facing of wireless sensor network.The energy that the height of node efficiency consumes by specific task of sensor node execution often in the wireless sensor network is weighed.For wireless sensor network, common purpose is to collect 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 nodes, or the internal state data of node), network manager or user can analyze in real time to the data that gather, and grasp network operation situation.
Yet, being subject to the network data Routing Protocol, disposing the reasons such as geographical position and transmission interference, the node energy consumption is not balanced in the wireless sensor network, namely when part of nodes will exhaust energy soon, other node still had enough energy.In this case, in order to guarantee the integrality of wireless sensor network data, the unique method that prolongs network lifecycle is the additional battery of node that is about to exhaust for energy; And under the condition that budget limits, a part of node replacement battery minimum for electric weight obviously is most economical effective method.If we can find corresponding wireless sensor node fast, we just can change battery for them rapidly.Except above-mentioned sight, when the use wireless sensor network carries out data acquisition, in order to reduce the Internet Transmission burden, usually only need the critical data in collection and the awareness network.Such as, produce the state information of some the most serious nodes of packet loss etc. in the network.
At present, based on the correlative study of top-k inquiry mainly for the database Related Research Domain, SILBERS TEIN, A., BRAYNARD, R., ELLIS, C., MUNAGALA, K., ANDYANG, J.A sampling-based approach to optimizing top-kqueries in sensor networks.Proc.of Intl.Conf.on Data Engineering (2006). disclose the inquiry for distributed network or wireless sensor network, but still can not satisfy requirement and the application demand of quick search in the wireless sensor network.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art, provide a kind of in wireless sensor network Distributed T op-k querying method, its step is easy to operate, search efficiency is high, wide accommodation is safe and reliable.
According to technical scheme provided by the invention, a kind of in wireless sensor network Distributed T op-k querying method, 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 that comprises all wireless sensor network nodes
1, v
2..., V
n, E is the limit that comprises between all wireless sensor nodes; Described figure G is set up the corresponding domination subset C of UNICOM, and obtain by rule node collection V ', comprise some rule nodes in the described domination subset C of UNICOM;
B, all rule nodes to comprising among the above-mentioned domination subset C of UNICOM utilize the BFS method, obtain with aggregation node v
1BFS tree for root;
C, rule node are given out information by rule node to all, so that the data of self being held by rule node send to corresponding rule node, the data of self being held with described rule node by the data of rule node by its own domination that rule node collects have consisted of data set S;
D, aggregation node v
1The data set S that all rule nodes obtain in the above-mentioned BFS tree is as foundation, and inquiry obtaining a required Top-k data.
Among the described step a, utilize greedy algorithm to set up for figure G and obtain the domination subset C of UNICOM.
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 nodes among the set V ' ', according to the descending arrangement of degree, will the maximum some v of degree
mFrom set V ' ', remove and join among the subset C ', be i.e. C '=C ' ∪ { v
m, set V ' '=V ' '/{ v
m;
A3, with node v
mAll neighbor nodes remove the V ' ' from set, and with all and node v
mAll delete from E on relevant limit, and all are because node v
mThe node that is selected among the subset C ' and causes self removing from set V ' ' forms 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 among the set V ' ' all has at least a neighbor node to be arranged in subset C ', all nodes have consisted of the domination subset of figure G among the subset C ';
A5, utilize greedy algorithm to select node from above-mentioned set V ' ', and the node of selecting joined among the subset C ', so that all nodes become the assembly of a UNICOM among the subset C ', obtain the domination subset C of UNICOM, V ' ' obtains by rule node collection V ' by set.
Described steps d comprises the steps:
D1, setting numerical value L, numerical value U represent respectively minimum value and the maximum of data interval to be checked, and setup parameter variable t, utilize parametric variable t that the numerical value interval of numerical value L and numerical value U is divided, and 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
1With the set { x after the above-mentioned assignment
0, x
1..., x
t, x
T+1Be broadcast to all rule nodes in the BFS tree; Rule node is received aggregation node v
1Set { the x of broadcasting
0, x
1..., x
t, x
T+1After, the data of adding up among 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, statistic set { y obtained
1..., y
i..., y
t, y
T+1, and with described statistic set { y
1..., y
i..., y
t, y
T+1Be sent to aggregation node v
1Wherein, y
iData among the expression data set S are positioned at interval (x
I-1, x
i] in data amount check, i ∈ [1, t+1];
D4, aggregation node v
1Statistic set { y according to all rule node transmission
1..., y
i..., y
t, y
T+1, according to the k value of setting, search relatively set { x
0, x
1..., x
t, x
T+1In the large numerical value of k, obtain numerical value x
k
D5, aggregation node v
1With numerical value x
kBe broadcast to all rule nodes in the BFS tree, each rule node collects among the S more than or equal to numerical value x self holding data
kData item, and described data item reported aggregation node v
1, obtain Top-k required in a wireless sensor network data.
Described steps d 4 comprises the steps:
D41, aggregation node v
1Statistic set { y according to all rule node transmission
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
1K, 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
1Statistic set { y according to all rule node transmission
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
2K, 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 obtains the large data x of k in the wireless sensor network
k=x
J+1
Described parametric variable t=8.
Advantage of the present invention: utilize figure G to represent wireless sensor network, set up the domination subset C of UNICOM of figure G and by rule node collection V ', utilize the breadth First algorithm to obtain with aggregation node v
1For the BFS tree of root, collect the data acquisition of being finished whole wireless sensor network by the data of rule node, aggregation node v by rule node
1According to number range to be checked and parametric variable t the data set S of rule node is added up, and utilize the result of statistics to search the numerical value x that k is large in the wireless sensor network
k, aggregation node v
1By numerical value x
kObtain Top-k data among the rule node data set S, step is easy to operate, and search efficiency is high, and wide accommodation is safe and reliable.
Embodiment
The invention will be further described below in conjunction with specific embodiment.
In the embodiment of the invention, the wireless sensor network of given UNICOM has n node, uses respectively v
1, v
2..., v
nRepresent; Wherein, suppose v
1Be the aggregation node of appointment, namely other nodes will transfer data to node v by the mode of a jumping or multi-hop
1Suppose that each sensor network nodes holds respectively a data item and (suppose node v
bThe data item A that holds
bExpression, wherein, b ∈ [1, n]).Here, A
bCan representative sensor node v
bState parameter (such as dump energy etc.) or collect sensing data (such as humiture etc.).
For simplicity, we suppose any two node v
pAnd v
qThe value of the data item of holding is not identical, namely when p is not equal to q, and A
pBe not equal to A
qIn actual applications, perhaps A can appear
pEqual A
qSituation, at this moment we can be by adopting relatively v
pWith v
qThe mode of node ID size further determines A
pAnd A
qSize.With first all data item are collected aggregation node v
1, then by aggregation node v
1The use centralized algorithm is finished the ordering 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 querying method that is applicable to wireless sensor network environment, greatly reducing under the prerequisite of the required the transmission of data bag of data, make aggregation node v
1Rank is the data item of front Top-k in the acquisition network fast.Usually k is greater than 1 constant less than n, and n is the number that wireless sensor network comprises node.In the embodiment of the invention, Top-k determines by application demand, is not strict maximum or minimum.For example, if we want to obtain the minimum k of a network node electric weight point, the Top-k so here refers to the minimum k of an electric weight point; For another example, if we want the temperature value of k the point that the temperature data that obtains to gather in the network is the highest, the Top-k so here then refers in the temperature data that the all-network node holds, and puts the temperature data of holding for the k of temperature value maximum.Discuss for convenient, do not produce ambiguity, in the embodiment of the invention, Top-k refers to k data item of the numerical value maximum of all data item in the network.
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 that comprises all wireless sensor network nodes
1, v
2..., V
n, E is the limit that comprises between all wireless sensor nodes; Described figure G is set up the corresponding domination subset C of UNICOM, and obtain by rule node collection V ', comprise some rule nodes in the described domination subset C of UNICOM;
In the embodiment of the invention, among the described step a, utilize greedy algorithm to set up for figure G and obtain the domination subset C of UNICOM.Described step a comprises the steps:
The subset C ' of a1, setting figure G is C '={ v
1, and set V ' '=V/{v
1; Be that subset C ' only comprises aggregation node v under the initial situation
1, set V ' ' expression comprises among the set V except aggregation node v
1All outer nodes;
A2, for all nodes among the set V ' ', according to the descending arrangement of degree, will the maximum some v of degree
mFrom set V ' ', remove and join among the subset C ', be i.e. C '=C ' ∪ { v
m, set V ' '=V ' '/{ v
m;
In the embodiment of the invention, degree (degree) is the noun in the graph theory, and what limits refer to a node has.The purpose of ordering is to utilize greedy algorithm so that the node number of at every turn removing at most (because the point of our degree of removing maximum, also all and this are put simultaneously link to each other have a few all remove).
A3, with node v
mAll neighbor nodes remove the V ' ' from set, and with all and node v
mAll delete from E on relevant limit, and all are because node v
mThe node that is selected among the subset C ' and causes self removing from set V ' ' forms 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 among the set V ' ' all has at least a neighbor node to be arranged in subset C ', all nodes have consisted of the domination subset of figure G among the subset C ';
A5, utilize greedy algorithm to select node from above-mentioned set V ' ', and the node of selecting joined among the subset C ', so that all nodes become the assembly of a UNICOM among the subset C ', obtain the domination subset C of UNICOM, V ' ' obtains by rule node collection V ' by set.
Greedy algorithm is the art method commonly used, particularly, chooses a node at every turn from set V ' ' and (is assumed to be v
h), v
hNot UNICOM assembly that can the middle maximum number of the subset C ' of UNICOM is with v
hJoin among the subset C ', and from set V ' ', remove; Repeat this process, until all node UNICOMs among the subset C ' obtain the domination subset C of UNICOM, V ' ' obtains by rule node collection V ' by set.
B, all rule nodes to comprising among the above-mentioned domination subset C of UNICOM utilize the BFS method, obtain with aggregation node v
1BFS tree for root;
In the mode of the present invention, utilize BFS method (BFS) to set up the BFS tree for the technological means of the art routine, repeat no more herein.
C, rule node are given out information by rule node to all, so that the data of self being held by rule node send to corresponding rule node, the data of self being held with described rule node by the data of rule node by its own domination that rule node collects have consisted of data set S;
In the embodiment of the invention, behind step c, the rule node during all data item are all set by BFS in the wireless sensor network is held; In the embodiment of the invention, through changing the wireless sensor network of having disposed behind step a and the step b, actual when collecting data, the BFS tree of setting up according to step a and step b, rule node, the process of being carried out data acquisition by rule node.
D, aggregation node v
1The data set S that all rule nodes obtain in the above-mentioned BFS tree is as foundation, and inquiry obtaining a required Top-k data.
Described steps d comprises the steps:
D1, setting numerical value L, numerical value U represent respectively minimum value and the maximum of data interval to be checked, and setup parameter variable t, utilize parametric variable t that the numerical value interval of numerical value L and numerical value U is divided, and obtain set { x
0, x
1..., x
t, x
T+1, wherein, x
0=L, x
T+1=U;
In the embodiment of the invention, described parametric variable t=8 when parametric variable t=8, can accelerate whole query search process better.For example, if the data item in the wireless sensor network is the nonnegative integer by 4 byte representations, so under the initial situation, L=0, U=65535; In the time will inquiring about the electric weight of network node in the wireless sensor network, under the initial situation, L=0, U=100, when the data item in other situations of inquiry, numerical value L has different values with numerical value U, enumerates no longer one by one 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 invention, during assignment, with ascending isometric (t+1) individual interval, the x of being divided into of all numerical value between numerical value L and numerical value U
1..., x
tIt is respectively the point of interface between the interval;
D3, aggregation node v
1With the set { x after the above-mentioned assignment
0, x
1..., x
t, x
T+1Be broadcast to all rule nodes in the BFS tree; Rule node is received aggregation node v
1Set { the x of broadcasting
0, x
1..., x
t, x
T+1After, the data of adding up among 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, statistic set { y obtained
1..., y
i..., y
t, y
T+1, and with described statistic set { y
1..., y
i..., y
t, y
T+1Be sent to aggregation node v
1Wherein, y
iData among the expression data set S are positioned at interval (x
I-1, x
i] in data amount check, i ∈ [1, t+1];
D4, aggregation node v
1Statistic set { y according to all rule node transmission
1..., y
i..., y
t, y
T+1, according to the k value of setting, search relatively set { x
0, x
1..., x
t, x
T+1In the large numerical value of k, obtain numerical value x
k
Described steps d 4 comprises the steps:
D41, aggregation node v
1Statistic set { y according to all rule node transmission
1..., y
i..., y
t, y
T+1Add up all and be positioned at (x
0, x
1] interval data amount check r
1In the embodiment of the invention, data amount check r
1The statistic that equals the transmission of all rule nodes in conjunction with in corresponding y
1Cumulative and, the account form of following data amount check and data amount check r
1Identical, repeat no more.
If d42 is r
1K, 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
1Statistic set { y according to all rule node transmission
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
2K, 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", during j ∈ [1, t], k=0 then obtains the large data x of k in the wireless sensor network
k=x
J+1
D5, aggregation node v
1With numerical value x
kBe broadcast to all rule nodes in the BFS tree, each rule node collects among the S more than or equal to numerical value x self holding data
kData item, and described data item reported aggregation node v
1, obtain Top-k required in a wireless sensor network data.
The present invention utilizes figure G to represent wireless sensor network, sets up the domination subset C of UNICOM of figure G and by rule node collection V ', utilizes the breadth First algorithm to obtain with aggregation node v
1For the BFS tree of root, collect the data acquisition of being finished whole wireless sensor network by the data of rule node, aggregation node v by rule node
1According to number range to be checked and parametric variable t the data set S of rule node is added up, and utilize the result of statistics to search the numerical value x that k is large in the wireless sensor network
k, aggregation node v
1By numerical value x
kObtain Top-k data among the rule node data set S, step is easy to operate, and search efficiency is high, and wide accommodation is safe and reliable.
Claims (6)
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 that comprises all wireless sensor network nodes
1, v
2..., V
n, E is the limit that comprises between all wireless sensor nodes; Described figure G is set up the corresponding domination subset C of UNICOM, and obtain by rule node collection V ', comprise some rule nodes in the described domination subset C of UNICOM;
(b), all rule nodes to comprising among the domination subset C of above-mentioned UNICOM, utilize the BFS method, obtain with aggregation node v
1BFS tree for root;
(c), rule node is given out information by rule node to all, so that the data of self being held by rule node send to corresponding rule node, the data of self being held with described rule node by the data of rule node by its own domination that rule node collects have consisted of data set S;
(d), aggregation node v
1The data set S that all rule nodes obtain in the above-mentioned BFS tree is as foundation, and inquiry obtaining a required Top-k data.
According to claim 1 in wireless sensor network Distributed T op-k querying method, it is characterized in that: in the described step (a), utilize greedy algorithm to set up for figure G and obtain the domination subset C of UNICOM.
According to claim 2 in wireless sensor network Distributed T op-k querying method, it is characterized in that, described step (a) comprises the steps:
(a1), the subset C ' of setting figure G is C '={ v
1, and set V ' '=V/{v
1;
(a2), for all nodes among the set V ' ', according to the descending arrangement of degree, with the some v of degree maximum
mFrom set V ' ', remove and join among the subset C ', be i.e. C '=C ' ∪ { v
m, set V ' '=V ' '/{ v
m;
(a3), with node v
mAll neighbor nodes remove the V ' ' from set, and with all and node v
mAll delete from E on relevant limit, and all are because node v
mThe node that is selected among the subset C ' and causes self removing from set V ' ' forms 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 the node among the set V ' ' all has at least a neighbor node to be arranged in subset C ', all nodes have consisted of the domination subset of figure G among the subset C ';
(a5), utilize greedy algorithm to select node from above-mentioned set V ' ', and the node of selecting joined among the subset C ', so that all nodes become the assembly of a UNICOM among the subset C ', obtain the domination subset C of UNICOM, V ' ' obtains by rule node collection V ' by set.
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), set minimum value and maximum that numerical value L, numerical value U represent respectively data interval to be checked, and setup parameter variable t utilizes parametric variable t that the numerical value interval of numerical value L and numerical value U is divided, and obtains 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
1With the set { x after the above-mentioned assignment
0, x
1..., x
t, x
T+1Be broadcast to all rule nodes in the BFS tree; Rule node is received aggregation node v
1Set { the x of broadcasting
0, x
1..., x
t, x
T+1After, the data of adding up among 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, statistic set { y obtained
1..., y
i..., y
t, y
T+1, and with described statistic set { y
1..., y
i..., y
t, y
T+1Be sent to aggregation node v
1Wherein, y
iData among the expression data set S are positioned at interval (x
I-1, x
i] in data amount check, i ∈ [1, t+1];
(d4), aggregation node v
1Statistic set { y according to all rule node transmission
1..., y
i..., y
t, y
T+1, according to the k value of setting, search relatively set { x
0, x
1..., x
t, x
T+1In the large numerical value of k, obtain numerical value x
k
(d5), aggregation node v
1With numerical value x
kBe broadcast to all rule nodes in the BFS tree, each rule node collects among the S more than or equal to numerical value x self holding data
kData item, and described data item reported aggregation node v
1, obtain Top-k required in a wireless sensor network data.
According to claim 4 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
1Statistic set { y according to all rule node transmission
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
1K, 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
1Statistic set { y according to all rule node transmission
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
2K, 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 obtains the large data x of k in the wireless sensor network
k=x
J+1
According to claim 4 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 true CN103369570A (en) | 2013-10-23 |
| CN103369570B CN103369570B (en) | 2016-04-06 |
Family
ID=49369878
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310307014.3A Expired - Fee Related 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103617197A (en) * | 2013-11-13 | 2014-03-05 | 清华大学 | Top-k inquiring method and system based on composite data in wireless sensor network |
| CN104812015A (en) * | 2015-05-14 | 2015-07-29 | 江苏大学 | Distributed Top-k query method oriented to Internet of things data |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143547A (en) * | 2011-01-24 | 2011-08-03 | 中国人民大学 | Continuous Top-k region query method in wireless sensor network |
| CN102163218A (en) * | 2011-03-28 | 2011-08-24 | 武汉大学 | Graph-index-based graph database keyword vicinity searching method |
| US20120271838A1 (en) * | 2011-04-21 | 2012-10-25 | Korea Advanced Institute Of Science And Technology | Linear-time top-k sort method |
-
2013
- 2013-07-19 CN CN201310307014.3A patent/CN103369570B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143547A (en) * | 2011-01-24 | 2011-08-03 | 中国人民大学 | Continuous Top-k region query method in wireless sensor network |
| CN102163218A (en) * | 2011-03-28 | 2011-08-24 | 武汉大学 | Graph-index-based graph database keyword vicinity searching method |
| US20120271838A1 (en) * | 2011-04-21 | 2012-10-25 | Korea Advanced Institute Of Science And Technology | Linear-time top-k sort method |
Non-Patent Citations (4)
| Title |
|---|
| ADAM SILBERSTEIN等: "A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks", 《PROC.OF INTL.CONF.ON DATA ENGINEERING》 * |
| XUFEI MAO等: "Efficient and Fast Distributed Top-k Query Protocol in Wireless Sensor Networks", 《2011 19TH IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS》 * |
| 田海生，陈立军，邱海艳，赵静: "一种动态维护分布式环境下top-k集合的近似算法", 《计算机应用》 * |
| 赵明: "无线传感网络中基于缓存的Top k查询的存储优化方法", 《信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103617197A (en) * | 2013-11-13 | 2014-03-05 | 清华大学 | Top-k inquiring method and system based on composite data in wireless sensor network |
| CN103617197B (en) * | 2013-11-13 | 2016-11-23 | 清华大学 | Based on the top-k querying method of composite data in wireless sensor network and system |
| CN104812015A (en) * | 2015-05-14 | 2015-07-29 | 江苏大学 | Distributed Top-k query method oriented to Internet of things data |
| CN104812015B (en) * | 2015-05-14 | 2018-09-11 | 江苏大学 | A kind of Distributed T op-k querying methods of internet of things oriented data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103369570B (en) | 2016-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ahn et al. | Balanced chain-based routing protocol (BCBRP) for energy efficient wireless sensor networks | |
| Kazerooni et al. | Leach and heed clustering algorithms in wireless sensor networks: a qualitative study | |
| Bansal et al. | Comparison of LEACH and PEGASIS hierarchical routing protocols in wireless sensor networks | |
| Ayoob et al. | Research of improvement on LEACH and SEP routing protocols in wireless sensor networks | |
| Salah et al. | Energy efficient clustering based on LEACH | |
| CN106255131B (en) | wireless charging-based sensor network anchor point selection method | |
| Gantassi et al. | Improvement of the LEACH protocol in load balancing and energy-association conservation | |
| CN103369570A (en) | Method for inquiring distributed Top-k data in wireless sensor network | |
| Wen et al. | Energy efficient data collection scheme in mobile wireless sensor networks | |
| Peng et al. | A new clustering algorithm based on ACO and K-medoids optimization methods | |
| CN104010342A (en) | Topology self-healing algorithm for wireless sensor networks based on node neighbor relationship | |
| Shujuan et al. | The Improvement of LEACH Algorithm in Wireless Sensor Networks. | |
| Tripathi et al. | Quantifying load imbalance: A practical implementation for data collection in low power lossy networks | |
| Huang et al. | A backbone-aware topology formation (BATF) scheme for ZigBee wireless sensor networks | |
| Kumar et al. | Performance evaluation of Distance based Angular Clustering Algorithm (DACA) using data aggregation for heterogeneous WSN | |
| Kehar et al. | Evaluating the performance of reactive I-LEACH | |
| CN107911851B (en) | Life period optimal DAG decomposition method in data-centered wireless sensor network | |
| Rahman et al. | A hybrid data aggregation scheme for Internet of Things (IoT) | |
| Kanchi | Clustering Algorithm For Wireless Sensor Networks With Balanced Cluster Size | |
| Kumar et al. | Data aggregation in wireless sensor networks | |
| Liao et al. | An efficient data storage scheme for top-k query in wireless sensor networks | |
| Gotefode et al. | Energy efficiency in wireless sensor network using fuzzy rule and tree based routing protocol | |
| Deb et al. | Harvested profile aware multi hop routing protocol for wireless sensor network | |
| Bisht et al. | Performance analysis of hierarchical and nonhierarchical routing techniques in wireless sensor networks | |
| Kakamanshadi et al. | Analysis of relay node failure in heterogeneous wireless sensor networks |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160406 |