CN108462982A - A kind of method of data capture and device - Google Patents
A kind of method of data capture and device Download PDFInfo
- Publication number
- CN108462982A CN108462982A CN201710087564.7A CN201710087564A CN108462982A CN 108462982 A CN108462982 A CN 108462982A CN 201710087564 A CN201710087564 A CN 201710087564A CN 108462982 A CN108462982 A CN 108462982A
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- transmitted
- weight
- packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000013481 data capture Methods 0.000 title abstract 2
- 238000013480 data collection Methods 0.000 claims description 59
- 230000005540 biological transmission Effects 0.000 claims description 32
- 238000004364 calculation method Methods 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 12
- 238000004590 computer program Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 235000008694 Humulus lupulus Nutrition 0.000 description 3
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000008447 perception Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention discloses a kind of method of data capture and device, the method includes：When first node judgement second node does not fail, first node calculates the weighted value of itself corresponding each data to be transmitted packet；First node determines first object data packet according to the weighted value of itself corresponding each data to be transmitted packet；First node swaps the second target data packet of first object data packet and second node；First node encodes the second target data packet by way of incremental code so that the second target data packet is collected into the first node information of first node.
Description
Technical Field
The invention relates to the technical field of wireless sensor networks, in particular to a data collection method and device.
Background
The wireless sensor network is formed by a large number of sensor nodes deployed in a monitoring area in a self-organizing and multi-hop mode, and the sensor nodes monitor the monitoring area by collecting sensing data. The system has the advantages of low power consumption, low cost, easiness in deployment, no need of connection, no need of human attendance and the like, and is widely applied to the fields of environmental monitoring, forest fire prevention, military application and the like.
In wireless sensor networks, data collection protocols are primarily designed through routing techniques. In a data collection protocol relying on routing technology, a part of sensor nodes in a network need to have topology control information of the entire network and maintain it. Once a failed node is generated, the network topology changes, so that the designed data collection protocol is inefficient and energy-consuming. Therefore, network coding techniques are typically applied to wireless sensor network data collection protocols to improve data collection efficiency and reduce node power consumption. In particular, network coding techniques are channel coding and allocation techniques through incremental codes to increase the availability of data in the network.
In the existing data collection method based on the network coding technology, when the monitoring area of the wireless sensor network is too large, the source sensing data in the nodes which are closer to the sink node are easier to be collected by the sink node, that is, the probability that the sink node collects the source sensing data in the nodes which are closer to the sink node is higher; the source sensing data in the nodes far away from the sink node are not easy to be collected by the sink node, that is, the probability that the sink node collects the source sensing data in the nodes far away from the sink node is low.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
in the existing data collection method of the wireless sensor network, each node performs data packet exchange by using a mode of randomly selecting a data packet, so that the probability that a sink node collects source sensing data in a node close to the sink node is higher, and the probability that the sink node collects source sensing data in a node far from the sink node is lower. Therefore, data of nodes far away from the sink node in the wireless sensor network is difficult to collect, fairness of data packet transmission in the wireless sensor network cannot be guaranteed, and data collection efficiency of the wireless sensor network is low.
Disclosure of Invention
In order to solve the above technical problems, embodiments of the present invention are expected to provide a data collection method and apparatus, so as to solve the problem that data of a node far away from a sink node in a wireless sensor network is difficult to collect, thereby not only ensuring fairness of data packet transmission in the wireless sensor network, but also improving data collection efficiency of the wireless sensor network.
The technical scheme of the invention is realized as follows:
the embodiment of the invention provides a data collection method, which comprises the following steps:
when the first node judges that the second node is not invalid, the first node calculates the weight value of each corresponding data packet to be transmitted;
the first node determines a first target data packet according to the weight value of each data packet to be transmitted corresponding to the first node;
the first node exchanges the first target data packet with a second target data packet of a second node;
and the first node encodes the second target data packet in an incremental code mode, so that the second target data packet collects the first node information of the first node.
In the above embodiment, the method further comprises:
when the first node judges that the second node is invalid, the first node searches data packets to be transmitted containing the information of the second node in each corresponding data packet to be transmitted;
when the first node finds the data packet to be transmitted containing the second node information, the first node calculates the weight value of the data packet to be transmitted containing the second node information.
In the above embodiment, the calculating, by the first node, the weight value of each to-be-transmitted data packet corresponding to the first node includes:
the first node calculates the weight added value of each data packet to be transmitted corresponding to the first node;
and the first node calculates the weight value of each data packet to be transmitted corresponding to the first node according to the preset weight value and the weight added value of each data packet to be transmitted.
In the above embodiment, the calculating, by the first node, the weight added value of each to-be-transmitted data packet corresponding to the first node includes:
the first node acquires the maximum hop count corresponding to each data packet to be transmitted and the predetermined data collection round number;
and the first node calculates the weight increment value of each data packet to be transmitted according to the maximum hop count corresponding to each data packet to be transmitted and the data collection round number.
In the above embodiment, the determining, by the first node, the first target data packet according to the weight value of each data packet to be transmitted, which includes:
the first node calculates the transmission probability of each data packet to be transmitted according to the weight value of each data packet to be transmitted corresponding to the first node;
and the first node determines the first target data packet according to the transmission probability of each data packet to be transmitted corresponding to the first node.
An embodiment of the present invention further provides a data collection device, where the device includes: the device comprises a calculation unit, a determination unit, an exchange unit and a collection unit; wherein,
the computing unit is used for computing the weight value of each data packet to be transmitted corresponding to the first node when the first node judges that the second node is not invalid;
the determining unit is configured to determine a first target data packet according to a weight value of each to-be-transmitted data packet corresponding to the first node;
the switching unit is used for switching the first target data packet and a second target data packet of a second node;
the collecting unit is configured to encode the second target data packet by the first node in an incremental code manner, so that the second target data packet collects the first node information of the first node.
In the above embodiment, the apparatus further includes:
the searching unit is used for searching the data packets to be transmitted containing the information of the second node in each corresponding data packet to be transmitted when the first node judges that the second node is invalid;
the calculating unit is further configured to calculate a weight value of the data packet to be transmitted including the second node information when the first node finds the data packet to be transmitted including the second node information.
In the above embodiment, the calculating unit is specifically configured to calculate a weight added value of each to-be-transmitted data packet corresponding to the first node itself; and calculating the weight value of each data packet to be transmitted corresponding to the first node according to the preset weight value and the weight added value of each data packet to be transmitted.
In the above embodiment, the calculation unit includes: an acquisition subunit and a first calculation subunit; wherein,
the acquiring subunit is configured to acquire a maximum hop count and a predetermined data collection round number corresponding to each to-be-transmitted data packet corresponding to the first node itself;
and the first calculating subunit is used for calculating the weight added value of each data packet to be transmitted according to the maximum hop count corresponding to each data packet to be transmitted and the data collection round number.
In the above embodiment, the determining unit includes: a second calculating subunit and a determining subunit; wherein,
the second calculating subunit is configured to calculate, according to the weight value of each to-be-transmitted data packet corresponding to the first node itself, a transmission probability of each to-be-transmitted data packet;
the determining subunit is configured to determine the first target data packet according to the transmission probability of each to-be-transmitted data packet corresponding to the first node itself.
Therefore, in the technical scheme of the invention, when the first node judges that the second node is not failed, the first node calculates the weight value of each data packet to be transmitted corresponding to the first node, then the first node determines a first target data packet according to the weight value of each data packet to be transmitted corresponding to the first node, the first node exchanges the first target data packet with a second target data packet of the second node, and finally the first node encodes the second target data packet in an incremental code mode, so that the second target data packet collects the first node information of the first node. That is to say, in the technical solution of the present invention, the first node may determine the first target data packet according to the weight value of each corresponding data packet to be transmitted, and then exchange the first target data packet and the second target data packet, so that the second target data packet collects the first node information of the first node. In the prior art, both the first node and the second node determine the first target data packet and the second target data packet by randomly selecting the data packets, and then exchange the first target data packet and the second target data packet. Therefore, compared with the prior art, the data collection method and the data collection device provided by the embodiment of the invention solve the problem that data of nodes far away from the sink node in the wireless sensor network are difficult to collect, can ensure the fairness of data packet transmission in the wireless sensor network, and can improve the data collection efficiency of the wireless sensor network; in addition, the technical scheme of the embodiment of the invention is simple and convenient to realize, convenient to popularize and wider in application range.
Drawings
FIG. 1 is a schematic flow chart illustrating an implementation of a data collection method according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of an implementation method for a first node to calculate a weight value of each corresponding data packet to be transmitted in the embodiment of the present invention;
fig. 3 is a schematic flow chart of an implementation method for a first node to calculate a weight added value of each corresponding data packet to be transmitted in the embodiment of the present invention;
fig. 4 is a flowchart illustrating an implementation method for determining a first destination packet by a first node according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a first component of a data collection device according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a second component of the data collection device according to the embodiment of the present invention.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
Fig. 1 is a schematic flow chart illustrating an implementation of a data collection method according to an embodiment of the present invention. As shown in fig. 1, the data collection method may include the steps of:
step 101, when the first node judges that the second node is not invalid, the first node calculates the weight value of each data packet to be transmitted corresponding to the first node.
In an embodiment of the present invention, before the first node and the second node perform data collection, the first node needs to determine whether the second node fails. Specifically, the first node may send a communication request to the second node, and when the first node receives a communication response returned by the second node within a preset time period, it indicates that the first node and the second node are successfully communicated, and at this time, the first node determines that the second node is not failed; when the first node does not receive the communication response returned by the second node within the preset time period, the communication failure between the first node and the second node is indicated, and at the moment, the first node judges that the second node is invalid.
Specifically, in the specific embodiment of the present invention, when the first node determines that the second node is not failed, the first node calculates the weight value of each packet to be transmitted corresponding to the first node. Fig. 2 is a schematic flow chart of an implementation method for a first node to calculate a weight value of each corresponding data packet to be transmitted in the embodiment of the present invention. As shown in fig. 2, the method for calculating the weight value of each packet to be transmitted by the first node may include the following steps:
step 101a, the first node calculates the weight added value of each data packet to be transmitted corresponding to the first node.
In the specific embodiment of the present invention, when the first node calculates the weight added value of each packet to be transmitted corresponding to the first node, the second node that is successfully communicated with the first node also calculates the weight added value of each packet to be transmitted corresponding to the second node. The method for calculating the weight added value of each data packet to be transmitted corresponding to the first node and the second node is completely consistent.
In the specific embodiment of the present invention, when the first node calculates the weight value of each packet to be transmitted corresponding to the first node, the first node may first calculate the weight added value of each packet to be transmitted corresponding to the first node. Fig. 3 is a schematic flow chart of an implementation method for a first node to calculate a weight added value of each data packet to be transmitted corresponding to the first node in the embodiment of the present invention. As shown in fig. 3, the method for calculating the weight increase value of each to-be-transmitted data packet corresponding to the first node by the first node may include the following steps:
step 301, the first node obtains the maximum hop count and the predetermined data collection round number corresponding to each data packet to be transmitted corresponding to the first node.
In the specific embodiment of the present invention, each node may include C data packets; wherein C is a natural number of 1 or more. In C data packets included in each node, a first data packet in each node does not participate in data transmission between the node and other nodes, and specifically, the first data packet is used for storing source sensing data of each node; the second to C-th data packets may be used for data transmission between the node and other nodes, and specifically, the second to C-th data packets are to-be-transmitted data packets corresponding to each node.
Specifically, in the specific embodiment of the present invention, each data packet to be transmitted may be set as three parts, which are respectively: a set of data weights, encoded data, and weight values. The data weight set in each data packet to be transmitted is used for storing the node ID and the maximum hop count MAX corresponding to all the source sensing data carried in each data packet to be transmitted. For example, the data weight set Π of any data packet to be transmitted in the first node may be represented as: { a1，a2，…，anMAX }; wherein, anThe node IDs of all source sensing data carried by the first node are { a }, namely the node ID carried by the first node is1，a2，…，anSource-aware data in (j); MAX of any data packet to be transmitted in the first node represents the dataAnd the maximum hop count in the hop counts of the nodes corresponding to all the source sensing data carried in the packet.
Specifically, in the specific embodiment of the present invention, the time from the start of the wireless sensor network to the end of the data collection can be described by a round, the data collection process is completed by a plurality of rounds, and the number of rounds currently undergoing data collection can be obtained by the terminal of the wireless sensor network.
And step 302, the first node calculates the weight added value of each data packet to be transmitted according to the maximum hop count and the data collection round number corresponding to each data packet to be transmitted.
In a specific embodiment of the present invention, after the first node obtains the maximum hop count of each to-be-transmitted data packet corresponding to the first node and determines the current data collection round number, the first node may calculate the weight increase value of each to-be-transmitted data packet according to the maximum hop count of each to-be-transmitted data packet and the current data collection round number.
Specifically, in the specific embodiment of the present invention, when the first node calculates the weight value of each data packet to be transmitted, the corresponding calculation method needs to be determined according to the distance between the first node and the sink node compared by the second node. The second node may obtain the maximum hop count of each corresponding data packet to be transmitted and determine the current data collection round number through step 301. Therefore, the first node and the second node can compare the distance from the sink node, and then calculate the weight added value of each corresponding data packet to be transmitted according to the comparison result.
In the specific embodiment of the present invention, before calculating the weight added value of each corresponding data packet to be transmitted, the first node and the second node need to compare the distances from the first node to the sink node. Specifically, the first data packet of the first node includes the hop count of the first node, which represents the distance between the first node and the sink node, and the first data packet of the second node includes the hop count of the second node, which represents the distance between the second node and the sink node. Therefore, by comparing the hop count of the first data packet of the first node and the hop count of the second node, the node corresponding to the first data packet with the larger hop count can be determined to be a node farther away from the sink node; meanwhile, the corresponding node of the first data packet with the smaller hop count can be judged to be the node closer to the sink node.
In the specific embodiment of the present invention, after comparing the distances between the first node and the second node and the sink node, the weight added value of each to-be-transmitted data packet in the node may be calculated for the node farther from the sink node according to the first method. Specifically, for a node farther from the sink node, the weight increase value of each to-be-transmitted data packet in the node may be calculated according to the following formula:
wherein, the weight increment value delta theta of the jth data packet is selected from nodes far away from the aggregation node1，jComprises the following steps:
Δθ1，j＝ω1tαω2MAXβ
in the above formula, Δ θ1，jIncreasing the value of the weight of the jth data packet in the nodes far away from the aggregation node; omega1And α are predetermined constants used to adjust the influence of data collection rounds on the weight values2β is a predetermined constant used to adjust the influence of the MAX number of hops MAX in the data weight set on the weight values, and t is a predetermined number of data collection rounds.
In the specific embodiment of the present invention, after comparing the distances between the first node and the second node and the sink node, the weight added value of each to-be-transmitted data packet in the node may be calculated for the node closer to the sink node according to the second method. Specifically, for a node closer to the sink node, the weight increase value of each to-be-transmitted data packet in the node may be calculated according to the following formula:
wherein, the weight increment value of the jth data packet is selected from the nodes which are closer to the aggregation nodeΔθ1，jComprises the following steps:
Δθ1，j＝ω1tαω2/MAXβ
in the above formula, Δ θ1，jIncreasing the value of the weight of the jth data packet in the node close to the sink node; omega1And α are predetermined constants used to adjust the influence of data collection rounds on the weight values2β is a predetermined constant used to adjust the influence of the MAX number of hops MAX in the data weight set on the weight values, and t is a predetermined number of data collection rounds.
Preferably, in the embodiment of the present invention, when the first node determines that the second node is failed, the first node may search, according to a data weight set of each to-be-transmitted data packet corresponding to the first node, the to-be-transmitted data packet including the source sensing data of the second node in the first node, and by increasing the weight value of the to-be-transmitted data packet, the to-be-transmitted data packet can be selected to be transmitted with a higher probability when the first node performs data transmission with other nodes, so that the possibility that the source sensing data of the failed node is collected by the sink node is increased. For example, the jth data packet of the first node includes source sensing information of the second node, and the first node may calculate the weight increase value of the jth data packet in the first node as:
Δθ1，j＝ω1tαω2MAXβ+ω3f
in the above formula, ω1And α are predetermined constants used to adjust the influence of data collection rounds on the weight values2And β are predetermined constants for adjusting the influence of the maximum number of hops MAX in the data weight set on the weight values3F is a weight value which is predetermined and used for increasing the source perception data of the failure node; t is a predetermined number of data collection rounds.
And step 101b, the first node calculates the weight value of each data packet to be transmitted corresponding to the first node according to the preset weight value and the weight added value of each data packet to be transmitted.
In an embodiment of the present invention, the initial value of the weight value corresponding to each packet of the first node is a constant θ. According to step 201, the weight value of each data packet to be transmitted in the first node can be calculated, and thus, the weight value of the jth data packet in the first node can be calculated as:
θ1，j(t，MAX)＝Δθ1，j+θ
preferably, in an embodiment of the present invention, the second node may also calculate a weight value of each packet to be transmitted according to the above method.
According to the above analysis, through the steps 101a to 101b, when the first node determines that the second node is not failed, the first node and the second node may first calculate the weight added value of each corresponding data packet to be transmitted, and then sum the weight added value with the weight initial value to obtain the weight value of the data packet that better conforms to the actual data transmission condition in the network.
And 102, the first node determines a first target data packet according to the weight value of each data packet to be transmitted corresponding to the first node.
In an embodiment of the present invention, fig. 4 is a flowchart illustrating an implementation method for determining a first target packet by a first node in the embodiment of the present invention. As shown in fig. 4, the method for the first node to determine the first destination packet includes the following steps:
102a, the first node calculates the transmission probability of each data packet to be transmitted according to the weight value of each data packet to be transmitted corresponding to the first node.
In a specific embodiment of the present invention, after the first node calculates the weight value of each data packet to be transmitted corresponding to the first node, the first node may calculate the transmission probability of each data packet to be transmitted according to the weight value of each data packet to be transmitted corresponding to the first node. Specifically, the first node may calculate the transmission probability of each to-be-transmitted data packet according to the following formula:
in the above formula, P1，jThe transmission probability of the jth data packet in the first node is obtained; c is the number of all data packets in the first node; theta1，jThe weight value of the jth data packet in the first node.
Preferably, in an embodiment of the present invention, the second node may also calculate a transmission probability of each data packet to be transmitted according to the method.
And 102b, the first node determines a first target data packet according to the transmission probability of each data packet to be transmitted corresponding to the first node.
In a specific embodiment of the present invention, after the first node calculates the transmission probability of each data packet to be transmitted corresponding to the first node, the first node may determine a first target data packet according to the transmission probability of each data packet to be transmitted; similarly, the second node may determine the second target data packet according to the transmission probability of each data packet to be transmitted corresponding to the second node.
Specifically, in the specific embodiment of the present invention, after the first node calculates the transmission probability of each data packet to be transmitted corresponding to the first node, the first node may select, as the first target data packet, the data packet to be transmitted with the maximum transmission probability from each data packet to be transmitted corresponding to the first node. After the second node calculates the transmission probability of each data packet to be transmitted corresponding to the second node, the second node may select the data packet to be transmitted with the maximum transmission probability from the data packets to be transmitted corresponding to the second node as the second target data packet.
Step 103, the first node exchanges the first target data packet with the second target data packet of the second node.
In a specific embodiment of the present invention, a first node may determine a first target data packet in each data packet to be transmitted, a second node may determine a second target data packet in each data packet to be transmitted, and exchange the first target data packet of the first node and the second target data packet of the second node, so that the first node includes the second target data packet and the second node includes the first target data packet.
And 104, the first node encodes the second target data packet in an incremental code mode, so that the second target data packet collects the first node information of the first node.
In a specific embodiment of the present invention, after a first target data packet of a first node and a second target data packet of a second node are exchanged, the first node encodes the second target data packet exchanged to the first node by using an encoding method of an incremental code, so that the second target data packet collects source sensing data and an ID of the first node.
Specifically, when a first packet of the first node is encoded with a second destination packet switched into the first node, the second destination packet collects source sensing data of the first node stored in the first packet of the first node. If the ID of the first node is not contained in the data weight set of the second target data packet, the ID of the first node is added into the data weight set of the second target data packet, the hop count in the first data packet of the first node is compared with the maximum hop count in the data weight set of the second target data packet, and the larger hop count is used as the new maximum hop count of the second target data packet.
Preferably, when the first packet of the second node is encoded with the first destination packet switched into the second node, the first destination packet collects the source sensing data of the second node stored in the first packet of the second node. If the data weight set of the first target data packet does not contain the ID of the second node, the ID of the second node is added into the data weight set of the first target data packet, the hop count in the first data packet of the second node is compared with the maximum hop count in the data weight set of the first target data packet, and the larger hop count is used as the new maximum hop count of the first target data packet.
In the specific embodiment of the invention, the whole wireless sensor network carries out data collection by the method, and finally each data packet can obtain the node information of a plurality of different nodes, so that the sink node can collect the source perception data of each node in the network more quickly and effectively in the data collection process.
In the data collection method provided by the embodiment of the present invention, when the first node determines that the second node is not failed, the first node calculates a weight value of each corresponding to-be-transmitted data packet, then the first node determines a first target data packet according to the weight value of each corresponding to-be-transmitted data packet, the first node exchanges the first target data packet with a second target data packet of the second node, and finally the first node encodes the second target data packet in an incremental code manner, so that the second target data packet collects first node information of the first node. That is to say, in the technical solution of the present invention, the first node may determine the first target data packet according to the weight value of each corresponding data packet to be transmitted, and then exchange the first target data packet and the second target data packet, so that the second target data packet collects the first node information of the first node. In the prior art, both the first node and the second node determine the first target data packet and the second target data packet by randomly selecting the data packets, and then exchange the first target data packet and the second target data packet. Therefore, compared with the prior art, the data collection method provided by the embodiment of the invention solves the problem that data of the nodes far away from the sink node in the wireless sensor network is difficult to collect, can ensure the fairness of data packet transmission in the wireless sensor network, and can improve the data collection efficiency of the wireless sensor network; in addition, the technical scheme of the embodiment of the invention is simple and convenient to realize, convenient to popularize and wider in application range.
FIG. 5 is a schematic diagram of a first component of a data collection device according to an embodiment of the present invention. As shown in fig. 5, the apparatus includes: the device comprises a calculation unit, a determination unit, an exchange unit and a collection unit; wherein,
the calculating unit 501 is configured to calculate a weight value of each to-be-transmitted data packet corresponding to a first node when the first node determines that the second node is not failed;
the determining unit 502 is configured to determine a first target data packet according to a weight value of each to-be-transmitted data packet corresponding to the first node;
the switching unit 503 is configured to switch the first destination packet and a second destination packet of a second node;
the collecting unit 504 is configured to encode, by the first node, the second target data packet in an incremental code manner, so that the second target data packet collects the first node information of the first node.
Further, the apparatus further comprises:
a searching unit 505, configured to search, when the first node determines that the second node is invalid, a to-be-transmitted data packet that includes the second node information in each to-be-transmitted data packet corresponding to the first node;
the calculating unit 501 is further configured to calculate a weight value of the to-be-transmitted data packet including the second node information when the first node finds the to-be-transmitted data packet including the second node information.
Further, the calculating unit 501 is specifically configured to calculate a weight added value of each to-be-transmitted data packet corresponding to the first node; and calculating the weight value of each data packet to be transmitted corresponding to the first node according to the preset weight value and the weight added value of each data packet to be transmitted.
Fig. 6 is a schematic diagram of a second component structure of a data collection node according to an embodiment of the present invention. As shown in fig. 6, the calculation unit 501 includes: the acquisition subunit 5011 and the first calculation subunit 5012; wherein:
the obtaining subunit 5011 is configured to obtain a maximum hop count and a predetermined data collection round number corresponding to each to-be-transmitted data packet corresponding to the first node itself;
the first calculating subunit 5012 is configured to calculate a weight added value of each to-be-transmitted data packet according to the maximum hop count corresponding to each to-be-transmitted data packet and the data collection round number.
Further, the determining unit 502 includes: a second calculation subunit 5021 and a determination subunit 5022;
the second calculating subunit 5021 is configured to calculate a transmission probability of each to-be-transmitted data packet according to a weight value of each to-be-transmitted data packet corresponding to the first node;
the determining subunit 5022 is configured to determine the first target data packet according to the transmission probability of each data packet to be transmitted corresponding to the first node itself.
In practical applications, the calculating unit 501, the determining unit 502, the exchanging unit 503, the collecting unit 504, and the searching unit 505 may be implemented by a Central Processing Unit (CPU), a Microprocessor (MPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), or the like of the first node and the second node.
In the data collection device provided in the embodiment of the present invention, when the first node determines that the second node is not failed, the first node calculates a weight value of each corresponding to-be-transmitted data packet, then the first node determines a first destination data packet according to the weight value of each corresponding to-be-transmitted data packet, the first node exchanges the first destination data packet with a second destination data packet of the second node, and finally the first node encodes the second destination data packet in an incremental code manner, so that the second destination data packet collects first node information of the first node. That is to say, in the technical solution of the present invention, the first node may determine the first target data packet according to the weight value of each corresponding data packet to be transmitted, and then exchange the first target data packet and the second target data packet, so that the second target data packet collects the first node information of the first node. In the prior art, both the first node and the second node determine the first target data packet and the second target data packet by randomly selecting the data packets, and then exchange the first target data packet and the second target data packet. Therefore, compared with the prior art, the data collection device provided by the embodiment of the invention solves the problem that data of nodes far away from the sink node in the wireless sensor network is difficult to collect, can ensure the fairness of data packet transmission in the wireless sensor network, and can improve the data collection efficiency of the wireless sensor network; in addition, the technical scheme of the embodiment of the invention is simple and convenient to realize, convenient to popularize and wider in application range.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.
Claims (10)
1. A method of data collection, the method comprising:
when the first node judges that the second node is not invalid, the first node calculates the weight value of each corresponding data packet to be transmitted;
the first node determines a first target data packet according to the weight value of each data packet to be transmitted corresponding to the first node;
the first node exchanges the first target data packet with a second target data packet of a second node;
and the first node encodes the second target data packet in an incremental code mode, so that the second target data packet collects the first node information of the first node.
2. The method of claim 1, further comprising:
when the first node judges that the second node is invalid, the first node searches data packets to be transmitted containing the information of the second node in each corresponding data packet to be transmitted;
when the first node finds the data packet to be transmitted containing the second node information, the first node calculates the weight value of the data packet to be transmitted containing the second node information.
3. The method according to claim 1, wherein the calculating, by the first node, the weight value of each packet to be transmitted corresponding to the first node comprises:
the first node calculates the weight added value of each data packet to be transmitted corresponding to the first node;
and the first node calculates the weight value of each data packet to be transmitted corresponding to the first node according to the preset weight value and the weight added value of each data packet to be transmitted.
4. The method of claim 3, wherein the calculating, by the first node, the weight increase value of each packet to be transmitted corresponding to the first node comprises:
the first node acquires the maximum hop count corresponding to each data packet to be transmitted and the predetermined data collection round number;
and the first node calculates the weight increment value of each data packet to be transmitted according to the maximum hop count corresponding to each data packet to be transmitted and the data collection round number.
5. The method according to claim 1, wherein the determining, by the first node, the first target packet according to the weight value of each packet to be transmitted, includes:
the first node calculates the transmission probability of each data packet to be transmitted according to the weight value of each data packet to be transmitted corresponding to the first node;
and the first node determines the first target data packet according to the transmission probability of each data packet to be transmitted corresponding to the first node.
6. A data collection device, the device comprising: the device comprises a calculation unit, a determination unit, an exchange unit and a collection unit; wherein,
the computing unit is used for computing the weight value of each data packet to be transmitted corresponding to the first node when the first node judges that the second node is not invalid;
the determining unit is configured to determine a first target data packet according to a weight value of each to-be-transmitted data packet corresponding to the first node;
the switching unit is used for switching the first target data packet and a second target data packet of a second node;
the collecting unit is configured to encode the second target data packet by the first node in an incremental code manner, so that the second target data packet collects the first node information of the first node.
7. The apparatus of claim 6, further comprising:
the searching unit is used for searching the data packets to be transmitted containing the information of the second node in each corresponding data packet to be transmitted when the first node judges that the second node is invalid;
the calculating unit is further configured to calculate a weight value of the data packet to be transmitted including the second node information when the first node finds the data packet to be transmitted including the second node information.
8. The apparatus according to claim 6, wherein the computing unit is specifically configured to compute a weight added value of each to-be-transmitted data packet corresponding to the first node itself; and calculating the weight value of each data packet to be transmitted corresponding to the first node according to the preset weight value and the weight added value of each data packet to be transmitted.
9. The apparatus of claim 8, wherein the computing unit comprises: an acquisition subunit and a first calculation subunit; wherein,
the acquiring subunit is configured to acquire a maximum hop count and a predetermined data collection round number corresponding to each to-be-transmitted data packet corresponding to the first node itself;
and the first calculating subunit is used for calculating the weight added value of each data packet to be transmitted according to the maximum hop count corresponding to each data packet to be transmitted and the data collection round number.
10. The apparatus of claim 6, wherein the determining unit comprises: a second calculating subunit and a determining subunit; wherein,
the second calculating subunit is configured to calculate, according to the weight value of each to-be-transmitted data packet corresponding to the first node itself, a transmission probability of each to-be-transmitted data packet;
the determining subunit is configured to determine the first target data packet according to the transmission probability of each to-be-transmitted data packet corresponding to the first node itself.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710087564.7A CN108462982B (en) | 2017-02-17 | 2017-02-17 | Data collection method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710087564.7A CN108462982B (en) | 2017-02-17 | 2017-02-17 | Data collection method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108462982A true CN108462982A (en) | 2018-08-28 |
| CN108462982B CN108462982B (en) | 2020-09-08 |
Family
ID=63228826
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710087564.7A Active CN108462982B (en) | 2017-02-17 | 2017-02-17 | Data collection method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108462982B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007251811A (en) * | 2006-03-17 | 2007-09-27 | Toyota Infotechnology Center Co Ltd | Radio communication apparatus, radio communication method, and method of creating route information table |
| CN101159697A (en) * | 2007-11-23 | 2008-04-09 | 南京大学 | Method of implementing least energy consumption routing under time delay limitation in wireless sensor network |
| CN101610562A (en) * | 2009-07-14 | 2009-12-23 | 中控科技集团有限公司 | The method for routing of wireless sensor network, wireless sensor node and system |
| CN101835233A (en) * | 2010-03-19 | 2010-09-15 | 浙江大学 | Wireless sensor network oriented random route selecting method |
| US20110176416A1 (en) * | 2009-06-30 | 2011-07-21 | Bhatti Ghulam M | Method for Discovering Multiple Routes in Sensor Networks |
| CN103298056A (en) * | 2013-05-14 | 2013-09-11 | 华南师范大学 | Wireless routing protocol method |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
| CN104581817A (en) * | 2014-12-19 | 2015-04-29 | 中国科学院上海微系统与信息技术研究所 | Dynamic shortest path weighting routing method in mobile ad-hoc network |
| CN104685931A (en) * | 2012-07-05 | 2015-06-03 | Abb研究有限公司 | Determination of communication routes in a wireless communication network |
-
2017
- 2017-02-17 CN CN201710087564.7A patent/CN108462982B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007251811A (en) * | 2006-03-17 | 2007-09-27 | Toyota Infotechnology Center Co Ltd | Radio communication apparatus, radio communication method, and method of creating route information table |
| CN101159697A (en) * | 2007-11-23 | 2008-04-09 | 南京大学 | Method of implementing least energy consumption routing under time delay limitation in wireless sensor network |
| US20110176416A1 (en) * | 2009-06-30 | 2011-07-21 | Bhatti Ghulam M | Method for Discovering Multiple Routes in Sensor Networks |
| CN101610562A (en) * | 2009-07-14 | 2009-12-23 | 中控科技集团有限公司 | The method for routing of wireless sensor network, wireless sensor node and system |
| CN101835233A (en) * | 2010-03-19 | 2010-09-15 | 浙江大学 | Wireless sensor network oriented random route selecting method |
| CN104685931A (en) * | 2012-07-05 | 2015-06-03 | Abb研究有限公司 | Determination of communication routes in a wireless communication network |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
| CN103298056A (en) * | 2013-05-14 | 2013-09-11 | 华南师范大学 | Wireless routing protocol method |
| CN104581817A (en) * | 2014-12-19 | 2015-04-29 | 中国科学院上海微系统与信息技术研究所 | Dynamic shortest path weighting routing method in mobile ad-hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108462982B (en) | 2020-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kim et al. | Flush: a reliable bulk transport protocol for multihop wireless networks | |
| CN107466079B (en) | Automatic relay switching method and device | |
| US20200145917A1 (en) | Wireless sensing network communication method | |
| CN108293068A (en) | Such as internet of things equipment（IoT）The measurement exchange network of equipment | |
| JP7410145B2 (en) | System and method for neighbor node discovery in a network | |
| US11843412B2 (en) | Electronic device for performing ranging by using ultra wide band communication and operating method thereof | |
| EP3254410A1 (en) | A method and system for selecting communication parameters in a wireless network | |
| CN109219942A (en) | Massage pattern control | |
| CN107370779B (en) | Data transmission method, device and system | |
| CN106954246A (en) | A kind of cloud application smart home with domestic electric network intelligent control function | |
| CN111930599A (en) | Operation and maintenance data processing method and device of cloud service system and storage medium | |
| CN105721612A (en) | Data transmission method and device | |
| CN108462982B (en) | Data collection method and device | |
| CN109640285A (en) | Big data searching method and device based on mobile terminal | |
| CN103595552B (en) | Analysis method and analysis system for cluster storage network parallel load | |
| CN109561482A (en) | A kind of data capture method, data acquisition facility and intelligent terminal | |
| JP2011142439A (en) | Data collection system and data collection server thereof | |
| CN112836089B (en) | Method and device for confirming motion trail, storage medium and electronic device | |
| CN104066072A (en) | Method for determining father modes of new nodes about to have access to network | |
| US9775069B1 (en) | System for configuring distributed audio output using a designated audio device | |
| CN105812087A (en) | Method and device for transmitting data in wireless communication network | |
| CN107770751A (en) | A kind of smart home environment monitoring system | |
| WO2020188937A1 (en) | Information processing device, data collection system, communication setting method, and computer-readable medium in which program is stored | |
| Burgstahler et al. | Probsense. kom: A probabilistic sensing approach for gathering vehicular sensed data | |
| CN116366709B (en) | Connection scheduling method and system for data transmission |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 310012 building A01, 1600 yuhangtang Road, Wuchang Street, Yuhang District, Hangzhou City, Zhejiang Province Applicant after: CHINA MOBILE (HANGZHOU) INFORMATION TECHNOLOGY Co.,Ltd. Applicant after: China Mobile Communications Corp. Address before: 310012, No. 14, building three, Chang Torch Hotel, No. 259, Wensanlu Road, Xihu District, Zhejiang, Hangzhou Applicant before: CHINA MOBILE (HANGZHOU) INFORMATION TECHNOLOGY Co.,Ltd. Applicant before: China Mobile Communications Corp. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |