CN101835237A - Data aggregation method in wireless sensor network - Google Patents

Data aggregation method in wireless sensor network Download PDF

Info

Publication number
CN101835237A
CN101835237A CN201010173665A CN201010173665A CN101835237A CN 101835237 A CN101835237 A CN 101835237A CN 201010173665 A CN201010173665 A CN 201010173665A CN 201010173665 A CN201010173665 A CN 201010173665A CN 101835237 A CN101835237 A CN 101835237A
Authority
CN
China
Prior art keywords
bunch
node
execution
head
notice
Prior art date
Application number
CN201010173665A
Other languages
Chinese (zh)
Other versions
CN101835237B (en
Inventor
王汝传
宋立森
叶宁
马守明
黄小桑
孙力娟
黄海平
肖甫
沙超
凡高娟
郭剑
Original Assignee
南京邮电大学
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 南京邮电大学 filed Critical 南京邮电大学
Priority to CN2010101736654A priority Critical patent/CN101835237B/en
Publication of CN101835237A publication Critical patent/CN101835237A/en
Application granted granted Critical
Publication of CN101835237B publication Critical patent/CN101835237B/en

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention relates to a data aggregation method in a wireless sensor network, in particular to a tree-based and time-controlled data aggregation (TBTCDA) method in the wireless sensor network. Under the situation that information on a node position is undetermined, the data aggregation is performed to fulfill the aim of reducing network traffic and node energy consumption and balancing a contradiction between data aggregation accuracy and communication time delay. The method specifically comprises the following steps of: firstly, initializing a network; secondly, initiating a notice of establishing an aggregation tree by Sink; and finally, controlling aggregation time, data acquisition and aggregation, wherein the third step comprises the following steps of: 31) evaluating unit time delay Ta when all nodes participate in aggregation; and 32), setting Ta and the aggregation accuracy P according to an application demand, or receiving data acquired by Ci nodes by a cluster and transmitting aggregated data to a father cluster by a cluster head.

Description

Data fusion method in a kind of wireless sensor network
Technical field
The present invention proposes the data fusion method in a kind of wireless sensor network, belong to the wireless sensor network field.
Background technology
General fit calculation (Ubiquitous Computing or Pervasive Computing) target is to set up an environment that is full of computer and communication capacity, it is the fusion of information space and physical space, in the space of this fusion, people can obtain the digitlization service whenever and wherever possible, pellucidly.At present, the wireless sensor network of forming by the sensor node of spatial distribution, it is the main support of general fit calculation, its node all is furnished with perception and communication equipment, by mutual cooperation, can be for general fit calculation provide context aware required context data, as, position, illumination, temperature and sign information etc.But sensor node is limited at aspects such as energy, communication, calculating and storage capacities usually, especially with node deployment when the adverse circumstances, because node location is fixed, the energy is supplied with by battery and is difficult for replenishing, energy constraint becomes the bottleneck of wireless sensor network, and this problem is aggravated along with the expansion of network size again.So, the communication mechanism of an energy efficient of design, collecting sensor data effectively for top service provides the basis, have become the emphasis of paying close attention to based on the general fit calculation of wireless sensor network, and data fusion is exactly important technology wherein.
Data fusion is that many piece of data or information are handled, reject redundant, be combined into more effective, more meet the process of the data of user's request, its effect is energy, the accuracy that strengthens collected data of saving whole network and improves the efficient of collecting data.At present, the data fusion technical research of network layer is more, as based on bunch, based on chain and based on the tree the data fusion technology.Based on bunch data fusion, as LEACH.LEACH is divided into a plurality of bunches with network, and each bunch chosen a fixed cluster heads, and the member only communicates by letter with a bunch head in bunch, and bunch head carries out fusion treatment after the data of receiving this bunch member, and the result is directly issued aggregation node.LEACH uses the method for sub-clustering, make the effect of data fusion highlight, but do not provide concrete fusion method, and LEACH hypothesis bunch head and aggregation node can direct communications, limited the scale of network, in addition, need carry out periodically sub-clustering and bunch great wheel and change equilibrium, increase expense with the connected sum node energy consumption of assurance network.Fusion based on chain, as PEGASIS, it becomes single-stranded structure with all node links in the network, and head of picked at random, the head sends the data acquisition request to the two ends of chain, data transmit to the head from the two ends of strand afterwards, and intermediate node is carried out the data mixing operation, finally directly sends the result to aggregation node by the head.The distance that PEGASIS makes each node send data nearly all is the shortest, and has only a node to carry out long-distance transmissions, more saves energy than LEACH.However, still there is defective in PEGASIS.It supposes that all nodal distance aggregation nodes are all far, and the packet of receiving can both be become a grouping that size is constant with the data fusion of oneself.Reality network and use, this hypothesis is difficult for setting up, even if set up, the delay of data acquisition is wayward, and the robustness of single-stranded structure is relatively poor, and to increase defective more obvious along with network size.Integration technology based on tree is progressively Monitoring Data to be compiled from the sensor node that disperses by the form of reverse multicast tree, and each intermediate node all carries out fusion treatment to the data of receiving on the tree, and data are merged to greatest extent.Krishnamachari proposes the constructing plan of three kinds of data fusion trees, and converge in nearly source, shortest path tree and greed increase tree.These three kinds of schemes all can effectively reduce the transmission quantity of data, thereby reach energy-conservation purpose, but require node to know its distance each other, and promptly the position of node wants clear and definite.When network size was big, node locating was difficult for realizing, and merged tree and require all nodes all to join in the tree, and the maintenance of merging tree is comparatively complicated, and time delay is also wayward.
More than several fusion methods all not according to the relation of use considering between fusion accuracy and the time delay.Generally speaking, time of fusion is long more, and the data that obtain in this time period are just many more, can obtain data more accurately more, just more can effectively reduce the data traffic of network; Time of fusion is short more, and the data of acquisition are few more, and the effect of fusion is just poor more.Context data in the general fit calculation has instant change type and stable type two big classes, because upper layer application is different with required precision to the contextual freshness of this two class, can set time of fusion when merging, to reach the balance of fusion accuracy and time delay.
Summary of the invention
Technical problem: the data fusion method (TBTCDA:Tree-Based and Time-Controlled DataAggregation) when the present invention proposes in a kind of wireless sensor network based on tree and control, under the uncertain situation of node location information, carry out data fusion, reaching the purpose that reduces Internet traffic and node energy consumption, and the contradiction between balance data fusion precision and the communication delay.
Technical scheme: the technical solution adopted for the present invention to solve the technical problems is:
Step 1, netinit, N node has unique number, is deployed at random in the plane domain that area is S, distance is unknown between the node, but the hypothetical network connection, after Sink initiates to build bunch notice, node be divided into radius identical bunch in, unique label bunch is arranged;
Step 2, initiate to merge the foundation notice of tree by Sink, determine set membership between bunch head, set up submanifold chained list and father bunch chained list, first-selected father's bunch selection is by a bunch interior nodes energy summation With the energy variance Decision, Be worth greatly more, illustrate that the time that this bunch can serve is long more, paying the utmost attention to becomes father bunch; More little explanation bunch interior nodes energy is average more, and service ability is approaching more, When identical, paying the utmost attention to becomes father bunch;
Step 3, control time of fusion, data collection and fusion;
The time delay T of unit when step 31), obtaining all nodes participation fusions a, the initial T that Sink sets aBe worth less, first then with exponential manner increase T a,, estimate all nodes fast and all participate in least unit time of merging afterwards with the linear mode adjustment;
Step 32), set T according to application demand aWith fusion accuracy P, each bunch head is according to place level level iAnd T aCalculate this bunch fusion stand-by period T i, and calculate needs according to P and participate in the node of fusion and count C i
Step 33), data collection, fusion and transmission, finally arrive the Sink node, if the stand-by period to or this bunch receive C iThe data that individual node is gathered, bunch head send father bunch after with data fusion to.
Netinit in the described step 1 is specially:
Six kinds of notification types are arranged: A type notice-cluster notice; Type B notice-achievement notice; C adjusts and merges the time delay notice; D, the information inquiry notice; E, a bunch great wheel is changed notice; F, father's bunch extinction notice;
: RA responds-adheres to bunch to have two kinds to receive the response; RB response-agreement becomes submanifold;
Step 1, Sink set the unit interval T that cluster is waited for, and broadcasting A type notice;
Step 2, node N iWait for announcement information;
If step 3 is received A type notice, then execution in step 4; Otherwise, execution in step 2;
If step 4 N iAdded certain bunch of C j, undo then; Otherwise, carry out next step;
Step 5, N iAccording to self-energy E, wait for H (E) * T time;
If step 6 stand-by period arrives, N iDo not receive A type notice, then execution in step 7; Otherwise, if N iReceive N jThe adding bunch C that sends jRequest, then execution in step 8;
Step 7, N iWith every bit E Tx(d 0/ 2) energy consumption broadcasting oneself becomes a bunch Head i, request is apart from own d 0/ 2 distances add bunch C with interior neighbours i, execution in step 9 afterwards;
Step 8, N iAdhere to a bunch C j, with every bit E Tx(d 0/ 2) energy consumption sends the RA response, and with every bit E (d 0) energy transmission A type notice, execution in step 10;
Step 9, N jReceive a bunch C iAdd a bunch request, adhere to a bunch C i, and with every bit E Tx(d 0/ 2) energy consumption sends the RA response, and with every bit E (d 0) energy consumption transmission A type notice, execution in step 10;
Step 10, a bunch Head xThe node serial number k and the ENERGY E of this bunch adhereed in record k, and the statistics node is counted num x, set up bunch interior nodes chained list Inner Link (NL), this chained list is pressed the node energy ordering;
Step 11, bunch head receive that no longer the RA of neighbor node responds, then with every bit E by setting overtime realization Tx(d 0) energy consumption broadcasting A type notice;
Step 12, all nodes all add certain bunch, then carry out 13; Otherwise, execution in step 2;
Step 13, stop.
Setting up the method that merges tree in the described step 2 is specially:
Step 31, Sink node broadcasts Type B notice;
Step 32, receive N 0The Type B notice of-Sink node, a bunch Head iWith this bunch place level level iBe designated as 1, and broadcasting Type B notice, content comprises notification type, bunch numbering i, bunch level level i, bunch interior nodes gross energy And energy variance yields , i=∈ [1,100];
Step 33, a bunch Head jWait Type B notice, if receive, then execution in step 4; Otherwise, rest on this step; J=∈ [1,100];
Step 34 is if the Type B notice that submanifold sends then abandons; Otherwise carry out next step;
Step 35, Head jCalculate this bunch place level.If than the minimum level that has write down high two-layer more than, then abandon, otherwise, carry out next step;
Step 36, Head jWith chained list " Parent Link, PL " record father bunch numbering i, With this bunch place level level j=level i+ 1, and statistics father bunch number; Head jPress To the PL ordering, Identical, then press The Type B notice is broadcasted in ordering afterwards, carries out next step;
If all bunches of step 37 head is no longer received father's bunch information, execution in step 8, otherwise, execution in step 3;
Step 38, a bunch Head jFirst-selected father bunch C in chained list kSend RB and respond, content comprises father bunch numbering k, be that node is counted count on the tree of root with this bunch head jThis step is successively added up to root node from the leaf node of tree;
Step 39, bunch first-class submanifold RB that treats respond;
Step 310, Head jReceive Head xRB respond then record submanifold numbering x and count in chained list CL-Children Link x, and revise count j=num j+ count x
Step 311, all bunches head receive that no longer submanifold RB responds, then stop, otherwise, execution in step 9.
The method of control time of fusion is specially in the described step 3:
This step is divided into two stages.Phase I, obtain the unit time delay when all nodes participate in data fusion, second stage, according to the requirement of upper layer application to data precision and freshness, the maximum of setting each bunch again merges the stand-by period;
Phase I:
Step 41, rule of thumb Sink set to merge waits for unit interval T a, fusion accuracy P=1, and index increases the frequency n of Ta, and broadcasting C type notice, content comprises notification type, T aAnd P;
Step 42, a bunch Head iWait for C type notice, receive that then execution in step 43; Otherwise, rest on this step;
Step 43, Head iParse T aAnd P, according to level iAnd counti i∈ [1,100], setting this bunch maximum wait time is F 1(level i) * T aWith the node number of estimating the participation fusion be And broadcasting C type notice;
Step 44, wait submanifold and this cluster knot dot information;
If step 45 maximum wait time arrives, execution in step 47, otherwise, execution in step 46;
If step 46 Head iReceive the node data amount of estimating, execution in step 47, otherwise, execution in step 44;
Step 47, be that all nodes that participate in merging are counted countp on the tree of tree root to father's bunch report with this bunch head i
Step 48, Sink statistics are to count count from the node that merges as participation on the tree of tree root P0
Step 49, n subtract 1, if n is not less than 0, and execution in step 410, otherwise, execution in step 412;
If step 410 count 0With count P0Identical, then reduce T with linear mode a, and setting indicates that F is true, shows count 0With count P0Reached identical; Otherwise, carry out next step;
If step 411 F is masked as very, then increase T with linear mode a, execution in step 414; Otherwise, increase T with exponential manner a, execution in step 41;
If step 412 count 0With count P0Identical, then reduce T with linear mode a, execution in step 41; Otherwise, execution in step 413;
If step 413 F is masked as very, then increase T with linear mode a, execution in step 414; Otherwise, increase T with linear mode a, execution in step 41;
Step 414, enter next stage;
The initial T that Sink sets aBe worth lessly, and earlier increase T with exponential manner a,, can estimate all nodes fast and all participate in least unit time of merging afterwards with the linear mode adjustment;
Second stage:
Step 421, Sink merge stand-by period T according to application settings unit a, fusion accuracy P and information to be checked, and broadcasting D type notice;
Step 422, a bunch head are received D type notice, parse T aWith the value of P, then according to level iAnd count i, calculate this bunch maximum wait time F 1(level i) * T aWith the node number of estimating to participate in fusion And broadcasting D type notice;
Step 423, bunch first-class submanifold and this cluster knot dot information treated;
If step 424 stand-by period arrives, execution in step 426, otherwise, execution in step 425;
If step 425 a bunch head is received the node data amount of estimating, execution in step 426, otherwise, execution in step 423;
Step 426, merge received nodal information, and report to father bunch;
Step 427, Sink receive the information that inquiry is returned.
A described bunch of Head iTransfer of data between can't finishing bunch, and bunch in when effectively node chained list IL be empty, relate to rotating and father's bunch change of bunch head,
If step 51 a bunch Head iTransfer of data in finishing bunch then adds self information in IL;
Step 52, a bunch Head iIn selecting bunch in the residue node node j of energy maximum become next bunch head, and send E type notice, content comprises notification type, bunch numbering k, bunch place level level i, wait to become node serial number j, chained list IL and the PL of bunch head;
Step 53, node are received E type notice, if this bunch message then carries out 54; Otherwise, abandon;
If step 54 node serial number is j, execution in step 55; Otherwise the record leader cluster node number is j;
Step 55, node N jBecome a bunch head, deletion j node itself upgrades a bunch interior nodes tabulation IL;
Step 56, a bunch Head jCalculate dump energy before sending data, if IL is empty, and energy only enough sends F type notice, execution in step 57 one time; Otherwise, carry out 58;
Step 57, a bunch Head jSend F type notice, content comprises notification type, bunch numbering k, Head jPlace bunch C kLost efficacy execution in step 59;
Step 58, a bunch Head jTo father's bunch transmission data;
Step 59, a bunch head are received F type notice, if bunch C kBe recorded among the PL of this bunch head execution in step 510; Otherwise, abandon execution in step 514;
If step 510 C kBe as prevariety C cFirst-selected father bunch, i.e. PL node, execution in step 511; Otherwise, execution in step 513;
Step 511, C cC among the deletion PL kInformation if PL is not empty, is chosen next effective bunch, and broadcasting RB information, otherwise broadcasting F type notice is carried out next step;
If step 512 C cIn bunch effectively node receive oneself bunch F type notice, then node stop work;
Step 513, C cC among the deletion PL kInformation;
If step 514 C kBe recorded in this bunch C cCL in, execution in step 515; Otherwise, abandon;
Step 515, C cC among the deletion CL kInformation, and revise count c=count c-count k(c, k ∈ [0,100]) illustrates: bunch interior nodes piggybacks dump energy when bunch head transmits image data, and bunch head upgrades the IL chained list in view of the above, comprises that deletion do not receive the node of its data, and upgrades chained list node E iData.
Beneficial effect: the inventive method has proposed the data fusion method in a kind of wireless sensor network, is intended to fully utilize the advantage of existing blending algorithm, solves its deficiency.Estimate the performance index of a blending algorithm, except that this basic index of energy efficiency, also have time delay and adaptability, the benefit of the inventive method is described from these several respects below:
1, energy-saving effect is better: whole wireless sensor network be divided into that interstitial content do not wait bunch, data bunch in and flow between bunch head, be fused to the data that last several the branches of tree transmit, in data acquisition and transmission course, adopt certain fusion method, reduce data volume, effectively save most of energy.
2, reduce the control expense: dynamic clustering mechanism has the bigger deficiency of control expense, adopts static sub-clustering and sets specific bunch radius, can reduce the control expense, prolongs network lifecycle.
3, has good adaptability: can dynamically set time of fusion to the demand of data freshness and precision according to top service.For the demanding application of freshness, can reduce time of fusion, oppose the application that required precision is high mutually, can suitably increase time of fusion.
4, the algorithm robustness is better: tree set up is merged in a bunch set, reduce tree and go up node, be beneficial to maintenance, and submanifold preserves a plurality of fathers bunch information, can in time change father's bunch information when the father bunch was lost efficacy, guarantee network-in-dialing as far as possible.
Description of drawings
Fig. 1 network node initial distribution situation,
Fig. 2 cluster situation,
Fig. 3 transfer of data situation,
Fig. 4 cluster flow chart,
Fig. 5 flow chart of contributing,
Fig. 6 controls and merges the time delay flow chart,
Fig. 7 energy consumption model.
Embodiment
Fig. 1 has provided the distribution example of a start node, and 100 numbering N are arranged iThe node of (i ∈ (1,100)) is randomly dispersed in the plane domain of 400m * 400m, and the Sink node is designated as N 0, be positioned at 80 meters.Fig. 2 is the situation after the sub-clustering, and how sub-clustering is introduced with a selection bunch back.After Fig. 3 provided sub-clustering, how data were transferred to the Sink node in the tree.
The first step, netinit.
In this stage, according to radii fixus with network be divided into that interstitial content do not wait bunch, each bunch has unique number C i(i ∈ (1,100)), numbering is identical with first bunch of head numbering, communicates by letter between a bunch numbering is used for bunch.The energy consumption model that the inventive method adopts as shown in Figure 7.Electronic component consumes energy the transmitting terminal energy consumption and emission amplifier power consumption two parts are formed by sending in the energy consumption model, and the receiving terminal energy consumption receives electronic component and produces.The decay of signal energy and transmitting terminal and receiving terminal is relevant apart from d in wireless radio transmission.As d≤d 0The time, the consumption of energy and d 2Be directly proportional, on the contrary d 〉=d 0The time, with d 4Be directly proportional.Two kinds of above-mentioned energy attenuation models are called free space model (Free Space) and multipath fading model (Multi-path Fading), d 0Represent the separation of the two.
According to energy consumption model, along with the information of the variation of distance transmission 1bit, the energy consumption of sending node can be expressed as:
E Tx ( d ) = E Tx - elec + E Tx - amp ( d )
+ E elec + &epsiv; fs d 2 , d < d 0 E elec + &epsiv; mp d 4 , d &GreaterEqual; d 0 Formula (1)
E wherein ElecBe the energy consumption coefficient of node circuit, ε FsAnd ε MpRepresent near, remote power attenuation coefficient respectively, Be without loss of generality ε Fs=10pJbit -1M -2, ε Mp=0.0013pJbit -1M -2Hypothetical network of the present invention is communicated with, and is meant that every bit communications energy consumption of adjacent node is no more than E Tx(d 0).For assurance bunch interior nodes is communicated with, and reduce the energy consumption of communicating by letter between bunch head, the present invention's bunch radius is set to d 0/ 2, promptly bunch head is with every bit E Tx(d 0/ 2) energy consumption broadcast announcement.
Concrete initialization procedure is as follows:
Six kinds of notification type: A are arranged, the cluster notice; B, the notice of contributing; C adjusts and merges the time delay notice; D, the information inquiry notice; E, a bunch great wheel is changed notice; F, father's bunch extinction notice.
Have two kinds to receive the response: RA, adhere to bunch; RB agrees to become submanifold;
Step 1, Sink set the unit interval T that cluster is waited for, and broadcasting A type notice;
Step 2, node N iWait for announcement information.
If step 3 is received A type notice, then execution in step 4; Otherwise, execution in step 2;
If step 4 N iAdded certain bunch of C j, undo then; Otherwise, carry out next step;
Step 5, N iAccording to self-energy E, wait for H (E) * T time;
If step 6 stand-by period arrives, N iDo not receive A type notice, then execution in step 7; Otherwise, if N iReceive N jThe adding bunch C that sends jRequest, then execution in step 8;
Step 7, N iWith every bit E Tx(d 0/ 2) energy consumption broadcasting oneself becomes a bunch head (Head i), request is apart from own d 0/ 2 distances add bunch C with interior neighbours i, execution in step 9 afterwards;
Step 8, N iAdhere to a bunch C j, with every bit E Tx(d 0/ 2) energy consumption sends the RA response, and with every bit E (d 0) energy transmission A type notice, execution in step 10;
Step 9, N jReceive a bunch C iAdd a bunch request, adhere to a bunch C i, and with every bit E Tx(d 0/ 2) energy consumption sends the RA response, and with every bit E (d 0) energy consumption transmission A type notice, execution in step 10;
Step 10, a bunch Head xThe node serial number k and the ENERGY E of this bunch adhereed in record k, and the statistics node is counted num x, set up bunch interior nodes chained list Inner Link (NL), this chained list is pressed the node energy ordering;
Step 11, bunch head receive that no longer the RA of neighbor node responds (by setting overtime realization), then with every bit E Tx(d 0) energy consumption broadcasting A type notice;
Step 12, all nodes all add certain bunch, then carry out 13; Otherwise, execution in step 2;
Step 13, stop.
H in the above-mentioned steps 5 (E) is according to node energy E, calculates node and waits for that neighbor node adds the unit interval number of bunch request.Node energy is big more, waits for that the unit interval number is more little, strengthens the probability that oneself becomes bunch head, and avoids conflict as far as possible.If node N iAnd N jEnergy is identical and receive the cluster notice simultaneously, sends out into after the conflict, recomputates the stand-by period according to node number.As when the network design, the primary power of node is identical, then directly sets the stand-by period according to node number.
The purpose of step 11 is the existence that as far as possible prevent isolated node, promptly prevents N among similar Fig. 2 (b) kSituation occur.
Tree is merged in second step, foundation
By top sub-clustering algorithm, the ultimate range that obtains between adjacent two bunches is 3d 0Uncertain because of each node location and mutual distance, merge tree for guaranteeing that all bunches head all adds, the present invention is set at E with the every bit communications energy consumption between bunch head Tx(3d 0).
Step 1, Sink node broadcasts Type B notice;
Step 2, receive N 0(Sink) Type B of node notice, a bunch Head iWith this bunch place level level i(i ∈ [1,100]) is designated as 1, and broadcasting Type B notice, and content comprises notification type, bunch numbering i, bunch level level i, bunch interior nodes gross energy And energy variance yields
Step 3, a bunch Head j(j ∈ [1,100]) waits for the Type B notice.If receive, then execution in step 4; Otherwise, rest on this step;
Step 4 is if the Type B notice that submanifold sends then abandons; Otherwise carry out next step;
Step 5, Head jCalculate this bunch place level.If than the minimum level that has write down high two-layer more than, then abandon, otherwise, carry out next step;
Step 6, Head jWith chained list (Parent Link, PL) record father bunch numbering i, With this bunch place level level j=level i+ 1, and statistics father bunch number.Head jPress To the PL ordering, Identical, then press The Type B notice is broadcasted in ordering afterwards, carries out next step;
If all bunches of step 7 head is no longer received father's bunch information, execution in step 8, otherwise, execution in step 3;
Step 8, a bunch Head jFirst-selected father bunch C in chained list kSend RB message, content comprises father bunch numbering k, be that node is counted count on the tree of root with this bunch head j(j ∈ [1,100]) (this step is successively added up to root node from the leaf node of tree);
Step 9, bunch first-class submanifold RB message for the treatment of;
Step 10, Head jReceive Head xRB message, then record submanifold numbering x and count in chained list CL (Children Link) x(x ∈ [1,100]), and revise count j=num j+ count x(j ∈ [0,100], x ∈ [1,100]);
Step 11, all bunches head are no longer received submanifold RB message, then stop, otherwise, execution in step 9.
First-selected father's bunch selection is obtained by step 2 With Decision. Be worth greatly more, illustrate bunch that the energy of gathering and merging is many more, paying the utmost attention to becomes father bunch. More little explanation bunch interior nodes energy is average more, and service ability is approaching, When identical, paying the utmost attention to becomes father bunch.Be less control expense, father bunch chained list PL and submanifold chained list IL only do the deletion of chained list node after determining, do not do the renewal in node data territory.
Stand-by period, data collection and fusion are merged in the 3rd step, control.
This step is divided into two stages.Phase I, obtain the unit time delay when all nodes participate in data fusion.Second stage, according to the requirement of upper layer application to data precision and freshness, the maximum of setting each bunch again merges the stand-by period.
Phase I:
Step 1, Sink set to merge and wait for unit interval T a(rule of thumb setting), fusion accuracy P (P is set at 1 herein) and index increase T aFrequency n (the n value is less), and broadcasting C type notice, content comprises notification type, T aAnd P;
Step 2, a bunch Head iWait for C type notice.Receive that then execution in step 3; Otherwise, rest on this step;
Step 3, Head iParse T aAnd P, according to level iAnd count i(i ∈ [1,100]), setting this bunch maximum wait time is F 1(level i) * T aWith the node number of estimating the participation fusion be And broadcasting C type notice;
Step 4, wait submanifold and this cluster knot dot information;
If step 5 maximum wait time arrives, execution in step 7, otherwise, execution in step 6;
If step 6 Head iReceive the node data amount of estimating, execution in step 7, otherwise, execution in step 4;
Step 7, be that all nodes that participate in merging are counted count on the tree of tree root to father's bunch report with this bunch head Pi
Step 8, Sink statistics are to count count from the node that merges as participation on the tree of tree root P0
Step 9, n subtract 1.If n is not less than 0, execution in step 10, otherwise, execution in step 12;
If step 10 count 0With count P0Identical, then reduce T with linear mode a, and setting indicates that F is true, shows count 0With count P0Reached identical; Otherwise, carry out next step;
If step 11 F is masked as very, then increase T with linear mode a, execution in step 14; Otherwise, increase T with exponential manner a, execution in step 1;
If step 12 count 0With count P0Identical, then reduce T with linear mode a, execution in step 1; Otherwise, execution in step 13;
If step 13 F is masked as very, then increase T with linear mode a, execution in step 14; Otherwise, increase T with linear mode a, execution in step 1;
Step 14, enter next stage.
The initial T that Sink sets aBe worth lessly, and earlier increase T with exponential manner a,, can estimate all nodes fast and all participate in least unit time of merging afterwards with the linear mode adjustment.
Second stage:
Step 1, Sink merge stand-by period T according to application settings unit a, fusion accuracy P and information to be checked, and broadcasting D type notice;
Step 2, a bunch head are received D type notice, parse T aWith the value of P, then according to level iAnd count i(i ∈ [1,100]) calculates this bunch maximum wait time F 1(level i) * T aWith the node number of estimating to participate in fusion And broadcasting D type notice;
Step 3, bunch first-class submanifold and this cluster knot dot information treated;
If step 4 stand-by period arrives, execution in step 6, otherwise, execution in step 5;
If step 5 a bunch head is received the node data amount of estimating, execution in step 6, otherwise, execution in step 3;
Step 6, merge received nodal information, and report to father bunch;
Step 7, Sink receive the information that inquiry is returned;
F in the above-mentioned steps 1Be to calculate bunch head according to a bunch place level to merge the unit interval number of waiting for, this functional value is along with level increases and exponential decrease.
A bunch Head iTransfer of data between can't finishing bunch, and bunch in when effectively node chained list IL be empty, relate to rotating and father's bunch change of bunch head.
If step 1 a bunch Head iTransfer of data in finishing bunch then adds self information in IL;
Step 2, a bunch Head iIn selecting bunch in the residue node node j of energy maximum become next bunch head, and send E type notice, content comprises notification type, bunch numbering k, bunch place level level i, wait to become node serial number j, chained list IL and the PL of bunch head;
Step 3, node are received E type notice, if this bunch message then carries out 4; Otherwise, abandon;
If step 4 node serial number is j, execution in step 5; Otherwise the record leader cluster node number is j;
Step 5, node N jBecome a bunch head, deletion j node itself upgrades a bunch interior nodes tabulation IL;
Step 6, a bunch Head jCalculate dump energy before sending data, if IL is empty, and energy only enough sends F type notice, execution in step 7 one time; Otherwise, carry out 8;
Step 7, a bunch Head jSend F type notice, content comprises notification type, bunch numbering k (Head jPlace bunch C kLost efficacy), execution in step 9;
Step 8, a bunch Head jTo father's bunch transmission data;
Step 9, a bunch head are received F type notice.If bunch C kBe recorded among the PL of this bunch head execution in step 10; Otherwise, abandon execution in step 14;
If step 10 C kBe as prevariety C cFirst-selected father bunch (being PL node), execution in step 11; Otherwise, execution in step 13;
Step 11, C cC among the deletion PL kInformation.If PL is not empty, choose next effective bunch, and broadcasting RB information, otherwise broadcasting F type notice is carried out next step;
If step 12 C cIn bunch effectively node receive oneself bunch F type notice, then node stop work;
Step 13, C cC among the deletion PL kInformation;
If step 14 C kBe recorded in this bunch C cCL in, execution in step 15; Otherwise, abandon;
Step 15, C cC among the deletion CL kInformation, and revise count c=count c-count k(c, k ∈ [0,100]) illustrates: bunch interior nodes piggybacks dump energy when bunch head transmits image data.Bunch head upgrades in view of the above
The IL chained list (comprises that deletion do not receive the node of its data, and upgrades chained list node E iData).

Claims (5)

1. the data fusion method in the wireless sensor network is characterized in that this method specifically comprises:
Step 1, netinit, N node has unique number, is deployed at random in the plane domain that area is S, distance is unknown between the node, but the hypothetical network connection, after Sink initiates to build bunch notice, node be divided into radius identical bunch in, unique label bunch is arranged;
Step 2, initiate to merge the foundation notice of tree by Sink, determine set membership between bunch head, set up submanifold chained list and father bunch chained list, first-selected father's bunch selection is by a bunch interior nodes energy summation With the energy variance Decision, Be worth greatly more, illustrate that the time that this bunch can serve is long more, paying the utmost attention to becomes father bunch; More little explanation bunch interior nodes energy is average more, and service ability is approaching more, When identical, paying the utmost attention to becomes father bunch;
Step 3, control time of fusion, data collection and fusion;
The time delay T of unit when step 31), obtaining all nodes participation fusions a, the initial T that Sink sets aBe worth less, first then with exponential manner increase T a,, estimate all nodes fast and all participate in least unit time of merging afterwards with the linear mode adjustment;
Step 32), set T according to application demand aWith fusion accuracy P, each bunch head is according to place level level iAnd T aCalculate this bunch fusion stand-by period T i, and calculate needs according to P and participate in the node of fusion and count C i
Step 33), data collection, fusion and transmission, finally arrive the Sink node, if the stand-by period to or this bunch receive C iThe data that individual node is gathered, bunch head send father bunch after with data fusion to.
2. the data fusion method in the wireless sensor network according to claim 1 is characterized in that the netinit in the described step 1 is specially:
Six kinds of notification types are arranged: A type notice-cluster notice; Type B notice-achievement notice; C adjusts and merges the time delay notice; D, the information inquiry notice; E, a bunch great wheel is changed notice; F, father's bunch extinction notice;
: RA responds-adheres to bunch to have two kinds to receive the response; RB response-agreement becomes submanifold;
Step 1, Sink set the unit interval T that cluster is waited for, and broadcasting A type notice;
Step 2, node N iWait for announcement information;
If step 3 is received A type notice, then execution in step 4; Otherwise, execution in step 2;
If step 4 N iAdded certain bunch of C j, undo then; Otherwise, carry out next step;
Step 5, N iAccording to self-energy E, wait for H (E) * T time;
If step 6 stand-by period arrives, N iDo not receive A type notice, then execution in step 7; Otherwise, if N iReceive N jThe adding bunch C that sends jRequest, then execution in step 8;
Step 7, N iWith every bit E Tx(d 0/ 2) energy consumption broadcasting oneself becomes a bunch Head i, request is apart from own d 0/ 2 distances add bunch C with interior neighbours i, execution in step 9 afterwards;
Step 8, N iAdhere to a bunch C j, with every bit E Tx(d 0/ 2) energy consumption sends the RA response, and with every bit E (d 0) energy transmission A type notice, execution in step 10;
Step 9, N jReceive a bunch C iAdd a bunch request, adhere to a bunch C i, and with every bit E Tx(d 0/ 2) energy consumption sends the RA response, and with every bit E (d 0) energy consumption transmission A type notice, execution in step 10;
Step 10, a bunch Head xThe node serial number k and the ENERGY E of this bunch adhereed in record k, and the statistics node is counted num x, set up bunch interior nodes chained list Inner Link (NL), this chained list is pressed the node energy ordering;
Step 11, bunch head receive that no longer the RA of neighbor node responds, then with every bit E by setting overtime realization Tx(d 0) energy consumption broadcasting A type notice;
Step 12, all nodes all add certain bunch, then carry out 13; Otherwise, execution in step 2;
Step 13, stop.
3. the data fusion method in the wireless sensor network according to claim 1 is characterized in that setting up in the described step 2 method that merges tree and is specially:
Step 31, Sink node broadcasts Type B notice;
Step 32, receive N 0The Type B notice of-Sink node, a bunch Head iWith this bunch place level level iBe designated as 1, and broadcasting Type B notice, content comprises notification type, bunch numbering i, bunch level level i, bunch interior nodes gross energy And energy variance yields I=∈ [1,100];
Step 33, a bunch Head jWait Type B notice, if receive, then execution in step 4; Otherwise, rest on this step; J=∈ [1,100];
Step 34 is if the Type B notice that submanifold sends then abandons; Otherwise carry out next step;
Step 35, Head jCalculate this bunch place level.If than the minimum level that has write down high two-layer more than, then abandon, otherwise, carry out next step;
Step 36, Head jWith chained list " Parent Link, PL " record father bunch numbering i, With this bunch place level level j=level i+ 1, and statistics father bunch number; Head jPress To the PL ordering, Identical, then press The Type B notice is broadcasted in ordering afterwards, carries out next step;
If all bunches of step 37 head is no longer received father's bunch information, execution in step 8, otherwise, execution in step 3;
Step 38, a bunch Head jFirst-selected father bunch C in chained list kSend RB and respond, content comprises father bunch numbering k, be that node is counted count on the tree of root with this bunch head jThis step is successively added up to root node from the leaf node of tree;
Step 39, bunch first-class submanifold RB that treats respond;
Step 310, Head jReceive Head xRB respond then record submanifold numbering x and count in chained list CL-Children Link x, and revise count j=num j+ count x
Step 311, all bunches head receive that no longer submanifold RB responds, then stop, otherwise, execution in step 9.
4. the data fusion method in the wireless sensor network according to claim 1 is characterized in that the method for control time of fusion in the described step 3 is specially:
This step is divided into two stages.Phase I, obtain the unit time delay when all nodes participate in data fusion, second stage, according to the requirement of upper layer application to data precision and freshness, the maximum of setting each bunch again merges the stand-by period;
Phase I:
Step 41, rule of thumb Sink set to merge waits for unit interval T a, fusion accuracy P=1, and index increases T aFrequency n, and broadcasting C type notice, content comprises notification type, T aAnd P;
Step 42, a bunch Head iWait for C type notice, receive that then execution in step 43; Otherwise, rest on this step;
Step 43, Head iParse T aAnd P, according to level iAnd count iI ∈ [1,100], setting this bunch maximum wait time is F 1(level i) * T aWith the node number of estimating the participation fusion be , and broadcasting C type notice;
Step 44, wait submanifold and this cluster knot dot information;
If step 45 maximum wait time arrives, execution in step 47, otherwise, execution in step 46;
If step 46 Head iReceive the node data amount of estimating, execution in step 47, otherwise, execution in step 44;
Step 47, be that all nodes that participate in merging are counted count on the tree of tree root to father's bunch report with this bunch head Pi
Step 48, Sink statistics are to count count from the node that merges as participation on the tree of tree root P0
Step 49, n subtract 1, if n is not less than 0, and execution in step 410, otherwise, execution in step 412;
If step 410 count 0With count P0Identical, then reduce T with linear mode a, and setting indicates that F is true, shows count 0With count P0Reached identical; Otherwise, carry out next step;
If step 411 F is masked as very, then increase T with linear mode a, execution in step 414; Otherwise, increase T with exponential manner a, execution in step 41;
If step 412 count 0With count P0Identical, then reduce T with linear mode a, execution in step 41; Otherwise, execution in step 413;
If step 413 F is masked as very, then increase T with linear mode a, execution in step 414; Otherwise, increase T with linear mode a, execution in step 41;
Step 414, enter next stage;
The initial T that Sink sets aBe worth lessly, and earlier increase T with exponential manner a,, can estimate all nodes fast and all participate in least unit time of merging afterwards with the linear mode adjustment;
Second stage:
Step 421, Sink merge stand-by period T according to application settings unit a, fusion accuracy P and information to be checked, and broadcasting D type notice;
Step 422, a bunch head are received D type notice, parse T aWith the value of P, then according to level iAnd count i, calculate this bunch maximum wait time F 1(level i) * T aWith the node number of estimating to participate in fusion , and broadcasting D type notice;
Step 423, bunch first-class submanifold and this cluster knot dot information treated;
If step 424 stand-by period arrives, execution in step 426, otherwise, execution in step 425;
If step 425 a bunch head is received the node data amount of estimating, execution in step 426, otherwise, execution in step 423;
Step 426, merge received nodal information, and report to father bunch;
Step 427, Sink receive the information that inquiry is returned.
5. the data fusion method in the wireless sensor network according to claim 1 is characterized in that a described bunch of Head iTransfer of data between can't finishing bunch, and bunch in when effectively node chained list IL be empty, relate to rotating and father's bunch change of bunch head,
If step 51 a bunch Head iTransfer of data in finishing bunch then adds self information in IL;
Step 52, a bunch Head iIn selecting bunch in the residue node node j of energy maximum become next bunch head, and send E type notice, content comprises notification type, bunch numbering k, bunch place level level i, wait to become node serial number j, chained list IL and the PL of bunch head;
Step 53, node are received E type notice, if this bunch message then carries out 54; Otherwise, abandon;
If step 54 node serial number is j, execution in step 55; Otherwise the record leader cluster node number is j;
Step 55, node N jBecome a bunch head, deletion j node itself upgrades a bunch interior nodes tabulation IL;
Step 56, a bunch Head jCalculate dump energy before sending data, if IL is empty, and energy only enough sends F type notice, execution in step 57 one time; Otherwise, carry out 58;
Step 57, a bunch Head jSend F type notice, content comprises notification type, bunch numbering k, Head jPlace bunch C kLost efficacy execution in step 59;
Step 58, a bunch Head jTo father's bunch transmission data;
Step 59, a bunch head are received F type notice, if bunch C kBe recorded among the PL of this bunch head execution in step 510; Otherwise, abandon execution in step 514;
If step 510 C kBe as prevariety C cFirst-selected father bunch, i.e. PL node, execution in step 511; Otherwise, execution in step 513;
Step 511, C cC among the deletion PL kInformation if PL is not empty, is chosen next effective bunch, and broadcasting RB information, otherwise broadcasting F type notice is carried out next step;
If step 512 C cIn bunch effectively node receive oneself bunch F type notice, then node stop work;
Step 513, C cC among the deletion PL kInformation;
If step 514 C kBe recorded in this bunch C cCL in, execution in step 515; Otherwise, abandon;
Step 515, C cC among the deletion CL kInformation, and revise count c=count c-count k(c, k ∈ [0,100])
Illustrate: bunch interior nodes piggybacks dump energy when bunch head transmits image data, and bunch head upgrades the IL chained list in view of the above, comprises that deletion do not receive the node of its data, and upgrades chained list node E iData.
CN2010101736654A 2010-05-14 2010-05-14 Data aggregation method in wireless sensor network CN101835237B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010101736654A CN101835237B (en) 2010-05-14 2010-05-14 Data aggregation method in wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010101736654A CN101835237B (en) 2010-05-14 2010-05-14 Data aggregation method in wireless sensor network

Publications (2)

Publication Number Publication Date
CN101835237A true CN101835237A (en) 2010-09-15
CN101835237B CN101835237B (en) 2013-06-05

Family

ID=42719118

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010101736654A CN101835237B (en) 2010-05-14 2010-05-14 Data aggregation method in wireless sensor network

Country Status (1)

Country Link
CN (1) CN101835237B (en)

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102076048A (en) * 2010-12-16 2011-05-25 浙江工业大学 Wireless sensor network routing control method based on node position dynamic changes
CN102118819A (en) * 2010-12-28 2011-07-06 清华大学 Data aggregation method with attribute correlation
CN102427597A (en) * 2011-12-05 2012-04-25 昆明理工大学 Fusion method for WSN (Wireless Sensor Network) tree type clustering data based on CR (Cognitive Radio)
CN102594906A (en) * 2012-03-02 2012-07-18 安徽工程大学 Data fusion method and device
CN102612080A (en) * 2012-03-09 2012-07-25 武汉理工大学 Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding
CN102892189A (en) * 2012-09-28 2013-01-23 北京航空航天大学深圳研究院 Energy consumption balance-based method for constructing data fusion tree of wireless sensor network
CN103037467A (en) * 2011-09-30 2013-04-10 无锡物联网产业研究院 Method and device for fusing data of wireless sensor network
CN103052130A (en) * 2012-11-20 2013-04-17 南京邮电大学 Rough-set-based data fusion method for wireless multimedia sensor network
CN103298104A (en) * 2012-03-04 2013-09-11 山东大学威海分校 Wireless sensor network node three-dimensional positioner of leader intelligent choice mechanism
CN104661185A (en) * 2013-11-21 2015-05-27 富士通株式会社 Aggregation tree building method, aggregation data collecting and transmitting method and node of aggregation tree
CN104796852A (en) * 2015-04-27 2015-07-22 宇龙计算机通信科技(深圳)有限公司 Device discovery method and device for device-to-device communication and terminal
CN105357775A (en) * 2015-09-25 2016-02-24 广东石油化工学院 Multi-attribute query method in wireless sensor networks
CN105610528A (en) * 2015-12-17 2016-05-25 北京交通大学 Clustering and tracking method for multipath component of time-varying channel
CN105898681A (en) * 2016-04-05 2016-08-24 浙江警察学院 Wireless sensor network data fusion method of fusing time delay and survival time evenly
CN106060150A (en) * 2016-06-24 2016-10-26 成都之达科技有限公司 Vehicle information wireless collection method based on Internet of Vehicles
CN107105466A (en) * 2017-03-14 2017-08-29 南京邮电大学 A kind of mobile Sink methods of data capture based on enhancing learning algorithm
CN107295453A (en) * 2016-03-31 2017-10-24 扬州大学 A kind of wireless sensor network data fusion method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7120456B1 (en) * 2001-11-07 2006-10-10 Bbn Technologies Corp. Wireless terminals with multiple transceivers
CN101471952A (en) * 2007-12-28 2009-07-01 中国科学院软件研究所 Fusion method for layered structure data of wireless sensor network
CN101471865A (en) * 2007-12-28 2009-07-01 中国科学院软件研究所 Method for high-efficiency data fusion in wireless sensor network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7120456B1 (en) * 2001-11-07 2006-10-10 Bbn Technologies Corp. Wireless terminals with multiple transceivers
CN101471952A (en) * 2007-12-28 2009-07-01 中国科学院软件研究所 Fusion method for layered structure data of wireless sensor network
CN101471865A (en) * 2007-12-28 2009-07-01 中国科学院软件研究所 Method for high-efficiency data fusion in wireless sensor network

Cited By (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102076048A (en) * 2010-12-16 2011-05-25 浙江工业大学 Wireless sensor network routing control method based on node position dynamic changes
CN102118819A (en) * 2010-12-28 2011-07-06 清华大学 Data aggregation method with attribute correlation
CN103037467B (en) * 2011-09-30 2015-04-01 无锡物联网产业研究院 Method and device for fusing data of wireless sensor network
CN103037467A (en) * 2011-09-30 2013-04-10 无锡物联网产业研究院 Method and device for fusing data of wireless sensor network
CN102427597A (en) * 2011-12-05 2012-04-25 昆明理工大学 Fusion method for WSN (Wireless Sensor Network) tree type clustering data based on CR (Cognitive Radio)
CN102594906A (en) * 2012-03-02 2012-07-18 安徽工程大学 Data fusion method and device
CN103298104A (en) * 2012-03-04 2013-09-11 山东大学威海分校 Wireless sensor network node three-dimensional positioner of leader intelligent choice mechanism
CN102612080A (en) * 2012-03-09 2012-07-25 武汉理工大学 Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding
CN102612080B (en) * 2012-03-09 2014-06-18 武汉理工大学 Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding
CN102892189B (en) * 2012-09-28 2014-09-03 北京航空航天大学深圳研究院 Energy consumption balance-based method for constructing data fusion tree of wireless sensor network
CN102892189A (en) * 2012-09-28 2013-01-23 北京航空航天大学深圳研究院 Energy consumption balance-based method for constructing data fusion tree of wireless sensor network
CN103052130A (en) * 2012-11-20 2013-04-17 南京邮电大学 Rough-set-based data fusion method for wireless multimedia sensor network
CN103052130B (en) * 2012-11-20 2015-08-05 南京邮电大学 A kind of wireless multimedia sensor network data fusion method based on rough set
CN104661185B (en) * 2013-11-21 2019-03-01 富士通株式会社 A kind of fused data transmission method and multihop network
CN104661185A (en) * 2013-11-21 2015-05-27 富士通株式会社 Aggregation tree building method, aggregation data collecting and transmitting method and node of aggregation tree
CN104796852B (en) * 2015-04-27 2019-02-01 宇龙计算机通信科技(深圳)有限公司 Method for discovering equipment, device and terminal for the direct-connected communication of terminal
CN104796852A (en) * 2015-04-27 2015-07-22 宇龙计算机通信科技(深圳)有限公司 Device discovery method and device for device-to-device communication and terminal
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
CN105610528A (en) * 2015-12-17 2016-05-25 北京交通大学 Clustering and tracking method for multipath component of time-varying channel
CN105610528B (en) * 2015-12-17 2018-05-08 中国铁路总公司 A kind of sub-clustering and tracking for time varying channel multipath component
CN107295453A (en) * 2016-03-31 2017-10-24 扬州大学 A kind of wireless sensor network data fusion method
CN105898681A (en) * 2016-04-05 2016-08-24 浙江警察学院 Wireless sensor network data fusion method of fusing time delay and survival time evenly
CN105898681B (en) * 2016-04-05 2018-12-21 浙江警察学院 The wireless sensor network data fusion method of equilibrium fusion time delay and life span
CN106060150A (en) * 2016-06-24 2016-10-26 成都之达科技有限公司 Vehicle information wireless collection method based on Internet of Vehicles
CN106060150B (en) * 2016-06-24 2019-09-13 成都之达科技有限公司 Information of vehicles wireless acquisition method based on car networking
CN107105466A (en) * 2017-03-14 2017-08-29 南京邮电大学 A kind of mobile Sink methods of data capture based on enhancing learning algorithm

Also Published As

Publication number Publication date
CN101835237B (en) 2013-06-05

Similar Documents

Publication Publication Date Title
Tarhani et al. SEECH: Scalable energy efficient clustering hierarchy protocol in wireless sensor networks
Singh et al. A data delivery framework for cognitive information-centric sensor networks in smart outdoor monitoring
Zhang et al. An energy-balanced routing method based on forward-aware factor for wireless sensor networks
Nair et al. Optimizing power consumption in iot based wireless sensor networks using Bluetooth Low Energy
Liu et al. QTSAC: An energy-efficient MAC protocol for delay minimization in wireless sensor networks
Bagci et al. An energy aware fuzzy approach to unequal clustering in wireless sensor networks
Villas et al. A spatial correlation aware algorithm to perform efficient data collection in wireless sensor networks
Patil et al. A survey on routing protocols in wireless sensor networks
Han et al. A general self-organized tree-based energy-balance routing protocol for wireless sensor network
Liu et al. Distributed clustering algorithms for data-gathering in wireless mobile sensor networks
Muruganathan et al. A centralized energy-efficient routing protocol for wireless sensor networks
Gupta et al. Load-balanced clustering of wireless sensor networks
Manjeshwar et al. APTEEN: A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks
Singh et al. Routing protocols in wireless sensor networks–A survey
Camilo et al. An energy-efficient ant-based routing algorithm for wireless sensor networks
Randhawa et al. Data aggregation in wireless sensor networks: Previous research, current status and future directions
Yi et al. PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks
Anastasi et al. Energy conservation in wireless sensor networks: A survey
CN101895956B (en) Data transmission method of multilayer distributed wireless sensor network
Tan et al. Power efficient data gathering and aggregation in wireless sensor networks
Mundada et al. A study on energy efficient routing protocols in wireless sensor networks
Lin et al. Balancing energy consumption with mobile agents in wireless sensor networks
Huang et al. A low-latency communication scheme for mobile wireless sensor control systems
Tang et al. An energy efficient hierarchical clustering index tree for facilitating time-correlated region queries in the Internet of Things
Kumar et al. A review of routing protocols in wireless sensor network

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
LICC Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20100915

Assignee: Jiangsu Nanyou IOT Technology Park Ltd.

Assignor: Nanjing Post & Telecommunication Univ.

Contract record no.: 2016320000218

Denomination of invention: Data aggregation method in wireless sensor network

Granted publication date: 20130605

License type: Common License

Record date: 20161118

EC01 Cancellation of recordation of patent licensing contract
EC01 Cancellation of recordation of patent licensing contract

Assignee: Jiangsu Nanyou IOT Technology Park Ltd.

Assignor: Nanjing Post & Telecommunication Univ.

Contract record no.: 2016320000218

Date of cancellation: 20180116

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: 20130605

Termination date: 20170514