CN101895419A - Tree structure-based data aggregation method with reliability assurance - Google Patents
Tree structure-based data aggregation method with reliability assurance Download PDFInfo
- Publication number
- CN101895419A CN101895419A CN2010102243368A CN201010224336A CN101895419A CN 101895419 A CN101895419 A CN 101895419A CN 2010102243368 A CN2010102243368 A CN 2010102243368A CN 201010224336 A CN201010224336 A CN 201010224336A CN 101895419 A CN101895419 A CN 101895419A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- tree
- message
- module
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a tree structure-based data aggregation method with reliability assurance. The aggregation method comprises the following steps: generating a tree creating module, an in-tree data aggregation module and a data detection module, and generating a tree revising module. The aggregation method adopts the tree structure to realize fast aggregation of data in the network, ensure that data can be conveniently found and used in the entire network, reduce the communications of the network in the data aggregation process and prolong the service life of the entire network; and the data detection method and the method of generating tree revise are both adopted and the phenomenons such as the damage and death of node can be monitored and found, thus increasing the accuracy and effectiveness of data transmission in the network and the reliability of the entire network.
Description
Technical field
The present invention relates to a kind of method that in wireless sensor network, has the data collection of reliability assurance, more particularly say, be meant a kind of method of data capture that reliability guarantees that has based on tree structure.
Background technology
In wireless sensor network, because the communication capacity of node is weak, the interference of finite energy and external environment condition, cause the network dynamic change fast, phenomenons such as link failure, node death happen occasionally, if to the situation of change of network state do not add that management is easy to cause network performance to reduce and network in the losing of data, even cause the network premature failure.Therefore, be necessary to improve the reliability that wireless sensor network data is collected.The process of the resource-constrained claimed condition information gathering of wireless sensor network is effective fast simultaneously, can not take Internet resources for a long time, the accuracy of also wanting guarantee information to collect.
Tree structure is to make up one to generate tree in network, and the root node of this tree is the data query node, and remaining node is this branches and leaves node that generates tree.Generate in the tree at one, except that root node, each node have and only have one before continue node, i.e. father node; And have 0 or a plurality of descendant nodes, i.e. child node; All child nodes under the same node are referred to as the brotgher of node.Data aggregation method based on tree structure is to carry out data aggregate from bottom to up along this generation tree.Be the result of polymerization from bottom to top transmission successively in tree, each node at first receives data from its child node, then the result after the polymerization is sent to its father node.Adopt such topological structure to carry out the polymerization of data, its advantage is: 1) each node only sends an information when carrying out data aggregate; 2) each node result to polymerization when inquiry carries out one parsing.
Yet when carrying out data aggregate in generating tree, node failure or bust this will cause bigger influence to the result of polymerization.This is owing to only have a paths between the owner of data and the inquiry, and what information was used when transmission is energy-conservation, insecure communication means.Therefore, node failure or bust this meeting cause the polymerization result of whole subtree to lose, and unfortunately, node failure and bust this meeting take place in the wireless sensor network of being everlasting.So, in based on the aggregation strategy that generates tree, there is polymerization result greatly not have can be communicated on the root node of tree, thereby causes when data query, can only obtaining the result of the data aggregate of part of nodes, therefore great mistake can appear.
Summary of the invention
In view of this, the object of the invention is to provide a kind of data aggregation method that reliability guarantees that has based on tree structure.This method is set up module 1, sets interior data aggregate module 2, data detection module 3 and is generated tree correcting module 4 by generating tree and realizes.Generate tree and set up the nodal information that module 1 will be inquired about by broadcasting, and the broadcast message of other nodes that receive, realize generating the foundation of tree in conjunction with the level that adjusts node; Data aggregate module 2 has realized that by data aggregation method in the tree poly of data closes and can't harm polymerization in the tree; Data detection module 3 makes the neighbours' that distance is near ballot have higher weight, thereby reaches the abnormality detection of carrying out data effectively by the ballot algorithm based on weight; Generate tree correcting module 4 and finish generation and the correction that standby father node is gathered by adopting standby father node system of selection.
Setting up the execution in step that adopts generation to set building method in the module 1 in the generation tree has:
Step 101: intiating radio sensor network, and the state of each node in the all-network is made as wait state, i.e. Flag=0;
Step 102: generate tree message GTD{Head by the tree root node broadcasts, ID, Level, FatherLevel, Data}, and number of plies level is set to 0;
Described GTD{Head, ID, Level, FatherLevel, Head represents heading among the Data}, ID represents to generate the node ID of tree message, Level represents to generate the node level of tree message, and FatherLevel represents to generate the father node number of plies of tree message, and Data represents content of message;
Step 103: neighbor node A is after receiving described GTD message, and the Node B that will send the GTD message on the one hand extracts, and carries out own state Flag on the other hand and judges, if Flag=0 then changes step 103-1; If Flag ≠ 0 a commentaries on classics step 104;
Step 103-1: neighbor node A is at random from stand-by period Time[0, t] in take out a time and wait for, according to the GTD message father node and the number of plies level of oneself is set simultaneously and oneself state is revised as undetermined, promptly Flag=1 then changes step 108; Wherein, this father node is designated as Node B for the node that sends the GTD message;
Step 104: judge the state Flag of described neighbor node A, whether equal 1, be, then change step 105; Otherwise neighbor node A is with the GTD packet loss of receiving, and commentaries on classics step 108;
Step 105: compare the level size of neighbor node A and Node B, when equaling levelB+1, then change step 106 as if levelA; When if levelA is not equal to levelB+1, neighbor node A is with the GTD packet loss of receiving, and commentaries on classics step 108; The number of plies of neighbor node A is designated as levelA, and the number of plies of Node B is designated as levelB;
Step 106: the distance D of judging neighbor node A and Node B according to the signal strength signal intensity RSS of Node B
A-B, if D
A-BIn R/2, and compare D
A-CWhen distance wants near, then former father node C is revised as Node B, and oneself state is revised as end, promptly Flag=2 changes step 108; Otherwise, change step 107; R is the perception radius of neighbor node A;
Step 107: neighbor node A sends call-tree signal GTS and calls generation tree correcting module 4, and Node B is joined standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts among the RSS}, and changes step 108; Described FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts, levelB is the number of plies at Node B place among the RSS}, A
IdBe the sequence number of node A, B
IdBe the sequence number of Node B, ListenCounts is for intercepting number of success, and NoListenCounts is for intercepting the frequency of failure, and RSS is the signal strength signal intensity of node A when interception node B;
Step 108: if the stand-by period of neighbor node A arrives, it is levelB+1 that the own number of plies then is set, and oneself state is revised as end, be Flag=2, broadcast away then with level of oneself and level and the ID in the ID replacement GTD message, and with new message, change step 109;
If step 103 is changeed in the stand-by period no show of neighbor node A;
Step 109: all nodes in the traverses network, and whether the state of judging all nodes all be " end ", i.e. the state Flag=2 of all nodes, if, then the structure tree is finished, and sends polymerization enabling signal DASS and maximum level MaxLevel to data aggregate module 2; Otherwise change step 103.
The execution in step of data aggregation method is as follows in the tree of adopting in data aggregate module 2:
Step 201: generate data aggregate DA as a result by the MaxLevel node layer, and current level is set is MaxLevel;
Step 202: neighbor node A enters the transmission stage, and its number of plies is level, and broadcasting its data polymerization result DA;
Step 203: Node B, if father's node of node A is a Node B, is then stored data polymerization result DA as a result behind the DA at the data aggregate that receives node A;
Step 204: Node B as a result behind the DA, if the father node of node A is identical with the father node of Node B, illustrates that then node A and Node B are the brotgher of node, then carry out buffer memory to data polymerization result DA at the data aggregate that receives node A;
Wherein, the brotgher of node refers to the node that father node is identical;
Step 205: all sent self data aggregate result if all numbers of plies are the node of level, then changeed step 206; Be not sent completely, then change step 202;
Step 206: enter the forwarding cycle, be that the number of plies is the data aggregate DA as a result that the node of level is transmitted its brotgher of node to self father node, enter listen phase simultaneously to father node, if in a data aggregate process, never receive any data that father node sends, send call-tree signal DAS and call the correction that correcting module 4 generates tree, wait for that correcting module 4 returns standby father node C
Id, the father node of this node is set to C then
Id
Step 207: father node is at the data aggregate of receiving all child nodes as a result behind the DA, send Data Detection enabled instruction start_2 to data detection module 3, the data that each child node is sent detect, and wait data detection module 3 return data testing result DR, if DR=1, then with the data aggregate DA deletion as a result of the node of correspondence;
Step 208: father node carries out polymerization with the data that all child nodes are sent, to generate new data aggregate DA as a result;
Step 209: all transmitted the data of its brotgher of node if all numbers of plies are the node of level, carried out level-1, then changeed step 210; Do not finish if transmit, then change step 206;
Step 210: if number of plies level=0 sets up module 1 return data polymerization result DA to generating tree, data aggregate finishes; If step 202 is then changeed in number of plies level＞0.
The execution in step of the read vector detection method that adopts in data detection module 3 has:
Step 301: any father node E is after receiving the data aggregate result that child node F sends, according to the data d that n time sends before the child node F
iCompare with this data d that receives, if
(l represents threshold value) then thought unusually, and the inquiry of voting, and changes step 302; If
DR as a result after polymerization module 2 report inquiry, i.e. DR=0, end data detects;
Step 302: father node E is to abnormal nodes F broadcasting ballot inquiry message Re questDadagram{src
Id, des
Id, hop, data}, and forwarding jumping figure hop=1 is set;
Ballot inquiry message RequestDadagram{src
Id, des
Id, hop, src among the data}
IdFor initiating the node ID of inquiry node, des
IdBe the node ID of abnormal nodes, hop is the jumping figure that message is transmitted, and data is a content of message;
Step 303: neighbor node H extracts hop count hop after receiving Re questDatagram message from message, if hop＜2, then replaces hop in the former message with hop+1, and this message is transmitted, and changes step 304;
Step 304: whether node F is in the perception radius of neighbor node H, if changeing step 305; If then do not changeing step 303;
Step 305: according to unusual read vector the node polymerization result is judged unusually, wherein
Read vector b
i(t)={ X
i(t
1), X
i(t
2) ..., X
i(t
n), X wherein
i(t
n) represent that node i is at t
nReading constantly, n represents preceding n secondary data;
Covariance relationship between two neighbor nodes
b
i(t) read vector of expression node i, b
j(t) read vector of expression node j, node i and node j be neighbor node each other;
The mould ‖ b of read vector
i(t) ‖
2=X
i 2(t
1)+X
i 2(t
2)+...+X
i 2(t
n);
If corr
I, j＞θ
T, then represent not there are differences between node i and the node j; Otherwise, exist difference between expression node i and the node j; θ
TThe expression covariance threshold generally gets 0.8.
Step 306: node H uploads voting results message Result{head, H according to the result who judges unusually
Id, F
Id, E
Id, hop, RSS ' }, and put hop=1, if the result is normal, the ballot of then uploading is for just; Otherwise for negative, according to different with the distance of abnormal nodes F, the weights of ballot are also different, and weights are designated as RSS ', i.e. the node F signal strength signal intensity that when intercepting, obtains of node H, and the near more weight of node when ballot of the Chang Jiedian F that therefore divorces is big more;
Voting results message Result{head, H
Id, F
Id, E
Id, hop, RSS ' } in head be heading, H
IdBe the node ID of ballot node, F
IdBe the node ID of abnormal nodes, E
IdBe the node ID of initiating the ballot inquiry, hop is the jumping figure that message is transmitted, and RSS ' is the value of ballot;
Step 307: after node D receives the voting results message,, then voting results are carried out buffer memory, change step 309 if node D is the node of initiating the ballot inquiry; Otherwise change step 308;
Step 308: after node D receives the voting results message, judge to transmit jumping figure hop, if hop＜2, then replace hop in the former message, and this message is transmitted with hop+1;
Step 309: node E if all ballots are negative weighted results for positive weighted results greater than all ballots, thinks that then node F data are normal, i.e. DR=0 according to inquiring whether the data of decision node F are unusual as a result; Otherwise,, then think node F data exception, i.e. DR=1 if all ballots are negative weighted results for positive weighted results smaller or equal to all ballots;
Step 310: the as a result DR of node E after the 2 report inquiries of polymerization module, flow process finishes.
The execution in step of the standby father node system of selection of adopting in generating tree correcting module 4 has:
The signal type that step 401: decision node A receives is if GTS then changes step 402, if DAS then changes step 407;
Whether step 402: decision node B is at standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts among the RSS}, if then do not change step 403, then changes step 404 if having;
At standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts, levelB is the number of plies at Node B place among the RSS}, A
IdBe the sequence number of node A, B
IdBe the sequence number of Node B, ListenCounts is for intercepting number of success, and NoListenCounts is for intercepting the frequency of failure, and RSS is the signal strength signal intensity of node A when interception node B;
Step 403: Node B is added standby father node set FS, and be provided with and intercept number of success ListenCounts=0, intercept frequency of failure NoListenCounts=0; Set up module 1 to the generation tree and return standby father node set FS;
Step 404: open polling cycle T, listening state MonitorStatus=0 is set;
Step 405: in polling cycle T,, then revise listening state MonitorStatus=1 if listen to father node information;
Step 406: when polling cycle T finishes, if MonitorStatus=1 then intercepts number of success and adds 1; If MonitorStatus=0 then intercepts the frequency of failure and adds 1;
Step 407: travel through standby father node set FS, select the node of ListenCounts/NoListenCounts maximum to add interim father node set TempFathers;
Step 408: from interim father node set TempFathers, select the node of RSS maximum as new father node C
IdAnd finish to generate tree correcting module 4 and return standby father node to data aggregate module 2.
The advantage of data aggregation method of the present invention is:
(1) effectively prolongs the useful life of whole wireless sensor network by tree structure, and improved the reliability of network.
(2) owing to adopted tree structure, thereby (hot issue is meant some node in the wireless sensor network because the traffic of undertaking is excessive to have solved hot issue, to such an extent as to the approach exhaustion that the energy of this node is too early, thereby cause the phenomenon that whole network performance descends.), improved the life span of whole network.
(3) owing to adopt tree structure to realize that the poly of data closes and can't harm polymerization, improve data transmission success, reduced transmitted data amount.
(4) in data detection module, adopted ballot algorithm based on weight, thus the reliability of balancing network and energy consumption relation effectively.
(5) in data detection module, adopt unusual read vector to carry out the abnormality detection of data, thereby improved the accuracy of Data Detection.
(6) in generating the tree correcting module, use the method that standby father node is gathered, revise generating tree, thereby guaranteed the reliability of network service and the accuracy of data aggregate.
Description of drawings
Fig. 1 is the structured flowchart that the present invention is based on the data aggregation method with reliability assurance of tree structure.
Embodiment
The present invention is a kind of data aggregation method that reliability guarantees that has based on tree structure, this data aggregation method is realized by four modules (generate tree and set up data aggregate module 2 in module 1, the tree, data detection module 3 and generation tree correcting module 4), in each module according to diverse ways handle, thereby realized data in the whole network fast, high-efficiency polymerization.In the present invention, generate tree and set up the foundation that module 1 employing generation tree building method is finished whole network tree structure; Data aggregate module 2 adopts the interior data aggregation method of tree to finish the generation of polymerization result; The detection method of data detection module 3 employing read vectors is finished the detection to node failure; Generating tree correcting module 4 adopts standby father node system of selection to finish generation and the correction that standby father node is gathered.
Generate tree and set up three tasks that module 1 is finished:
First aspect: the generation tree is set up module 1 and calls the foundation that generation tree building method is finished whole network tree structure according to enabled instruction start_1;
Second aspect: generate tree and set up module 1 and send polymerization enabling signal DASS and maximum level MaxLevel, and receive the aggregated data that returns by data aggregate module 2 DA as a result to data aggregate module 2;
The third aspect: the generation tree is set up module 1 and sends call-tree signal GTS to generating tree correcting module 4, and reception is by generating the standby father node set FS that tree correcting module 4 returns;
Setting up the execution in step that adopts generation to set building method in the module 1 in the generation tree has:
Step 101: intiating radio sensor network, and the state of each node in the all-network is made as wait state, i.e. Flag=0;
Step 102: generate tree message GTD{Head by the tree root node broadcasts, ID, Level, FatherLevel, Data}, and number of plies level is set to 0;
Step 103: neighbor node A is after receiving described GTD message, and the Node B that will send the GTD message on the one hand extracts, and carries out own state Flag on the other hand and judges, if Flag=0 then changes step 103-1; If Flag ≠ 0 a commentaries on classics step 104;
Step 103-1: neighbor node A is at random from stand-by period Time[0, t] (t represents the longest stand-by period, generally can be set to 2 seconds) in take out a time and wait for, simultaneously father node and the number of plies level of oneself is set and oneself state is revised as undetermined according to the GTD message, be Flag=1, then change step 108; Wherein, this father node is designated as Node B for the node that sends the GTD message;
Step 104: judge the state Flag of described neighbor node A, whether equal 1, be, then change step 105; Otherwise neighbor node A is with the GTD packet loss of receiving, and commentaries on classics step 108;
Step 105: compare the level size of neighbor node A and Node B, when equaling levelB+ 1, then change step 106 as if levelA; When if levelA is not equal to levelB+ 1, neighbor node A is with the GTD packet loss of receiving, and commentaries on classics step 108;
In the present invention, the number of plies of neighbor node A is designated as levelA, and the number of plies of Node B is designated as levelB;
Step 106: the distance D of judging neighbor node A and Node B according to the signal strength signal intensity RSS of Node B
A-B, if D
A-BIn R/2, and compare D
A-CWhen distance wants near, then former father node C is revised as Node B, and oneself state is revised as end, promptly Flag=2 changes step 108; Otherwise, change step 107;
In the present invention, former father node C is meant the initial father node of neighbor node A; The distance of neighbor node A and former father node C is designated as D
A-CR is the perception radius of neighbor node A;
Step 107: neighbor node A sends call-tree signal GTS and calls generation tree correcting module 4, and Node B is joined standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts among the RSS}, and changes step 108;
Step 108: if the stand-by period of neighbor node A arrives, it is levelB+1 that the own number of plies then is set, and oneself state is revised as end, be Flag=2, broadcast away then with level of oneself and level and the ID in the ID replacement GTD message, and with new message, change step 109;
If step 103 is changeed in the stand-by period no show of neighbor node A;
Step 109: all nodes in the traverses network, and whether the state of judging all nodes all be " end ", i.e. the state Flag=2 of all nodes, if, then the structure tree is finished, and sends polymerization enabling signal DASS and maximum level MaxLevel to data aggregate module 2; Otherwise change step 103.
In the present invention, described GTD{Head, ID, Level, FatherLevel, Head represents heading among the Data}, ID represents to generate the node ID of tree message, Level represents to generate the node level of tree message, and FatherLevel represents to generate the father node number of plies of tree message, and Data represents content of message.
In the present invention, described FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts, levelB is the number of plies at Node B place among the RSS}, A
IdBe the sequence number of node A, B
IdBe the sequence number of Node B, ListenCounts is for intercepting number of success, and NoListenCounts is for intercepting the frequency of failure, and RSS is the signal strength signal intensity of node A when interception node B.
Three tasks that data aggregate module 2 is finished:
First aspect: data aggregate module 2 is set up polymerization enabling signal DASS and the maximum level MaxLevel that module 1 sends according to the generation tree that receives, data aggregation method is finished the polymerization of data in the call-tree, and sets up module 1 return data polymerization result DA to generating tree;
Second aspect: data aggregate module 2 sends call-tree signal DAS to generating tree correcting module 4, and receives the standby father node C that generation tree correcting module 4 returns
Id
The third aspect: data aggregate module 2 sends Data Detection enabled instruction start_2 to data detection module 3, and receives Data Detection that data detection module 3 returns DR as a result;
The execution in step of data aggregation method is as follows in the tree of adopting in data aggregate module 2:
Step 201: generate data aggregate DA as a result by the MaxLevel node layer, and current level is set is MaxLevel;
Step 202: neighbor node A enters the transmission stage, and its number of plies is level, and broadcasting its data polymerization result DA;
Step 203: Node B, if father's node of node A is a Node B, is then stored data polymerization result DA as a result behind the DA at the data aggregate that receives node A;
Step 204: Node B as a result behind the DA, if the father node of node A is identical with the father node of Node B, illustrates that then node A and Node B are the brotgher of node, then carry out buffer memory to data polymerization result DA at the data aggregate that receives node A;
Wherein, the brotgher of node refers to the node that father node is identical;
Step 205: all sent self data aggregate result if all numbers of plies are the node of level, then changeed step 206; Be not sent completely, then change step 202;
Step 206: enter the forwarding cycle, be that the number of plies is the data aggregate DA as a result that the node of level is transmitted its brotgher of node to self father node, enter listen phase simultaneously to father node, if in a data aggregate process, never receive any data that father node sends, send call-tree signal DAS and call the correction that correcting module 4 generates tree, wait for that correcting module 4 returns standby father node C
Id, the father node of this node is set to C then
Id
Step 207: father node is at the data aggregate of receiving all child nodes as a result behind the DA, send Data Detection enabled instruction start_2 to data detection module 3, the data that each child node is sent detect, and wait data detection module 3 return data testing result DR, if DR=1 (Data Detection results abnormity), then with the data aggregate DA deletion as a result of the node of correspondence;
Step 208: father node carries out polymerization with the data that all child nodes are sent, to generate new data aggregate DA as a result;
Step 209: all transmitted the data of its brotgher of node if all numbers of plies are the node of level, carried out level-1, then changeed step 210; Do not finish if transmit, then change step 206;
Step 210: if number of plies level=0 sets up module 1 return data polymerization result DA to generating tree, data aggregate finishes; If step 202 is then changeed in number of plies level＞0.
The task that data detection module 3 is finished:
Data detection module 3 is called the detection that the read vector detection method is finished whole data according to the Data Detection enabled instruction start_2 that data aggregate module 2 sends, and to data aggregate module 2 return data testing result DR;
The execution in step of the read vector detection method that adopts in data detection module 3 has:
Step 301: any father node E is after receiving the data aggregate result that child node F sends, according to the data d that n time sends before the child node F
iCompare with this data d that receives, if
Then think unusual, and the inquiry of voting, step 302 changeed; If
DR as a result after polymerization module 2 report inquiry, i.e. DR=0, end data detects;
In the present invention, l represents threshold value, if under the condition of measuring temperature, threshold value generally is set at 5 ℃～10 ℃; If under the condition of measuring speed, threshold value generally is set at 10m/s.
Step 302: father node E is to abnormal nodes F broadcasting ballot inquiry message Re questDadagram{src
Id, des
Id, hop, data}, and forwarding jumping figure hop=1 is set;
Ballot inquiry message RequestDadagram{src
Id, des
Id, hop, src among the data}
IdFor initiating the node ID of inquiry node, des
IdBe the node ID of abnormal nodes, hop is the jumping figure that message is transmitted, and data is a content of message.
Step 303: neighbor node H extracts hop count hop after receiving Re questDatagram message from message, if hop＜2, then replaces hop in the former message with hop+1, and this message is transmitted, and changes step 304;
Step 304: whether node F is in the perception radius of neighbor node H, if changeing step 305; If then do not changeing step 303;
Step 305: according to unusual read vector the node polymerization result is judged unusually, wherein
Read vector b
i(t)={ X
i(t
1), X
i(t
2) ..., X
i(t
n), X wherein
i(t
n) represent that node i is at t
nReading constantly, n represents preceding n secondary data;
Covariance relationship between two neighbor nodes
b
i(t) read vector of expression node i, b
j(t) read vector of expression node j, node i and node j be neighbor node each other;
The mould ‖ b of read vector
i(t) ‖
2=X
i 2(t
1)+X
i 2(t
2)+...+X
i 2(t
n);
If corr
I, j＞θ
T, then represent not there are differences between node i and the node j; Otherwise, exist difference between expression node i and the node j; θ
TThe expression covariance threshold generally gets 0.8.
Step 306: node H uploads voting results message Result{head, H according to the result who judges unusually
Id, F
Id, E
Id, hop, RSS ' }, and put hop=1, if the result is normal, the ballot of then uploading is for just; Otherwise for negative, according to different with the distance of abnormal nodes F, the weights of ballot are also different, and weights are designated as RSS ', i.e. the node F signal strength signal intensity that when intercepting, obtains of node H, and the near more weight of node when ballot of the Chang Jiedian F that therefore divorces is big more;
Voting results message Result{head, H
Id, F
Id, E
Id, hop, RSS ' } in head be heading, H
IdBe the node ID of ballot node, F
IdBe the node ID of abnormal nodes, E
IdBe the node ID of initiating the ballot inquiry, hop is the jumping figure that message is transmitted, and RSS ' is the value of ballot.
Step 307: after node D receives the voting results message,, then voting results are carried out buffer memory, change step 309 if node D is the node of initiating the ballot inquiry; Otherwise change step 308;
Step 308: after node D receives the voting results message, judge to transmit jumping figure hop, if hop＜2, then replace hop in the former message, and this message is transmitted with hop+1;
Step 309: node E if all ballots are negative weighted results for positive weighted results greater than all ballots, thinks that then node F data are normal, i.e. DR=0 according to inquiring whether the data of decision node F are unusual as a result; Otherwise,, then think node F data exception, i.e. DR=1 if all ballots are negative weighted results for positive weighted results smaller or equal to all ballots.
Step 310: the as a result DR of node E after the 2 report inquiries of polymerization module, flow process finishes.
Generate two tasks that tree correcting module 4 is finished:
First aspect: generate tree correcting module 4 and set up call-tree signal GTS that module 1 sends according to the generation tree that receives and call standby father node system of selection and finish and generate the tree makeover process, and set up module 1 to the generation tree and return standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts, RSS};
Second aspect: generate call-tree signal DAS that tree correcting module 4 sends according to the data aggregate module 2 that receives and call standby father node system of selection and finish and generate the tree makeover process, and return standby father node C to data aggregate module 2
Id
The execution in step of the standby father node system of selection of adopting in generating tree correcting module 4 has:
The signal type that step 401: decision node A receives is if GTS then changes step 402, if DAS then changes step 407;
Whether step 402: decision node B is at standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts among the RSS}, if then do not change step 403, then changes step 404 if having;
At standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts, levelB is the number of plies at Node B place among the RSS}, A
IdBe the sequence number of node A, B
IdBe the sequence number of Node B, ListenCounts is for intercepting number of success, and NoListenCounts is for intercepting the frequency of failure, and RSS is the signal strength signal intensity of node A when interception node B.
Step 403: Node B is added standby father node set FS, and be provided with and intercept number of success ListenCounts=0, intercept frequency of failure NoListenCounts=0; Set up module 1 to the generation tree and return standby father node set FS;
Step 404: open polling cycle T, listening state MonitorStatus=0 is set;
Step 405: in polling cycle T,, then revise listening state MonitorStatus=1 if listen to father node information;
Step 406: when polling cycle T finishes, if MonitorStatus=1 then intercepts number of success and adds 1; If MonitorStatus=0 then intercepts the frequency of failure and adds 1;
Step 407: travel through standby father node set FS, select the node of ListenCounts/NoListenCounts maximum to add interim father node set TempFathers;
Step 408: from interim father node set TempFathers, select the node of RSS maximum as new father node C
IdAnd finish to generate tree correcting module 4 and return standby father node to data aggregate module 2.
The present invention can realize the rapid polymerization of data in the network making system can carry out searching and using of data easily in view of tree structure, and reduces the traffic of whole system in the data aggregate process, thereby prolongs the useful life of system.In addition, tree structure has certain fault-tolerant ability, promptly when part of nodes is dead, and self-regeneration rapidly, thus improve the reliability of system.
The foundation of the present invention by tree structure has prolonged system useful life, has solved hot issue, has improved the reliability of system; Method based on data aggregate in the tree has realized that the poly of data closes and can't harm polymerization simultaneously, has improved the transmission success rate simultaneously under the prerequisite that has reduced transmitted data amount; Employing has proposed unusual read vector simultaneously based on the voting method of weight, has carried out the abnormality detection of data effectively, has guaranteed the reliability of data collection; In addition, proposed to use the method for standby father node set, revised generating tree, thereby guaranteed the reliability of network service and the accuracy of data aggregate.
Claims (5)
1. data aggregation method that reliability guarantees that has based on tree structure, it is characterized in that: this data aggregation method is set up module (1) by generating tree, is set interior data aggregate module (2), data detection module (3) and generate tree correcting module (4) and realize, in each module according to diverse ways handle, thereby realized the polymerization of data in the whole network;
Generate tree and set up the foundation that module (1) employing generation tree building method is finished whole network tree structure;
Data aggregate module (2) adopts the interior data aggregation method of tree to finish the generation of polymerization result;
The detection method of data detection module (3) employing read vector is finished the detection to node failure;
Generating tree correcting module (4) adopts standby father node system of selection to finish generation and the correction that standby father node is gathered.
2. the data aggregation method that reliability guarantees that has based on tree structure according to claim 1 is characterized in that the execution in step of setting up employing generation tree building method in the module (1) in the generation tree has:
Step 101: intiating radio sensor network, and the state of each node in the all-network is made as wait state, i.e. Flag=0;
Step 102: generate tree message GTD{Head by the tree root node broadcasts, ID, Level, FatherLevel, Data}, and number of plies level is set to 0;
Described GTD{Head, ID, Level, FatherLevel, Head represents heading among the Data}, ID represents to generate the node ID of tree message, Level represents to generate the node level of tree message, and FatherLevel represents to generate the father node number of plies of tree message, and Data represents content of message;
Step 103: neighbor node A is after receiving described GTD message, and the Node B that will send the GTD message on the one hand extracts, and carries out own state Flag on the other hand and judges, if Flag=0 then changes step 103-1; If Flag ≠ 0 a commentaries on classics step 104;
Step 103-1: neighbor node A is at random from stand-by period Time[0, t] in take out a time and wait for, according to the GTD message father node and the number of plies level of oneself is set simultaneously and oneself state is revised as undetermined, promptly Flag=1 then changes step 108; Wherein, this father node is designated as Node B for the node that sends the GTD message;
Step 104: judge the state Flag of described neighbor node A, whether equal 1, be, then change step 105; Otherwise neighbor node A is with the GTD packet loss of receiving, and commentaries on classics step 108;
Step 105: compare the level size of neighbor node A and Node B, when equaling levelB+1, then change step 106 as if levelA; When if levelA is not equal to levelB+1, neighbor node A is with the GTD packet loss of receiving, and commentaries on classics step 108; The number of plies of neighbor node A is designated as levelA, and the number of plies of Node B is designated as levelB;
Step 106: the distance D of judging neighbor node A and Node B according to the signal strength signal intensity RSS of Node B
A-B, if D
A-BIn R/2, and compare D
A-CWhen distance wants near, then former father node C is revised as Node B, and oneself state is revised as end, promptly Flag=2 changes step 108; Otherwise, change step 107; R is the perception radius of neighbor node A;
Step 107: neighbor node A sends call-tree signal GTS and calls generation tree correcting module 4, and Node B is joined standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts among the RSS}, and changes step 108; Described FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts, levelB is the number of plies at Node B place among the RSS}, A
IdBe the sequence number of node A, B
IdBe the sequence number of Node B, ListenCounts is for intercepting number of success, and NoListenCounts is for intercepting the frequency of failure, and RSS is the signal strength signal intensity of node A when interception node B;
Step 108: if the stand-by period of neighbor node A arrives, it is levelB+1 that the own number of plies then is set, and oneself state is revised as end, be Flag=2, broadcast away then with level of oneself and level and the ID in the ID replacement GTD message, and with new message, change step 109;
If step 103 is changeed in the stand-by period no show of neighbor node A;
Step 109: all nodes in the traverses network, and whether the state of judging all nodes all be " end ", i.e. the state Flag=2 of all nodes, if, then the structure tree is finished, and sends polymerization enabling signal DASS and maximum level MaxLevel to data aggregate module 2; Otherwise change step 103.
3. the data aggregation method based on tree structure according to claim 1 with reliability assurance, its feature
The execution in step of data aggregation method is as follows in the tree that is to adopt in data aggregate module 2:
Step 201: generate data aggregate DA as a result by the MaxLevel node layer, and current level is set is MaxLevel;
Step 202: neighbor node A enters the transmission stage, and its number of plies is level, and broadcasting its data polymerization result DA;
Step 203: Node B, if father's node of node A is a Node B, is then stored data polymerization result DA as a result behind the DA at the data aggregate that receives node A;
Step 204: Node B as a result behind the DA, if the father node of node A is identical with the father node of Node B, illustrates that then node A and Node B are the brotgher of node, then carry out buffer memory to data polymerization result DA at the data aggregate that receives node A;
Wherein, the brotgher of node refers to the node that father node is identical;
Step 205: all sent self data aggregate result if all numbers of plies are the node of level, then changeed step 206; Be not sent completely, then change step 202;
Step 206: enter the forwarding cycle, be that the number of plies is the data aggregate DA as a result that the node of level is transmitted its brotgher of node to self father node, enter listen phase simultaneously to father node, if in a data aggregate process, never receive any data that father node sends, send call-tree signal DAS and call the correction that correcting module 4 generates tree, wait for that correcting module 4 returns standby father node C
Id, the father node of this node is set to C then
Id
Step 207: father node is at the data aggregate of receiving all child nodes as a result behind the DA, send Data Detection enabled instruction start_2 to data detection module 3, the data that each child node is sent detect, and wait data detection module 3 return data testing result DR, if DR=1, then with the data aggregate DA deletion as a result of the node of correspondence;
Step 208: father node carries out polymerization with the data that all child nodes are sent, to generate new data aggregate DA as a result;
Step 209: all transmitted the data of its brotgher of node if all numbers of plies are the node of level, carried out level-1, then changeed step 210; Do not finish if transmit, then change step 206;
Step 210: if number of plies level=0 sets up module 1 return data polymerization result DA to generating tree, data aggregate finishes; If step 202 is then changeed in number of plies level＞0.
4. the data aggregation method based on tree structure according to claim 1 with reliability assurance, its feature
The execution in step that is the read vector detection method of employing in data detection module 3 has:
Step 301: any father node E is after receiving the data aggregate result that child node F sends, according to the data d that n time sends before the child node F
iCompare with this data d that receives, if
(l represents threshold value) then thought unusually, and the inquiry of voting, and changes step 302; If
DR as a result after polymerization module 2 report inquiry, i.e. DR=0, end data detects;
Step 302: father node E is to abnormal nodes F broadcasting ballot inquiry message Re questDadagram{src
Id, des
Id, hop, data}, and forwarding jumping figure hop=1 is set;
Ballot inquiry message RequestDadagram{src
Id, des
Id, hop, src among the data}
IdFor initiating the node ID of inquiry node, des
IdBe the node ID of abnormal nodes, hop is the jumping figure that message is transmitted, and data is a content of message;
Step 303: neighbor node H extracts hop count hop after receiving Re questDatagram message from message, if hop＜2, then replaces hop in the former message with hop+1, and this message is transmitted, and changes step 304;
Step 304: whether node F is in the perception radius of neighbor node H, if changeing step 305; If then do not changeing step 303;
Step 305: according to unusual read vector the node polymerization result is judged unusually, wherein
Read vector b
i(t)={ X
i(t
1), X
i(t
2) ..., X
i(t
n), X wherein
i(t
n) represent that node i is at t
nReading constantly, n represents preceding n secondary data;
Covariance relationship between two neighbor nodes
b
i(t) read vector of expression node i, b
j(t) read vector of expression node j, node i and node j be neighbor node each other;
The mould ‖ b of read vector
i(t) ‖
2=X
i 2(t
1)+X
i 2(t
2)+...+X
i 2(t
n);
If corr
I, j＞θ
T, then represent not there are differences between node i and the node j; Otherwise, exist difference between expression node i and the node j; θ
TThe expression covariance threshold generally gets 0.8.
Step 306: node H uploads voting results message Result{head, H according to the result who judges unusually
Id, F
Id, E
Id, hop, RSS ' }, and put hop=1, if the result is normal, the ballot of then uploading is for just; Otherwise for negative, according to different with the distance of abnormal nodes F, the weights of ballot are also different, and weights are designated as RSS ', i.e. the node F signal strength signal intensity that when intercepting, obtains of node H, and the near more weight of node when ballot of the Chang Jiedian F that therefore divorces is big more;
Voting results message Result{head, H
Id, F
Id, E
Id, hop, RSS ' } in head be heading, H
IdBe the node ID of ballot node, F
IdBe the node ID of abnormal nodes, Eid is the node ID of initiating the ballot inquiry, and hop is the jumping figure that message is transmitted, and RSS ' is the value of ballot;
Step 307: after node D receives the voting results message,, then voting results are carried out buffer memory, change step 309 if node D is the node of initiating the ballot inquiry; Otherwise change step 308;
Step 308: after node D receives the voting results message, judge to transmit jumping figure hop, if hop＜2, then replace hop in the former message, and this message is transmitted with hop+1;
Step 309: node E if all ballots are negative weighted results for positive weighted results greater than all ballots, thinks that then node F data are normal, i.e. DR=0 according to inquiring whether the data of decision node F are unusual as a result; Otherwise,, then think node F data exception, i.e. DR=1 if all ballots are negative weighted results for positive weighted results smaller or equal to all ballots;
Step 310: the as a result DR of node E after the 2 report inquiries of polymerization module, flow process finishes.
5. the data aggregation method based on tree structure according to claim 1 with reliability assurance, its feature
The execution in step that is the standby father node system of selection of employing in generating tree correcting module 4 has:
The signal type that step 401: decision node A receives is if GTS then changes step 402, if DAS then changes step 407;
Whether step 402: decision node B is at standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts among the RSS}, if then do not change step 403, then changes step 404 if having;
At standby father node set FS{levelB, A
Id, B
Id, ListenCounts, NoListenCounts, levelB is the number of plies at Node B place among the RSS}, A
IdBe the sequence number of node A, B
IdBe the sequence number of Node B, ListenCounts is for intercepting number of success, and NoListenCounts is for intercepting the frequency of failure, and RSS is the signal strength signal intensity of node A when interception node B;
Step 403: Node B is added standby father node set FS, and be provided with and intercept number of success ListenCounts=0, intercept frequency of failure NoListenCounts=0; Set up module 1 to the generation tree and return standby father node set FS;
Step 404: open polling cycle T, listening state MonitorStatus=0 is set;
Step 405: in polling cycle T,, then revise listening state MonitorStatus=1 if listen to father node information;
Step 406: when polling cycle T finishes, if MonitorStatus=1 then intercepts number of success and adds 1; If MonitorStatus=0 then intercepts the frequency of failure and adds 1;
Step 407: travel through standby father node set FS, select the node of ListenCounts/NoListenCounts maximum to add interim father node set TempFathers;
Step 408: from interim father node set TempFathers, select the node of RSS maximum as new father node C
IdAnd finish to generate tree correcting module 4 and return standby father node to data aggregate module 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102243368A CN101895419A (en) | 2010-07-13 | 2010-07-13 | Tree structure-based data aggregation method with reliability assurance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102243368A CN101895419A (en) | 2010-07-13 | 2010-07-13 | Tree structure-based data aggregation method with reliability assurance |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101895419A true CN101895419A (en) | 2010-11-24 |
Family
ID=43104497
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102243368A Pending CN101895419A (en) | 2010-07-13 | 2010-07-13 | Tree structure-based data aggregation method with reliability assurance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101895419A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102163231A (en) * | 2011-04-13 | 2011-08-24 | 浪潮(北京)电子信息产业有限公司 | Method and device for data collection |
| CN102722530A (en) * | 2012-05-17 | 2012-10-10 | 北京理工大学 | Community detection method in complex network |
| CN103037468A (en) * | 2012-12-23 | 2013-04-10 | 江苏中科泛联物联网科技股份有限公司 | Construction method of directed shortest path spanning tree in wireless sensor network |
| CN103068071A (en) * | 2012-12-23 | 2013-04-24 | 江苏中科泛联物联网科技股份有限公司 | Construction method of deviation-type low-cost spanning tree in wireless sensor network |
| CN103209133A (en) * | 2013-03-27 | 2013-07-17 | 北京航空航天大学深圳研究院 | Divide and forward multicast (DFM) strategy-based long-life adjustment method for multicast trees |
| CN103369619A (en) * | 2013-06-21 | 2013-10-23 | 西安电子科技大学 | Degree-based self-adaptive dynamic aggregation tree adjusting method |
| WO2015027406A1 (en) * | 2013-08-28 | 2015-03-05 | 华为技术有限公司 | Method and apparatus for selecting preferred parent node in wireless sensor network |
| CN104661185A (en) * | 2013-11-21 | 2015-05-27 | 富士通株式会社 | Aggregation tree building method, aggregation data collecting and transmitting method and node of aggregation tree |
| CN105357775A (en) * | 2015-09-25 | 2016-02-24 | 广东石油化工学院 | Multi-attribute query method in wireless sensor networks |
| US9307507B2 (en) | 2012-11-30 | 2016-04-05 | Qualcomm Incorporated | Systems and methods of selective scanning for ad-hoc networks |
| CN111782906A (en) * | 2020-06-29 | 2020-10-16 | 杭州海康威视数字技术股份有限公司 | Data object aggregation method and device, electronic equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179410A (en) * | 2006-11-08 | 2008-05-14 | 中国科学院沈阳自动化研究所 | Wireless meshed network broadcast communication method facing to industry monitoring application |
| US20080191868A1 (en) * | 2007-02-08 | 2008-08-14 | Samsung Electronics Co., Ltd. | Apparatus for data aggregation using zone scheduling in wireless sensor network and method thereof |
-
2010
- 2010-07-13 CN CN2010102243368A patent/CN101895419A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179410A (en) * | 2006-11-08 | 2008-05-14 | 中国科学院沈阳自动化研究所 | Wireless meshed network broadcast communication method facing to industry monitoring application |
| US20080191868A1 (en) * | 2007-02-08 | 2008-08-14 | Samsung Electronics Co., Ltd. | Apparatus for data aggregation using zone scheduling in wireless sensor network and method thereof |
Non-Patent Citations (2)
| Title |
|---|
| 《电子学报》 20050825 龚海刚等 DEED:一种无线传感器网络中高效节能的数据通信协议 1391-1396 第33卷, 第08期 * |
| 《计算机应用》 20070901 李宏等 对无线传感器网络区域数据聚合有效性的研究 2218-2220 第27卷, 第09期 * |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102163231A (en) * | 2011-04-13 | 2011-08-24 | 浪潮(北京)电子信息产业有限公司 | Method and device for data collection |
| CN102722530A (en) * | 2012-05-17 | 2012-10-10 | 北京理工大学 | Community detection method in complex network |
| CN102722530B (en) * | 2012-05-17 | 2014-04-16 | 北京理工大学 | Community detection method in complex network |
| US9307507B2 (en) | 2012-11-30 | 2016-04-05 | Qualcomm Incorporated | Systems and methods of selective scanning for ad-hoc networks |
| CN103037468A (en) * | 2012-12-23 | 2013-04-10 | 江苏中科泛联物联网科技股份有限公司 | Construction method of directed shortest path spanning tree in wireless sensor network |
| CN103068071A (en) * | 2012-12-23 | 2013-04-24 | 江苏中科泛联物联网科技股份有限公司 | Construction method of deviation-type low-cost spanning tree in wireless sensor network |
| CN103209133B (en) * | 2013-03-27 | 2016-02-17 | 北京航空航天大学深圳研究院 | A kind of multicast tree long-life method of adjustment based on DFM strategy |
| CN103209133A (en) * | 2013-03-27 | 2013-07-17 | 北京航空航天大学深圳研究院 | Divide and forward multicast (DFM) strategy-based long-life adjustment method for multicast trees |
| CN103369619A (en) * | 2013-06-21 | 2013-10-23 | 西安电子科技大学 | Degree-based self-adaptive dynamic aggregation tree adjusting method |
| CN103369619B (en) * | 2013-06-21 | 2016-02-24 | 西安电子科技大学 | A kind of method based on degree self-adaptative adjustment dynamic aggregation tree |
| CN104584673A (en) * | 2013-08-28 | 2015-04-29 | 华为技术有限公司 | Method and apparatus for selecting preferred parent node in wireless sensor network |
| WO2015027406A1 (en) * | 2013-08-28 | 2015-03-05 | 华为技术有限公司 | Method and apparatus for selecting preferred parent node in wireless sensor network |
| US9876687B2 (en) | 2013-08-28 | 2018-01-23 | Huawei Technologies Co., Ltd. | Method and apparatus for selecting preferred parent node in wireless sensor network |
| CN104584673B (en) * | 2013-08-28 | 2018-10-30 | 华为技术有限公司 | The selection method and device of preferred father node in a kind of wireless sensor network |
| CN104661185A (en) * | 2013-11-21 | 2015-05-27 | 富士通株式会社 | Aggregation tree building method, aggregation data collecting and transmitting method and node of aggregation tree |
| CN104661185B (en) * | 2013-11-21 | 2019-03-01 | 富士通株式会社 | A kind of fused data transmission method and multihop network |
| CN105357775A (en) * | 2015-09-25 | 2016-02-24 | 广东石油化工学院 | Multi-attribute query method in wireless sensor networks |
| CN105357775B (en) * | 2015-09-25 | 2018-10-02 | 广东石油化工学院 | A kind of more attribute query methods in wireless sensor network |
| CN111782906A (en) * | 2020-06-29 | 2020-10-16 | 杭州海康威视数字技术股份有限公司 | Data object aggregation method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101895419A (en) | Tree structure-based data aggregation method with reliability assurance | |
| Boyinbode et al. | A survey on clustering algorithms for wireless sensor networks | |
| CN103916942A (en) | LEACH protocol improvement method capable of lowering energy consumption | |
| CN108566664B (en) | Distributed high-energy-efficiency WSN (wireless sensor network) clustering routing optimization method | |
| CN104411000A (en) | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network | |
| CN108024258B (en) | Small signal diffusion networking method for wireless network equipment | |
| Tabatabaei et al. | Reliable routing algorithm based on clustering and mobile sink in wireless sensor networks | |
| Ghosh et al. | Enhanced PEGASIS using ant colony optimization for data gathering in WSN | |
| KR101387248B1 (en) | Generating method for balanced chain topology in wireless sensor networks | |
| Ahmed et al. | Cluster head selection using decision trees for wireless sensor networks | |
| Rana et al. | Comparative study of PEGASIS and PDCH protocols in wireless sensor network | |
| Prasad et al. | energy optimization-based clustering protocols in wireless sensor networks and Internet of Things-survey | |
| CN105764110A (en) | Wireless sensor network routing optimization method based on immune clonal selection | |
| CN109874162A (en) | The hybrid Design of Routing Protocol optimization method of high-altitude high-speed mobile node ad hoc network | |
| CN106255167B (en) | Wireless sensor network based on low-power consumption lossy network routing protocol | |
| Guravaiah et al. | Data collection protocols in wireless sensor networks | |
| Huang et al. | LCD: light‐weight control model for data plane in software‐defined wireless sensor networks | |
| Patil et al. | Analysis of data aggregation techniques in wireless sensor networks | |
| Soni et al. | An investigation on energy efficient routing protocol for wireless sensor network | |
| Xu et al. | A low energy adaptive clustering multi-hop routing protocol based on fuzzy decision | |
| Devasena et al. | A study of power and energy efficient clustering protocols in wireless sensor networks | |
| Jacquet et al. | Using a token approach for the MAC layer of linear sensor networks: Impact of the node position on the packet delivery | |
| Prasad et al. | International Journal of Distributed Sensor Networks Energy Optimization-Based Clustering Protocols in Wireless Sensor Networks and Internet of Things-Survey. | |
| Bhat et al. | Effective cluster head selection based on EDM for WSN | |
| Inanlou et al. | FFDA: A tree based energy aware data aggregation protocol in 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 | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20101124 |