CN104661185B - A kind of fused data transmission method and multihop network - Google Patents

Abstract

The embodiment of the present invention provides a kind of construction method of fusion tree, the collection of fused data and transmission method and its node.Wherein, node broadcasts achievement request message, wherein the achievement request message includes business factor, service identification, irrelevant node hop count threshold value and the root node mark of root node generation business or root node identifies and sending node mark.Fusion tree is added in node and after the third predetermined time, the node sends data or fused data to its father node, which refers to the node data is merged with the data of the child node of the received node within the third predetermined time after the data that obtain；Wherein, the third predetermined time, the hop count for merging root vertex was inversely proportional with the nodal distance.The integrality of fusion tree is reinforced in method and node through the embodiment of the present invention, the foundation part for merging tree, and the collection of fused data is focused on promoting fusion efficiencies, avoids repeatedly merging, and the report of fused data result improves the reliability reported.

Description

A kind of fused data transmission method and multihop network

Technical field

The present invention relates to field of communication technology more particularly to it is a kind of fusion tree construction method, fused data collection and Transmission method and its node.

Background technique

In the deployment of Ad hoc (point-to-point) network, each node is movement, and can in any way dynamically Ground holding is contacted with other nodes.In such networks, due to the finiteness of terminal wireless covering value range, two can not The node directly communicated can be grouped forwarding by other nodes.In Ad hoc network, sensor is appropriate When information is collected into certain selected nodes (constitute fusion tree), these selected nodes collected will come from multiple sections The data of point carry out fusion treatment in transmit process, then fused data are sent to aggregation node, to obtain final Statistical data so that network makes decisions.

It should be noted that the above description of the technical background be intended merely to it is convenient to technical solution of the present invention carry out it is clear, Complete explanation, and facilitate the understanding of those skilled in the art and illustrate.Cannot merely because these schemes of the invention Background technology part is expounded and thinks that above-mentioned technical proposal is known to those skilled in the art.

Summary of the invention

Since sensor network disposition is in the environment with certain range, the perception of node has certain independence, But also there is certain relevance simultaneously.The closer node on geographical location, the relevance of perception data are generally higher. The data of these node perceiveds are not single to remove data redundancy, additionally it is possible to generate the new information more summarized by fusion.

But it is had certain problems in the method for the foundation in existing fusion tree, data collection and fusion.Firstly, melting The node closed in tree is limited to dependent event, in some cases, not can guarantee the connectivity of above-mentioned node, in other words, on Stating node can be divided in the different sets that cannot be communicated with each other；Secondly, when collecting data from the child node in fusion tree, The conflict of each child node data packet will lead to the failure for collecting data；And child node sends data packet to its father node and is used for When fusion, the data packet of its own can be sent to the possibility of the father node of the father node in the presence of the father node of the child node Property, above situation can all lead to the reduction of fusion efficiencies；Third, since these fused data packets include compared to common data packet More information, therefore these fused data packets are more important than other general data packets, and there is no effective strategies at present Ensure the reliability of fused data packet report.

The embodiment of the present invention proposes a kind of construction method of fusion tree, the collection of fused data and transmission method and its section Point.Wherein, the integrality of fusion tree is reinforced in the foundation part for merging tree, and the collection of fused data is focused on promoting fusion efficiencies, be kept away Exempt from repeatedly to merge, the report of fused data result improves the reliability reported.

The above-mentioned purpose of the embodiment of the present invention is achieved by the following technical solution:

First aspect according to an embodiment of the present invention provides a kind of construction method of fusion tree, this method comprises:

Node broadcasts achievement request message, wherein the achievement request message include root node generate business business factor, Service identification, irrelevant node hop count threshold value and root node mark or root node mark and sending node mark.

The second aspect according to an embodiment of the present invention provides a kind of fused data collection method, this method comprises:

Node be added fusion tree and after the third predetermined time, the node to its father node send data or Fused data, the fused data refer to the node data and received section within the third predetermined time The data that the data of the child node of point obtain after being merged；

Wherein, the third predetermined time, the hop count for merging root vertex was inversely proportional with the nodal distance.

In terms of third according to an embodiment of the present invention, a kind of fused data transmission method is provided, this method comprises:

It is sent when including the fused data of more than one useful information in node to gateway or fusion tree father node, the section Point is by being split into more than one data packet and the side of useful information of each data packet comprising predetermined quantity for the fused data Formula or the node are sent the fused data to gateway or to the father node of the node by retransmission scheme；

Wherein, the quantity of the data packet after partition or the adjustment adaptive according to link-quality of the number of re-transmission.

4th aspect according to an embodiment of the present invention, provides the node in a kind of network, wherein the node includes:

First radio unit, the first establishing unit are used to broadcast achievement request message, wherein the achievement request message packet Business factor, service identification, irrelevant node hop count threshold value and the root node mark or root section of business are generated containing root node Point identification and sending node mark.

5th aspect according to an embodiment of the present invention, provides the node in a kind of network, wherein the node includes:

First transmission unit, first transmission unit are used to that fusion tree to be added in the node and pass through the third predetermined time Afterwards, data is sent to its father node or fused data, the fused data refer to the node data The data obtained after being merged with the data of the child node of the received node within the third predetermined time；

Wherein the third predetermined time is inversely proportional with the hop count that the nodal distance merges root vertex.Implement according to the present invention 6th aspect of example, provides the node in a kind of network, wherein the node includes:

7th transmission unit, the 7th transmission unit node to gateway or fusion tree father node send comprising one with It include pre- by the way that the fused data is split into more than one data packet and each data packet when the fused data of upper useful information The mode of the useful information of fixed number amount or the node are by retransmission scheme, by the fused data to gateway or to the node Father node send；

Wherein, the quantity of the data packet after partition or the adjustment adaptive according to link-quality of the number of re-transmission.

The beneficial effect of the embodiment of the present invention is that the construction method of fusion tree through the embodiment of the present invention merges number According to collection and transmission method and its node.Wherein, the integrality of fusion tree is reinforced in the foundation part for merging tree, fused data It collects and focuses on being promoted fusion efficiencies, avoids repeatedly merging, the report of fused data result improves the reliability reported.

Referring to following description and accompanying drawings, only certain exemplary embodiments of this invention is disclosed in detail, specifies original of the invention Reason can be in a manner of adopted.It should be understood that embodiments of the present invention are not so limited in range.In appended power In the range of the spirit and terms that benefit requires, embodiments of the present invention include many changes, modifications and are equal.

The feature for describing and/or showing for a kind of embodiment can be in a manner of same or similar one or more It uses in a other embodiment, is combined with the feature in other embodiment, or the feature in substitution other embodiment.

It should be emphasized that term "comprises/comprising" refers to the presence of feature, one integral piece, step or component when using herein, but simultaneously It is not excluded for the presence or additional of one or more other features, one integral piece, step or component.

Detailed description of the invention

Many aspects of the invention may be better understood referring to attached drawing below.Component in attached drawing is not proportional draws System, and be intended merely to that the principle of the present invention is shown.For the ease of showing and describing some parts of the invention, corresponded in attached drawing Part may be exaggerated or minimized.Elements and features described in one drawing or one embodiment of the invention can be with Elements and features shown in one or more other attached drawings or embodiment combine.In addition, in the accompanying drawings, similar mark It number indicates corresponding component in several attached drawings, and may be used to indicate corresponding component used in more than one embodiment.

In the accompanying drawings:

Fig. 1 is the fusion tree constructing method flow chart of the embodiment of the present invention 1；

Fig. 2 is the fusion tree constructing method flow chart of the embodiment of the present invention 2；

Fig. 3 is the fusion tree constructing method flow chart of the embodiment of the present invention 3；

Fig. 4 is the fusion tree constructing method flow chart of the embodiment of the present invention 4；

Fig. 5 is the fused data collection method flow chart of the embodiment of the present invention 5；

Fig. 6 is the fused data collection method flow chart of the embodiment of the present invention 6；

Fig. 7 is the fused data transmission method flow chart of the embodiment of the present invention 7；

Fig. 8 is that the node of the embodiment of the present invention 8 constitutes schematic diagram；

Fig. 9 A is a kind of composition schematic diagram of embodiment of 9 interior joint of the embodiment of the present invention；

Fig. 9 B is the composition schematic diagram of the another embodiment of 9 interior joint of the embodiment of the present invention；

Figure 10 is that the node in the embodiment of the present invention 11 constitutes schematic diagram；

Figure 11 is that the node in the embodiment of the present invention 12 constitutes schematic diagram；

Figure 12 is that the node in the embodiment of the present invention 13 constitutes schematic diagram；

Figure 13 is that the node of the embodiment of the present invention 8 constitutes schematic diagram.

Specific embodiment

Referring to attached drawing, by following specification, the aforementioned and other feature of the embodiment of the present invention be will be apparent.This A little embodiments are only exemplary, and are not limitations of the present invention.In order to enable those skilled in the art to be easy geography Solution the principle of the present invention and embodiment, the embodiment of the present invention are illustrated by taking Ad-hoc network as an example, it is to be understood that, this hair Bright embodiment is not limited to Ad-hoc network, for example, method and apparatus provided in an embodiment of the present invention are also applied for sensor network Other multihop networks such as network.

The preferred embodiment of the present invention is illustrated with reference to the accompanying drawings.

Embodiment 1

Fig. 1 is the fusion tree constructing method flow chart of the embodiment of the present invention 1, and this method is applied to the section in multihop network Point, in the present embodiment, for the node for sending achievement request message.Fig. 1 is please referred to, this method comprises:

Step 101, root node or sending node broadcast achievement request message, and wherein the achievement request message includes root node The business factor of generation business, service identification, irrelevant node hop count threshold value and root node mark or root node mark and Sending node mark.

In the present embodiment, for example, in Network Fault Detection, when detecting network failure, failure can be directed to Node establishes diagnostic tree, which belongs to fusion tree, and establishment process is completed by broadcast achievement message, wherein discovery failure Node and the node for sending broadcast achievement message can become the root node of the diagnostic tree.

In the present embodiment, which generates a business, including required business factor, service identification and irrelevant Node hop count threshold value, wherein the business factor can be set according to different scenes, such as: whether determining certain node When failure, business factor can be set to the state with link between certain node；When monitoring fire, business factor can be set to this Whether the temperature monitoring value on ground is greater than some limit etc., and the present embodiment is not in this, as limitation.Wherein, the business factor and Service identification can be stored in advance in the unified configured traffic table of all nodes；Merge the method that root vertex generates business Similarly to the prior art, details are not described herein again.

When establishing fusion tree, the root node broadcast achievement request message first includes fusion tree root in the request message Node ID, business factor, service identification, irrelevant node hop count threshold value.Then other nodes can receive the root node broadcast Achievement request message meets the business factor in other nodes or is being unsatisfactory for business factor and irrelevant node hop count When threshold value is greater than 0, which can be added the fusion tree；Then other nodes that the fusion tree is added send section as intermediate Point continues broadcast and forwards the achievement request message, and so on, it is completed until the fusion tree constructs.Wherein, which sends section The request message of point broadcast not only includes above- mentioned information, but also including sending node ID.

In the present embodiment, which can be set as arbitrary value, this reality according to actual business requirement Example is applied not in this, as limitation.

In the present embodiment, which may also include the deep-controlled threshold value of fusion tree, receive achievement request The node of message may also be combined with the deep-controlled threshold value building fusion tree of the fusion tree, and detailed process is said in following embodiment 2 Bright, details are not described herein again.

In the present embodiment, if the node for sending achievement request message is intermediate node when non-root node, the section Point can also be used as receiving node simultaneously, and for receiving the achievement request message of broadcast, this hair is can be used in specific embodiment Method in bright embodiment 2 or embodiment 3 or embodiment 4, content is merged and this, and details are not described herein again.

Fusion tree constructing method through this embodiment utilizes " business factor " control to establish the range of meromixis tree, Irrelevant node by controlling certain hop count is added to improve the integrality of fusion tree.

Embodiment 2

Fig. 2 is the fusion tree constructing method flow chart of the embodiment of the present invention 2.This method is applied to the section in multihop network Point, for the node for receiving achievement request message.As shown in Fig. 2, this method comprises:

Step 201, node receives the achievement request message of broadcast；

Wherein, which can be the child node of root node, when the node receives the achievement request message of root node broadcast, The achievement request message includes business factor, the service identification, irrelevant node hop count threshold value, Yi Jigen that root node generates business Node identification；

In addition, the node can also be the child node of other intermediate sending nodes, is received in the node and send section among other When the achievement request message that point is sent, which includes that root node generates the business factor of business, service identification, non- Interdependent node hop count threshold value, root node mark and sending node mark.

Step 202, the business factor and the non-phase are unsatisfactory for when the node meets the business factor or in the node When artis hop count threshold value is greater than zero, which is added fusion tree；

In the present embodiment, the node be added fusion tree when, by the root node identify or by the root node mark and Sending node mark and the service identification are stored in fusion tree list.

In the present embodiment, this method may also include step 203, and broadcast forwards the achievement request message, so that other are saved After point receives the request message, it is determined whether fusion tree is added, the specific method that fusion tree is added is as described above, as such It pushes away, when the irrelevant node hop count threshold value in step 202 is not more than zero, fusion tree building is completed.

As can be seen from the above embodiments, step 203 is optional step.

As can be seen from the above embodiments, " business factor " control is utilized to establish the range of meromixis tree, it is certain by controlling The irrelevant node of hop count is added to improve the integrality of fusion tree.

Embodiment 3

Fig. 3 is the fusion tree constructing method flow chart of the embodiment of the present invention 3.With embodiment 2 the difference is that, in step In rapid 301, received achievement request message further includes that deep-controlled threshold is set in fusion other than including the above- mentioned information of embodiment 2 Value.

In step 302, determining whether also to need to consider that deep-controlled threshold value is set in fusion when fusion tree is added.Wherein, This is unsatisfactory for when the node meets the business factor and the deep-controlled threshold value of fusion tree is more than or equal to zero or in the node Greater than zero and when the fusion tree control threshold is more than or equal to zero, which is added for business factor, the irrelevant node hop count threshold value Fusion tree.

In the present embodiment, in step 302, when the deep-controlled threshold value of fusion tree is greater than zero, the achievement is forwarded to ask Message is sought, but when the deep-controlled threshold value of fusion tree is equal to zero, does not forward the achievement request message.

As can be seen from the above embodiments, " business factor " control is utilized to establish the range of meromixis tree, it is certain by controlling The irrelevant node of hop count is added to improve the integrality of fusion tree, sets deep-controlled threshold value by the way that fusion is added, can be into one Step reduces the scale that fusion tree is added in interdependent node.

In above-described embodiment 2 and embodiment 3, before step 202 and step 302, may also include that the root node according to Fusion root vertex mark and service identification judge whether the received achievement to come from the identical services of identical root node Request message, it is when the judgment result is yes, without any processing；When the judgment result is No, subsequent step, i.e. step are executed 202 or 302.

In the present embodiment, this method may also include step 303, and broadcast forwards the achievement request message, so that other are saved After point receives the request message, it is determined whether fusion tree is added, the specific method that fusion tree is added is as described above, as such It pushes away, when the irrelevant node hop count threshold value in step 302 is not more than zero, fusion tree building is completed.

Embodiment 4

Fig. 4 is the fusion tree constructing method flow chart of the embodiment of the present invention 4.In the present embodiment, it is contribute with a reception The node of request message is added for fusion tree and is illustrated to achievement process, which can be father node, be also possible to Child node, or be leaf node.

Step 401, node receives the achievement request message of broadcast；

In the present embodiment, which can be the child node of root node, can also be the child node of other intermediate sending nodes, As described in Example 2, details are not described herein again.

Step 402, judge whether to receive the request message of the identical services from same root node；It is in judging result It when being, ends processing, when the judgment result is No, executes step 403；

In step 402, fusion root vertex mark and industry can be whether there is by searching in fusion tree list Business mark, and if so, indicating the received achievement request message to come from the identical services of identical root node of the node.

Step 403, judge whether the node meets the business factor in the achievement request message, be no in judging result When, step 404 is executed, it is no to then follow the steps 406；

In step 403, if it is determined that the node is unsatisfactory for the business factor, then the node is irrelevant node.

Step 404, judge whether irrelevant node hop count threshold value is greater than 0, when the judgment result is No, end processing, Judging result is when being, to execute step 405；

Step 405, irrelevant node hop count threshold value is subtracted 1；

Step 406, judge whether comprising the deep-controlled threshold value of fusion tree in the achievement request message, be yes in judging result When, step 407 is executed, when the judgment result is No, executes step 409；

Step 407, judge whether the deep-controlled threshold value of fusion tree is more than or equal to 0, when the judgment result is yes, execute step Rapid 408, when the judgment result is No, end processing；

In the present embodiment, which can be set as arbitrary value, this reality according to actual business requirement Example is applied not in this, as limitation.

Step 408, which is subtracted 1；

Step 409, which is added fusion tree；

In the present embodiment, after fusion tree is added in the node, the jumping figure value of fusion tree can be added 1.

In the present embodiment, after fusion tree is added in the node, this method can also include:

Step 410, which is identified or root node mark is identified with sending node and the service identification is deposited Storage is in fusion tree list；

In the present embodiment, when the deep-controlled threshold value of fusion tree is greater than zero, this method further includes step 411, the section Point broadcast forwards the achievement request message, wherein can by step 405 irrelevant node hop count threshold value, in step 408 The jumping figure value of fusion tree in the deep-controlled threshold value of fusion tree, step 409 is added in the achievement request message, and is broadcasted and turned It sends out.

In the present embodiment, in step 411, which broadcast can forward achievement request to disappear after fusion tree is added Breath；Further, it is also possible to forwarding the achievement request message again after the first predetermined time.

In step 411, after the node forwards the achievement request message, within the second predetermined time, come if receiving From the achievement request message of the identical services of identical root node, then with no treatment；After second predetermined time, from this Fusion tree list in delete in the achievement request message the root node mark or the root node mark and sending node mark, And the service identification.Wherein, which can be realized by one update timer of setting, i.e., in update timing It is without any processing when device is then before received from the achievement request message of the identical identical services with node；It is fixed in the update When device then after, by the node from fusion tree list in delete.

In the present embodiment, root node mark and corresponding business can be whether there is in fusion tree list by inquiry Mark is to determine whether the node receives the achievement request message of the identical services from identical root node.If it is present table Show that the node received the achievement request message of the identical services from same root node.

In the present embodiment, step 411 is optional step, when the deep-controlled threshold value of fusion tree is equal to zero, is not executed The step.

In the present embodiment, which is optional parameters.

Above-mentioned steps 402,406,406-408,410,411 are optional step, can need to select according to specific implementation process Corresponding steps.

Tree constructing method is merged through this embodiment, is utilized " service feature " control to establish the range of meromixis tree, is led to The irrelevant node addition for controlling certain hop count is crossed to improve the integrality that fusion is set, passes through and the deep-controlled threshold of fusion tree is added Value can further decrease the scale that fusion tree is added in interdependent node.

Above embodiments are illustrated to how to establish fusion tree.

In the present embodiment, after the completion of fusion tree is established, the father node in the fusion tree can be collected from child node The data of itself and the data received can be carried out fusion treatment, form new fused data by data；The final fusion tree Root node can be collected into the data of each node in the fusion tree.The collection of fused data is illustrated below.

Embodiment 5

Fig. 5 is the fused data collection method flow chart of the embodiment of the present invention 5, and this method is applied to the section in multihop network Point.As shown in figure 5, this method comprises:

Step 501, in node addition fusion tree and after the third predetermined time, which sends itself to its father node Data or fused data, which refers to, and the node data is inscribed in the third predetermined time The data that the data of the child node for the node received obtain after being merged；Wherein, the third predetermined time and the nodal distance The hop count of the fusion root vertex is inversely proportional.

In the present embodiment, which can determine in the following way:

T=t₀-Hop×Δ_i(t), wherein Δ_i(t) time quantum waited for fusion tree interior joint, node can be according to these The adjustment of ground information, such as according to the neighbor node number of itself, more than neighbor node number, waiting time unit is big, neighbor node Number is few, and waiting time unit is small；Hop is the hop count of the nodal distance fusion root vertex, t₀To merge root vertex Maximum delay.

As can be seen from the above embodiments, which sends data or fusion number to its father node after preset time delay According to the collection efficiency of fused data can be improved.

In the present embodiment, in order to reduce lose fused data risk, further increase the collection efficiency of fused data, The node (non-leaf nodes) can also carry out active inquiry to its child node before the third predetermined time reaches.In this way, should Method further include:

Step 500, which sends the first inquiry message to its child node；If not receiving by the child node reply of inquiry The child node data or the child node fused data when, which sends the first inquiry message again.

In the present embodiment, it can set for the 4th predetermined time, when reaching for four predetermined times, the node is to its child node The first inquiry message is sent, the 4th predetermined time was less than the third predetermined time；If not received in predetermined hello interval When the child node data or the fused data of the child node for being replied by the child node of inquiry, which sends again The first inquiry message.Wherein, a settable inquiry waiting delay timer set for the 4th predetermined time.

Wherein, the 4th predetermined time can determine in the following way:

T_q≤T_pInquiry transmission times × inquiry sends interval, wherein T_qFor the 4th predetermined time, T_pIt is pre- for the third It fixes time, it can be any preset value that inquiry, which sends interval, and the present embodiment does any restrictions not to this.

In step 500, which can send the first inquiry message to its child node by way of unicast；Or Person, the node broadcasts send the first inquiry message, wherein include all child nodes by inquiry in the first inquiry message.

In the present embodiment, when the node is not that root node is also not leaf node, which can send out to its child node The first inquiry message is sent, the second inquiry message of its father node transmission can also be received, therefore, when the node receives his father's section When the second inquiry message that point is sent, this method can also include:

Judge whether the node is by inquiry node, when the judgment result is yes, to his father's node reverts back node itself Data or the fused data of the node, otherwise end processing.

Existing achievement method building can be used in fusion tree in the present embodiment step 501, in addition, this hair also can be used Method in bright Examples 1 to 4 is established, and content is merged and this, and details are not described herein again.

In the present embodiment, which can also be used as receiving node simultaneously, and the child node for receiving the node reports Data, the method that the embodiment of the present invention 6 can be used in specific embodiment, content is merged and this, and details are not described herein again.

By the above-mentioned fused data collection method of the present embodiment it is found that improving fused data receipts by forward delay interval design The efficiency of collection reduces the risk for losing fused data by active inquiry mechanism, further increases the effect of fused data collection Rate.

Embodiment 6

Fig. 6 is the fused data collection method flow chart of the embodiment of the present invention 6, and this method is applied to the section in multihop network Point.As shown in fig. 6, this method comprises:

Step 601, in addition fusion tree and within the 5th predetermined time, which receives in the child node of the node node The data of report；The data that wherein child node of the node reports include: the child node data or the node of the node The data that child node data obtains after being merged with the data that the child node of the child node of the node reports；Wherein, should 5th predetermined time was inversely proportional with the nodal distance hop count for merging root vertex.

Step 602, in the data that after the 5th predetermined time, which reports the child node of the node received The data obtained after being merged with the node data are reported to the father node of the node；

In the present embodiment, the 5th predetermined time can determine in the following way:

T=t₀-Hop×Δ_i(t), wherein Δ_i(t) time quantum waited for fusion tree interior joint, node can be according to these The adjustment of ground information, such as according to the neighbor node number of itself, more than neighbor node number, waiting time unit is big, neighbor node Number is few, and waiting time unit is small；Hop is hop count of the child node of the node apart from the fusion root vertex, t₀For fusion Root vertex maximum delay.

As can be seen from the above embodiments, which sends data or fused data after preset time delay, can be improved and melts Close the collection efficiency of data.

In the present embodiment, similar to Example 5, in order to reduce the risk for losing fused data, further increase fusion The collection efficiency of data, the node (non-leaf nodes) can also carry out before reaching for the 5th predetermined time to its child node Active inquiry.In this way, this method further include:

Step 600, which sends third inquiry message to its child node；If not receiving by the child node reply of inquiry The child node data or the child node fused data when, which sends the third inquiry message again.

Wherein, it can set for the 6th predetermined time, when reaching for six predetermined times, which sends third to its child node Inquiry message, the 6th predetermined time were less than for the 5th predetermined time；If not receiving in predetermined hello interval by inquiry When the child node data or the fused data of the child node that child node is replied, which sends the third again and asks Ask message.Similar to Example 5, a settable inquiry waiting delay timer set for the 6th predetermined time.

Wherein, the 6th predetermined time met T_q≤T_pInquiry transmission times × inquiry sends interval, wherein T_qFor the section 6th predetermined time of point, T_pFor the 5th predetermined time of the node, it can be any preset value that inquiry, which sends interval, this Embodiment does any restrictions not to this.

In step 600, which sends the third inquiry message to its child node by way of unicast；Alternatively, should Node broadcasts send the third inquiry message, wherein include all child nodes by inquiry in the third inquiry message.

In the present embodiment, similar to Example 5, the node in addition to can to its child node send third inquiry message, The 4th inquiry message of its father node transmission can also be received, therefore, is asked when the node receives the 4th of the transmission of its father node When asking message, this method can also include:

Judge whether the node is by inquiry node, when the judgment result is yes, to his father's node reverts back node itself Data or the fused data of the node, otherwise end processing.

Existing achievement method building can be used in fusion tree in the present embodiment step 601, in addition, this hair also can be used The bright method that can be used in Examples 1 to 4 is established, and content is merged and this, and details are not described herein again.

By the above-mentioned fused data collection method of the present embodiment it is found that improving fused data receipts by forward delay interval design The efficiency of collection reduces the risk for losing fused data by active inquiry mechanism.

The building of fusion tree, the collection of fused data is illustrated in above embodiments.

After the data that node is collected into the fusion tree interior joint, the fused data being collected into can be saved to gateway or his father Point is sent, so that network side is diagnosed according to the data.Below in conjunction with attached drawing to the biography of the fused data of the embodiment of the present invention Transmission method is illustrated.

Embodiment 7

Fig. 7 is the fused data transmission method of the embodiment of the present invention 7, and this method is applied to the node in multihop network.Such as Shown in Fig. 7, this method comprises:

Step 701, the fusion number comprising more than one useful information is sent to gateway or fusion tree father node in node According to when, which includes the useful of predetermined quantity by the way that the fused data is split into more than one data packet and each data packet The mode of information or the node are sent the fused data to gateway or to the father node of the node by retransmission scheme；

Wherein, the adjustment that the quantity of the data packet after partition or the number of re-transmission can be adaptive according to link-quality, Such as node such as works as useful information according to the adaptive adjustment of the factors such as application scenarios, type of service, channel quality, packet size Bring load is larger, causes fused data packet larger, and when transmission reliability declines, the mode of partition may be selected；And when fusion When data packet includes that information is higher to integrity demands, retransmission scheme is may be selected in node, and if current ink quality is poor, Then can according to need by fused data packet be split into the transmission of more multiple fused data packets or node disjoint repeat to send it is more multiple Fused data packet；When link-quality is preferable, then fused data packet relatively can be split into less a fused data packet and passed Defeated or node disjoint repeats to send less secondary fused data packet.

Any one existing method can be used in the building of fusion tree in the present embodiment step 701, and reality also can be used The method applied in example 1~4 is established, and the collection of fused data can be used any one existing mode, can also use embodiment 5 Or the method in 6 is collected, content is merged and this, and details are not described herein again.

By the above-mentioned fused data transmission method of the present embodiment it is found that being melted by autonomous optional repeatedly sending strategy raising Close the reliability of data result report.

Embodiment 8

The embodiment of the present invention 8 additionally provides the node in a kind of network, the principle and implementation solved the problems, such as due to the node The method of example 1 is similar, therefore its specific implementation is referred to the implementation of the method for embodiment 1, and overlaps will not be repeated.

Fig. 8 is the node 800 in a kind of multihop network, which includes: the first radio unit 801, wherein

First radio unit 801, is used to broadcast achievement request message, and wherein the achievement request message is raw comprising root node At the business factor of business, service identification, irrelevant node hop count threshold value and root node mark or root node mark and hair Send node identification.

When the node is the fusion root vertex of generation business, the first radio unit 801 broadcasts achievement request message, should Include fusion root vertex ID, business factor, service identification, irrelevant node hop count threshold value in request message.When the node is When receiving the achievement request message of root node broadcast, and other nodes of fusion tree be added, first radio unit 801 broadcast Achievement request message not only includes above- mentioned information, but also including the node self ID.

Wherein, which can also include storage unit 802, be used to deposit business factor and service identification in advance Storage is in unified configured traffic table.

In the present embodiment, if the node is intermediate node when non-root node, which can also conduct simultaneously Receiving node, specific embodiment is as described in embodiment 9 or embodiment 10, and content is merged and this, no longer heavy herein It is multiple.

Figure 13 is the composition schematic block diagram of the node 1300 of the embodiment of the present invention, and as shown in figure 13, which includes Memory 1302, processor 1303, memory 1302 are coupled to processor 1303..Wherein, which, which can store, builds Set request message and the traffic table comprising business factor and service identification；Additionally storage journey relevant to fusion tree building Sequence, and the program is executed under the control of processor 1303, to realize the building of node fusion tree.

In one embodiment, the functional unit of above-mentioned node can be integrated into processor 1303, wherein at this Reason device 1303 can be configured as broadcasting achievement request message, and wherein the achievement request message includes that root node generates business Business factor, service identification, irrelevant node hop count threshold value and root node mark or root node mark and sending node Mark.Its concrete implementation mode is as described above, be not repeated herein.

In another embodiment, the functional unit of above-mentioned node can with processor separate configuration, such as can will It is configured to the chip connecting with processor 1303, and the function of node fusion tree building is realized by the control of processor.

In addition, as shown in figure 13, which can also include sensor 1301, transceiver 1304 and power module 1305 Deng.Wherein, similarly to the prior art, details are not described herein again for the function of above-mentioned component.It is worth noting that, node 1300 is not yet It is to have to include all components shown in Figure 13；In addition, node 1300 can also include the component being not shown in Figure 13, The prior art can be referred to.

Above-mentioned node through this embodiment utilizes " business factor " control to establish the range of meromixis tree, passes through control The irrelevant node for making certain hop count is added to improve the integrality of fusion tree.

Embodiment 9

The embodiment of the present invention 9 additionally provides the node in a kind of network, the principle and implementation solved the problems, such as due to the node The method of example 2 is similar, therefore its specific implementation is referred to the implementation of the method for embodiment 2, and overlaps will not be repeated.

Fig. 9 A is the node 900 in a kind of multihop network, which includes: the processing of the first receiving unit 901, first Unit 902, wherein

First receiving unit 901 is used to receive the achievement request message of broadcast, and wherein the achievement request message includes root Node generates business factor, service identification, irrelevant node hop count threshold value and the root node mark or root node mark of business Know and sending node identifies；

First processing units 902 are used for when the node meets the business factor, which is added fusion tree； Or the business factor is unsatisfactory in the node, and when irrelevant node hop count threshold value is greater than 0, which is added and is merged Tree.

Wherein, when the first receiving unit 901 receives the achievement request message from root node broadcast, achievement request disappears Breath generates business factor, service identification, irrelevant node hop count threshold value and the root node mark of business comprising root node；

When the first receiving unit 901 receives the achievement request message that sending node is sent among other, achievement request Message includes business factor, service identification, irrelevant node hop count threshold value, root node mark and the transmission that root node generates business Node identification.

In the present embodiment, when the node is unsatisfactory for the business factor, and the irrelevant node hop count threshold value is greater than When 0, which can be also used for subtracting 1 for the irrelevant node hop count threshold value.

In the present embodiment, which can also include the first retransmission unit 903, be used to broadcast forwarding achievement request Message, or for forwarding the achievement request message after the first predetermined time reached.

Fig. 9 B is the another embodiment of the present embodiment interior joint 900, and in the present embodiment, which includes the One receiving unit 901, first processing units 902, the first retransmission unit 903.

In the present embodiment, the node can also include the first storage unit 904, be used for by the root node identify or Root node mark and sending node mark and the service identification are stored in fusion tree list by person.

Wherein, after first retransmission unit 903 forwards the achievement request message, which can also include:

The second processing unit 905 is used to receive the identical services from identical root node within the second predetermined time Achievement request message when, with no treatment；After second predetermined time, the achievement is deleted from the fusion tree list Root node mark or root node mark and sending node mark and the service identification in request message.

Wherein it is possible to by searching for whether there is the fusion tree root section in the fusion tree list in the first storage unit 904 Point identification and service identification, and if so, indicating the received achievement to come from the identical services of identical root node of the node Request message.

In the present embodiment, which can also include the first judging unit 906, be used for according to the fusion root vertex Mark and service identification judge whether the received achievement request message to come from the identical services of identical root node；

Wherein, whether the first judging unit 906 can be by searching for depositing in the fusion tree list in the first storage unit 904 In fusion root vertex mark and service identification, come and if so, indicating that the node is received from identical root node The achievement request message of identical services.

And the first processing units 902 are no in the judging result of first judging unit 906, and node satisfaction should When business factor, which is added fusion tree；Or first judging unit 906 judging result be no, the node not Meet the business factor, and when irrelevant node hop count threshold value is greater than 0, which is added fusion tree.

It can refer to attached drawing 13 below to illustrate the composition of the node of the present embodiment.It is no longer superfluous with the something in common of embodiment 8 It states, the present embodiment and the difference of embodiment 8 is illustrated below.Its with embodiment 8 the difference is that, the processing Device 1303 is configurable for receiving achievement request message, and is judged whether that diagnostic tree is added according to the achievement request message, Its specific content is incorporated in this, is not repeated herein.

Wherein, memory 1302 can store above-mentioned achievement message and the above-mentioned business comprising business factor and service identification Table can additionally store and execute above-mentioned program relevant to the building of fusion tree.And it is executed under the control of processor 1303 The program, to realize the building of fusion tree.

As can be seen from the above embodiments, " business factor " control is utilized to establish the range of meromixis tree, it is certain by controlling The irrelevant node of hop count is added to improve the integrality of fusion tree.

Embodiment 10

The embodiment of the present invention 10 additionally provides the node in a kind of network, the principle and implementation solved the problems, such as due to the node The method of example 3 is similar, therefore its specific implementation is referred to the implementation of the method for embodiment 3, and overlaps will not be repeated.

With the node in embodiment 9 the difference is that, in the received achievement request message of the first receiving unit 901, It further include that deep-controlled threshold value is set in fusion other than including the above- mentioned information of embodiment 9；

In the present embodiment, which is also used to meet the business factor and the fusion tree in the node When deep-controlled threshold value is more than or equal to 0, which is added fusion tree；Or the business factor, non-phase are unsatisfactory in the node Fusion tree is added greater than 0 and when the deep-controlled threshold value of fusion tree is more than or equal to 0, by the node in artis hop count threshold value；

First retransmission unit 903 does not forward the achievement request message when the deep-controlled threshold value of fusion tree is equal to 0.

Wherein, which can be set as arbitrary value according to actual business requirement, and the present embodiment is not In this, as limitation.

In the present embodiment, when the deep-controlled threshold value of fusion tree be greater than 0 when, the first processing units 902 be also used to by The deep-controlled threshold value of fusion tree subtracts 1.

It can refer to attached drawing 13 below to illustrate the composition of the node of the present embodiment.It is no longer superfluous with the something in common of embodiment 8 It states, the present embodiment and the difference of embodiment 8 is illustrated below.Its with embodiment 8 the difference is that, the processing Device 1303 is configurable for receiving the achievement request message for setting deep-controlled threshold value comprising fusion, and is asked according to the achievement Message is asked to judge whether that diagnostic tree is added, specific content is incorporated in this, is not repeated herein.

Wherein, memory 1302 can store above-mentioned achievement message and the above-mentioned business comprising business factor and service identification Table can additionally store and execute above-mentioned program relevant to the building of fusion tree.And it is executed under the control of processor 1303 The program, to realize the building of fusion tree.

As can be seen from the above embodiments, " business factor " control is utilized to establish the range of meromixis tree, it is certain by controlling The irrelevant node of hop count is added to improve the integrality of fusion tree, sets deep-controlled threshold value by the way that fusion is added, can be into one Step reduces the scale that fusion tree is added in interdependent node.

Embodiment 11

The embodiment of the present invention 11 additionally provides the node in a kind of network, the principle and implementation solved the problems, such as due to the node The method of example 5 is similar, therefore its specific implementation is referred to the implementation of the method for embodiment 5, and overlaps will not be repeated.

Figure 10 is the node 1000 in a kind of multihop network, which includes: the first transmission unit 1001, wherein

First transmission unit 1001 is used in node addition fusion tree and after the third predetermined time, to his father Node sends data or fused data, which refers to by the node data and in the third The data that the data of the child node of the received node obtain after being merged in predetermined time；

Wherein, which is inversely proportional with the hop count that the nodal distance merges root vertex.

In the present embodiment, the method for determination of the third predetermined time is similar to Example 5, and details are not described herein again.

In the present embodiment, which can also include:

Second transmission unit 1002 sends first to the child node of the node before the third predetermined time reaches Inquiry message；And after not receiving the child node data replied by the child node of inquiry or child node fusion Data when, send the first inquiry message again；Alternatively,

Second transmission unit 1002 can be also used for when reaching for four predetermined times, send to the child node of the node First inquiry message；4th predetermined time was less than the third predetermined time；It does not receive in predetermined hello interval by inquiry Child node reply the child node data or the child node fused data when, send first inquiry again and disappear Breath.

Wherein, the method for determination of the 4th predetermined time is similar to Example 5, and details are not described herein again.

In the present embodiment, which sends first inquiry to its child node by way of unicast Message；Alternatively, 1002 broadcast transmission of the second transmission unit the first inquiry message, wherein includes institute in the first inquiry message Have by the child node of inquiry.

In the present embodiment, which can also receive his father in addition to that can send the first inquiry message to its child node The second inquiry message that node is sent, therefore, which can also include:

Second receiving unit 1003 is used to receive the second inquiry message that the father node of the node is sent；

Third transmission unit 1004 is used for when the node is by inquiry node, and replying to the father node of the node should Node data or the fused data of the node.

In the present embodiment, which can also be used as receiving node, specific embodiment such as embodiment 12 simultaneously Described, content is merged and this, is not repeated herein.

Wherein, the node of the present embodiment can also include the content as described in embodiment 8 or embodiment 9 or embodiment 10, For constructing fusion tree, content is merged and this, and details are not described herein again.According to the above-mentioned node of the present embodiment, pass through transmission Delay designs to improve the efficiency of fused data collection, and the risk for losing fused data is reduced by active inquiry mechanism.

It can refer to attached drawing 13 below to illustrate the composition of the node of the present embodiment.It is no longer superfluous with the something in common of embodiment 8 It states, the present embodiment and the difference of embodiment 8 is illustrated below.Its with embodiment 8 the difference is that, the processing Device 1303 is configurable for the collection of fused data, and in addition the processor can also be configured to realize embodiment 8 simultaneously Or the function of embodiment 9 or embodiment 10 and the processor in embodiment 12, specific content are incorporated in this, herein no longer It repeats.

Wherein, memory 1302 can store above-mentioned fused data, can additionally store execute it is above-mentioned with merge set collection Relevant program.And the program is executed, under the control of processor 1303 to realize the collection of fusion tree.Furthermore the memory 1302 can be also used for storing the journey stored such as the memory in embodiment 8 or embodiment 9 or embodiment 10 and embodiment 12 Sequence.

Embodiment 12

The embodiment of the present invention 12 additionally provides the node in a kind of network, the principle and implementation solved the problems, such as due to the node The method of example 6 is similar, therefore its specific implementation is referred to the implementation of the method for embodiment 6, and overlaps will not be repeated.

Figure 11 is the node 1100 in a kind of multihop network, wherein the node 1100 include: third receiving unit 1101, First integrated unit 1102, the 4th transmission unit 1103, specifically include:

Third receiving unit 1101 receives the node in node addition fusion tree and within the 5th predetermined time The data that child node reports；The data that wherein child node of the node reports include: the node child node data or The data that the child node data of the node obtains after being merged with the data that the child node of the child node of the node reports；

First integrated unit 1102, the data that the child node for the node that third receiving unit 1101 receives is reported It is merged with the data of the node itself；

4th transmission unit 1103, after the 5th predetermined time, after first integrated unit 1102 fusion The data of acquisition are reported to the father node of the node；

Wherein, the 5th predetermined time was inversely proportional with the hop count that the nodal distance merges root vertex.

In the present embodiment, the method for determination of the 5th predetermined time is similar to Example 6, and details are not described herein again.

In the present embodiment, which can also include:

5th transmission unit 1104 is used to send the in the child node for reaching the forward direction node of the 5th predetermined time Three inquiry message；It does not receive in the node and is melted by the child node data of the child node reply of inquiry or the child node When data after conjunction, the third inquiry message is sent again；Or.

5th transmission unit 1104 is also used to after reaching for the 6th predetermined time, sends third to the child node of the node Inquiry message；The child node data replied by the child node of inquiry is not received in predetermined hello interval in the node Or when the fused data of the child node, the third inquiry message is sent again；It is pre- that 6th predetermined time was less than the 5th It fixes time.

Wherein, the method for determination of the 6th predetermined time is similar to Example 6, and details are not described herein again.

In the present embodiment, the 5th transmission unit 1104 by way of unicast to the child node of the node send this Three inquiry message；Alternatively, 1104 broadcast transmission of the 5th transmission unit third inquiry message, wherein in the third inquiry message Include all child nodes by inquiry.

In the present embodiment, which can also receive his father in addition to that can send third inquiry message to its child node The 4th inquiry message that node is sent, therefore, which can also include:

4th receiving unit 1105 is used to receive the 4th inquiry message that the father node of the node is sent；

6th transmission unit 1106 is used for when the node is by inquiry node, and replying to the father node of the node should Node data or the fused data of the node.

Wherein, the node of the present embodiment can also include the content as described in embodiment 8 or embodiment 9 or embodiment 10, For constructing fusion tree, content is merged and this, and details are not described herein again.

It can refer to attached drawing 13 below to illustrate the composition of the node of the present embodiment.It is no longer superfluous with the something in common of embodiment 8 It states, the present embodiment and the difference of embodiment 8 is illustrated below.Its with embodiment 8 the difference is that, the processing Device 1303 is configurable for the collection of fused data, and in addition the processor can also be configured to realize embodiment 8 simultaneously Or the function of embodiment 9 or the processor in embodiment 10, specific content are incorporated in this, are not repeated herein.

Wherein, memory 1302 can store above-mentioned fused data, can additionally store execute it is above-mentioned with merge set collection Relevant program.And the program is executed, under the control of processor 1303 to realize the collection of fusion tree.Furthermore the memory 1302 can be also used for storing the program stored such as the memory in embodiment 8 or embodiment 9 or embodiment 10.

According to the above-mentioned node of the present embodiment, the efficiency of fused data collection is improved by forward delay interval design, is passed through Active inquiry mechanism loses the risk of fused data to reduce.

Embodiment 13

The embodiment of the present invention 13 additionally provides the node in a kind of network, the principle and implementation solved the problems, such as due to the node The method of example 7 is similar, therefore its specific implementation is referred to the implementation of the method for embodiment 7, and overlaps will not be repeated.

Figure 12 is the node 1200 in a kind of multihop network, which includes the 7th transmission unit 1201, in which:

7th transmission unit 1201, sending in node to gateway or fusion tree father node includes more than one useful letter It include predetermined quantity by the way that the fused data is split into more than one data packet and each data packet when the fused data of breath The mode of useful information or the node are by retransmission scheme, by the fused data to gateway or to the father node of the node It sends；

Wherein, the adjustment that the quantity of the data packet after partition or the number of re-transmission can be adaptive according to link-quality. Such as node such as works as useful information according to the adaptive adjustment of the factors such as application scenarios, type of service, channel quality, packet size Bring load is larger, causes fused data packet larger, and when transmission reliability declines, the mode of partition may be selected；And when fusion When data packet includes that information is higher to integrity demands, retransmission scheme is may be selected in node, and if current ink quality is poor, Then can according to need by fused data packet be split into the transmission of more multiple fused data packets or node disjoint repeat to send it is more multiple Fused data packet；When link-quality is preferable, then fused data packet relatively can be split into less a fused data packet and passed Defeated or node disjoint repeats to send less secondary fused data packet.

Wherein, the node of the present embodiment can also include the content as described in embodiment 8 or embodiment 9 or embodiment 10, For constructing fusion tree, content is merged and this, and details are not described herein again.

Wherein, the node of the present embodiment can also include the content as described in embodiment 11 or embodiment 12, for collecting Fused data, content is merged and this, and details are not described herein again.

It can refer to attached drawing 13 below to illustrate the composition of the node of the present embodiment.It is no longer superfluous with the something in common of embodiment 8 It states, the present embodiment and the difference of embodiment 8 is illustrated below.Its with embodiment 8 the difference is that, the processing Device 1303 is configurable for the transmission of fused data, and in addition the processor can also be configured to realize embodiment 8 simultaneously Or the function of embodiment 9 or embodiment 10 and embodiment 11 or the processor in embodiment 12, specific content are incorporated in This, is not repeated herein.

Wherein, memory 1302 can store above-mentioned fused data, can additionally store execute it is above-mentioned with merge set transmission Relevant program.And the program is executed, under the control of processor 1303 to realize the transmission of fusion tree.Furthermore the memory 1302 can be also used for storing the memory as in embodiment 8 or embodiment 9 or embodiment 10 and embodiment 11 or embodiment 12 The program of storage.

According to the above-mentioned node of the present embodiment it is found that improving fused data result by autonomous optional repeatedly sending strategy The reliability of report.

The embodiment of the present invention also provides a kind of computer-readable program, wherein when executing described program in node, institute Stating program executes computer in the node as described in example 1 above or embodiment 2 or embodiment 3 or embodiment 4 Fusion tree constructing method.

The embodiment of the present invention also provides a kind of storage medium for being stored with computer-readable program, wherein the computer can Reader makes computer execute example 1 above or embodiment 2 or embodiment 3 or fusion as described in example 4 in node Tree constructing method.

The embodiment of the present invention also provides a kind of computer-readable program, wherein when executing described program in node, institute Stating program makes computer execute the fused data collection method as described in example 5 above or embodiment 6 in the node.

The embodiment of the present invention also provides a kind of storage medium for being stored with computer-readable program, wherein the computer can Reader makes computer execute fused data collection method described in example 5 above or embodiment 6 in node.

The embodiment of the present invention also provides a kind of computer-readable program, wherein when executing described program in node, institute Stating program makes computer execute the fused data transmission method as described in example 7 above in the node.

The embodiment of the present invention also provides a kind of storage medium for being stored with computer-readable program, wherein the computer can Reader makes computer execute fused data transmission method described in example 7 above in node.

The preferred embodiment of the present invention is described above by reference to attached drawing.The many features and advantage root of these embodiments According to the detailed description be clearly, therefore appended claims be intended to cover these embodiments fall into its true spirit With all these feature and advantage in range.Further, since those skilled in the art is readily apparent that many modifications and changes, Therefore it is not meant to for embodiments of the present invention to be limited to illustrated and description precision architecture and operation, but can cover and fall into All suitable modifications and equivalent within the scope of its.

It should be appreciated that each section of the invention can be realized with hardware, software, firmware or their combination.Upper It states in embodiment, multiple steps or method can be executed soft in memory and by suitable instruction execution system with storage Part or firmware are realized.For example, in another embodiment, can be known altogether with this field if realized with hardware Any one of following technology or their combination realize: there is the logic for realizing logic function to data-signal The discrete logic of gate circuit, the specific integrated circuit with suitable combinational logic gate circuit, programmable gate array (PGA), field programmable gate array (FPGA) etc..

About the embodiment for including above multiple embodiments, following note is also disclosed.

Note 1, a kind of construction method of fusion tree, which comprises

Node broadcasts achievement request message, wherein the business that the achievement request message includes root node generation business is wanted Element, service identification, irrelevant node hop count threshold value and root node mark or root node mark and sending node mark.

It is attached 2, according to the method described in claim 1, wherein, which comprises

The node receives the achievement request message of broadcast；

When the node meets the business factor, fusion tree is added in the node；

The business factor is unsatisfactory in the node, and when irrelevant node hop count threshold value is greater than 0, the node is added Fusion tree.

Note 3, the method according to note 2, wherein the method also includes:

The node receives the achievement request message of broadcast, and the achievement request message or the node is forwarded to exist First predetermined time forwarded achievement request message after reaching.

Note 4, the method according to note 2, wherein the achievement request message further include: fusion tree is deep-controlled Threshold value；Then before fusion tree is added in the node, the method also includes:

Judge that the fusion sets whether deep-controlled threshold value is more than or equal to 0；

When judging result is that the fusion sets deep-controlled threshold value more than or equal to 0, fusion tree is added.

It is attached 5, method according to the attached note 4, wherein when the fusion sets deep-controlled threshold value and is equal to 0, do not forward The achievement request message；

When the fusion sets deep-controlled threshold value and is greater than 0, the method also includes building described in the node broadcasts forwarding Request message is set, and deep-controlled threshold value is set into the fusion and subtracts 1.

Note 6, the method according to note 2, wherein after the node receives the achievement request message of broadcast, The method also includes:

Judge whether received to come from identical root node according to fusion root vertex mark and service identification The achievement request message of identical services；

When the judgment result is No, further judge whether the node meets the business factor；

When the judgment result is yes, without any processing.

It is attached 7, according to method described in note 3, wherein after the node forwards achievement request message, the method Further include:

Within the second predetermined time, if receiving the achievement request message of the identical services from identical root node, no Make any processing；After second predetermined time, deleted in the achievement request message from fusion tree list The root node mark or root node mark and sending node mark and the service identification.

It is attached 8, a kind of fused data collection method, which comprises

Node be added fusion tree and after the third predetermined time, the node to its father node send data or The fused data of person, the fused data refer to, and the node data is inscribed in the third predetermined time The data that the data of the child node for the node received obtain after being merged；

Wherein, the hop count that the third predetermined time merges root vertex with described in the nodal distance is inversely proportional.

It is attached 9, according to method described in note 8, wherein before the third predetermined time reaches, the method is also Include:

The node sends the first inquiry message to its child node；

If after not receiving the child node data replied by the child node of inquiry or child node fusion Data when, the node sends the first inquiry message again；Alternatively, the method also includes:

The node receives the second inquiry message that the father node of the node is sent；

When the node is by inquiry node, the father node of Xiang Suoshu node replys the node data or institute State the fused data of node.

It is attached 10, according to method described in note 9, wherein

When reaching for four predetermined times, the node sends the first inquiry message to its child node, and the described 4th is predetermined Time is less than the third predetermined time；

If do not received in predetermined hello interval by inquiry child node reply the child node data or When the fused data of the child node, the node sends the first inquiry message again.

It is attached 11, according to method described in note 3, wherein the described method includes:

The node receives the data that the child node of the node reports in the third preset time；The wherein section The data that the child node of point reports include: the child node data of the node or the child node data of the node The data obtained after being merged with the data that the child node of the child node of the node reports.

It is attached 12, a kind of fused data transmission method, which comprises

It is sent when including the fused data of more than one useful information in node to gateway or fusion tree father node, it is described Node is by being split into more than one data packet and useful information of each data packet comprising predetermined quantity for the fused data Mode or the node by retransmission scheme, the fused data is sent out to gateway or to the father node of the node It send；

Wherein, the quantity of the data packet after partition or the adjustment adaptive according to link-quality of the number of re-transmission.

Note 13, the node in a kind of network, wherein the node includes:

First radio unit, the first establishing unit is for broadcasting achievement request message, wherein achievement request disappears Breath comprising root node generate the business factor of business, service identification, irrelevant node hop count threshold value and root node mark or Root node mark and sending node mark.

Note 14, the node according to note 13, wherein the node includes:

First receiving unit, first receiving unit are used to receive the achievement request message of broadcast；

First processing units, the first processing units are used for when the node meets the business factor, will be described Fusion tree is added in node；Or the business factor is unsatisfactory in the node, and when irrelevant node hop count threshold value is greater than 0, Fusion tree is added in the node.

Note 15, the node according to note 14, wherein the node further include:

First retransmission unit, first retransmission unit is for forwarding the achievement request message or for first Predetermined time forwards achievement request message after reaching；

Wherein, the business factor is unsatisfactory in the node, and when irrelevant node hop count threshold value is greater than 0, described the One processing unit is also used to subtract 1 for the irrelevant node hop count threshold value；

First storage unit, first storage unit be used for by the root node identify or the root node mark and Sending node mark and the service identification are stored in fusion tree list；

Wherein, the achievement request message further include: deep-controlled threshold value is set in fusion；

And the first processing units are also used to meet the business factor and fusion tree depth in the node When control threshold is more than or equal to 0, fusion tree is added in the node；Or it is unsatisfactory for the business factor in the node, it is non- The node is added and merges greater than 0 and when the fusion sets deep-controlled threshold value more than or equal to 0 by interdependent node hop count threshold value Tree；

And first retransmission unit is set when deep-controlled threshold value is equal to 0 in the fusion does not forward the achievement to request Message；

Wherein, when the fusion sets deep-controlled threshold value and is greater than 0, the first processing units are also used to the fusion It sets deep-controlled threshold value and subtracts 1.

Note 16, the node according to note 15, wherein the node further include:

First judging unit, first judging unit in the achievement that first receiving unit receives broadcast for asking After seeking message, judge whether received to come from identical root node according to fusion root vertex mark and service identification The achievement request message of identical services；

And the first processing units are no in the judging result of first judging unit, and the node meets institute When stating business factor, fusion tree is added in the node；Or first judging unit judging result be no, the section Point is unsatisfactory for the business factor, and when irrelevant node hop count threshold value is greater than 0, fusion tree is added in the node；

The node further include:

The second processing unit, described the second processing unit are used to forward the achievement request to disappear in first retransmission unit After breath, when receiving the achievement request message of the identical services from identical root node within the second predetermined time, do not make any Processing；After second predetermined time, described in the achievement request message is deleted from the fusion tree list Node identification or root node mark and sending node mark and the service identification.

Note 17, the node in a kind of network, wherein the node includes:

First transmission unit, first transmission unit are used to that fusion tree to be added in the node and pass through the pre- timing of third Between after, send data or fused data to its father node, the fused data refer to by the node from The data that body data obtain after being merged with the data of the child node of the node received within the third predetermined time；

Wherein the third predetermined time is inversely proportional with the hop count that the nodal distance merges root vertex.

It is attached 18, according to node as stated in Note 17, wherein the node further include:

Second transmission unit, second transmission unit the third predetermined time reach before, Xiang Suoshu node Child node sends the first inquiry message；And do not receive by inquiry child node reply the child node data or When the fused data of child node described in person, the first inquiry message is sent again.

Second transmission unit is also used to when reaching for four predetermined times, and the child node of Xiang Suoshu node sends first Inquiry message；4th predetermined time is less than the third predetermined time；It does not receive in predetermined hello interval by inquiry Child node reply the child node data or the child node fused data when, send described first again Inquiry message；

Or the node further include:

Second receiving unit, the second inquiry that the father node that second receiving unit is used to receive the node is sent disappear Breath；

Third transmission unit, the third transmission unit are used for when the node is by inquiry node, Xiang Suoshu node Father node reply the node data or the fused data of the node.

Note 19, according to node as stated in Note 17, wherein the node includes:

Third receiving unit, the third receiving unit is for receiving the data that the child node of the node reports；Wherein The data that the child node of the node reports include: the node child node data or the node child node from The data that body data obtain after being merged with the data that the child node of the child node of the node reports.

Note 20, the node in a kind of network, wherein the node includes:

7th transmission unit, it includes one that the 7th transmission unit, which is sent in node to gateway or fusion tree father node, When the fused data of the above useful information, by the way that the fused data is split into more than one data packet and each data packet packet The mode of useful information containing predetermined quantity or the node by retransmission scheme, by the fused data to gateway or It is sent to the father node of the node；

Wherein, the quantity of the data packet after partition or the adjustment adaptive according to link-quality of the number of re-transmission.

Claims (9)

1. a kind of fused data transmission method, which comprises

Root node broadcast achievement request message, wherein business factor of the achievement request message comprising root node generation business, Deep-controlled threshold value and root node mark are set in service identification, irrelevant node hop count threshold value, fusion；

Intermediate node receives the achievement request message, meets the business in the achievement request message in the intermediate node and wants The institute for including when plain or in the business factor and the achievement request message being unsatisfactory in the achievement request message When stating irrelevant node hop count threshold value greater than zero, fusion tree is added in the intermediate node；

In the intermediate node addition fusion tree and after the third predetermined time, the intermediate node is sent out to its father node Send data or fused data, the fused data refer to by the intermediate node data with described The data that the data of the child node of the received intermediate node obtain after being merged in the third predetermined time；Wherein, described The third predetermined time is inversely proportional with the intermediate node apart from the hop count for merging root vertex；

Wherein, sending in father node of the intermediate node into gateway or the fusion tree includes more than one useful information Fused data when, the intermediate node is by will be split into one comprising the fused data of more than one useful information A above data packet and each data packet include that the mode of the useful information of predetermined quantity or the intermediate node pass through re-transmission Mode, by the fused data comprising more than one useful information to gateway or to the father node of the intermediate node It sends；

Wherein, according to the selection of application scenarios, type of service, channel quality or packet size adaptation by way of partition or re-transmission Mode sends the fused data comprising more than one useful information, the quantity of the data packet after partition or the number of re-transmission According to the adaptive adjustment of link-quality；

Wherein, before the third predetermined time reaches, the method also includes:

The intermediate node sends the first inquiry message to its child node；If not receiving described in the child node reply by inquiry When child node data or the fused data of the child node, the intermediate node sends first inquiry again and disappears Breath；

Alternatively, the intermediate node receives the second inquiry message that the father node of the intermediate node is sent；In the middle node When point is by inquiry node, the father node of Xiang Suoshu intermediate node replys the intermediate node data or the middle node The fused data of point.

2. according to the method described in claim 1, wherein, the method also includes:

The intermediate node forwards the achievement request message.

3. according to the method described in claim 1, wherein, the method also includes:

The intermediate node forwards the achievement request message after the first predetermined time reached.

4. according to the method in claim 2 or 3, wherein after the intermediate node forwards the achievement request message, institute State method further include:

Within the second predetermined time, if receiving the achievement request message of the identical services from identical root node, do not appoint Where reason；After second predetermined time, set from the fusion described in being deleted in the achievement request message in list Root node mark and service identification.

5. according to the method described in claim 1, wherein, the method also includes:

The intermediate node receives the data that the child node of the intermediate node reports in the third preset time；Wherein institute State the child node data or the intermediate node that the data that the child node of intermediate node reports include: the intermediate node Child node data merged with the data that the child node of the child node of the intermediate node reports after the data that obtain.

6. a kind of multihop network, wherein the multihop network includes: root node and intermediate node；

The root node includes:

First radio unit, first radio unit is for broadcasting achievement request message, wherein the achievement request message packet Generate the business factor of business containing root node, deep-controlled threshold value is set in service identification, irrelevant node hop count threshold value, fusion, with And root node mark；

The intermediate node includes:

First receiving unit, first receiving unit are used to receive the achievement request message of broadcast；First processing units, it is described First processing units are used for when the intermediate node meets the business factor for including in the achievement request message, in described Fusion tree is added in intermediate node；Or the business factor in the achievement request message included is unsatisfactory in the intermediate node, and When the irrelevant node hop count threshold value for including in the achievement request message is greater than 0, fusion tree is added in the intermediate node；

First transmission unit, first transmission unit is used to that the fusion tree to be added in the intermediate node and process third is pre- After fixing time, send data or fused data to its father node, the fused data refer to will be described in Intermediate node data is merged with the data of the child node of the intermediate node received within the third predetermined time The data obtained afterwards；Wherein the third predetermined time and the intermediate node are apart from the hop count for merging root vertex at anti- Than；

7th transmission unit, father node of the 7th transmission unit in the intermediate node into gateway or the fusion tree It sends when including the fused data of more than one useful information, by by the fusion comprising more than one useful information Data afterwards are split into the mode of the useful information that more than one data packet and each data packet include predetermined quantity or described Intermediate node is by retransmission scheme, by the fused data comprising more than one useful information to gateway or to described The father node of intermediate node is sent；

Wherein, according to the selection of application scenarios, type of service, channel quality or packet size adaptation by way of partition or re-transmission Mode send it is described include more than one useful information fused data, the quantity of the data packet after partition or re-transmission The number adjustment adaptive according to link-quality；

Wherein, the intermediate node further include: the second transmission unit, or including the second receiving unit and third transmission unit；

Before the third predetermined time reaches, second transmission unit sends first to the child node of the intermediate node Inquiry message；And melted not receiving by the child node data of the child node reply of inquiry or the child node When data after conjunction, the first inquiry message is sent again；Alternatively,

Before the third predetermined time reaches, what the father node that second receiving unit receives the intermediate node was sent Second inquiry message；The third transmission unit is when the intermediate node is by inquiry node, the father of Xiang Suoshu intermediate node Intermediate node data described in node reverts back or the fused data of the intermediate node.

7. network according to claim 6, wherein the intermediate node further include:

First retransmission unit, first retransmission unit is for forwarding the achievement request message；Or for predetermined first Time forwards the achievement request message after reaching；

Wherein, it is unsatisfactory for the business factor in the achievement request message included in the intermediate node, and the achievement is requested When the irrelevant node hop count threshold value for including in message is greater than 0, the first processing units are also used to request to disappear by the achievement The irrelevant node hop count threshold value for including in breath subtracts 1；

First storage unit, first storage unit is used to identify the root node and the service identification is stored in and melts It closes in tree list.

8. network according to claim 7, wherein the intermediate node further include:

First judging unit, first judging unit are used to receive the achievement request message in first receiving unit Afterwards, the received mutually same trade to come from identical root node is judged whether with service identification according to the fusion root vertex mark The achievement request message of business；

And the first processing units are no in the judging result of first judging unit, and the intermediate node meets institute When stating the business factor for including in achievement request message, the fusion is added in the intermediate node and is set；Or described first The judging result of judging unit is no, the intermediate node is unsatisfactory for the business factor in the achievement request message included, and When the irrelevant node hop count threshold value for including in the achievement request message is greater than 0, the fusion is added in the intermediate node Tree；

The intermediate node further include: the second processing unit, described the second processing unit are used to turn in first retransmission unit After sending out achievement request message described, the achievement request of the identical services from identical root node is received within the second predetermined time When message, with no treatment；After second predetermined time, the achievement request is deleted from fusion tree list Root node mark and the service identification in message.

9. network according to claim 6, wherein the intermediate node further include:

Third receiving unit, the third receiving unit is for receiving the data that the child node of the intermediate node reports；Wherein The data that the child node of the intermediate node reports include: the intermediate node child node data or the middle node The number that the child node data of point obtains after being merged with the data that the child node of the child node of the intermediate node reports According to.