CN113573270B - Method for reliably collecting partial area of trigger data under large-scale network - Google Patents
Method for reliably collecting partial area of trigger data under large-scale network Download PDFInfo
- Publication number
- CN113573270B CN113573270B CN202110772010.7A CN202110772010A CN113573270B CN 113573270 B CN113573270 B CN 113573270B CN 202110772010 A CN202110772010 A CN 202110772010A CN 113573270 B CN113573270 B CN 113573270B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- source
- packet
- nodes
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000005295 random walk Methods 0.000 claims abstract description 23
- 230000002093 peripheral effect Effects 0.000 claims abstract description 4
- 238000004364 calculation method Methods 0.000 claims description 39
- 238000012544 monitoring process Methods 0.000 claims description 8
- 230000000737 periodic effect Effects 0.000 claims description 7
- 238000013500 data storage Methods 0.000 claims description 5
- 230000005540 biological transmission Effects 0.000 claims description 3
- 230000000644 propagated effect Effects 0.000 claims description 3
- 238000013480 data collection Methods 0.000 abstract description 9
- 238000011084 recovery Methods 0.000 abstract description 3
- 230000003993 interaction Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- 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)
- Multimedia (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for reliably collecting partial areas of trigger data under a large-scale network, which is characterized by comprising the following steps of: aiming at a large number of trigger type data collection scenes of a wireless sensor network, a mode of firstly distributing collected source data to peripheral network nodes and then sending a certain number of random walk packets to code and store the source data is provided, so that the problem of reliable collection of partial areas of the trigger type data under the large-scale network can be effectively solved. And the optimal size of the dynamic dividing coding unit is dynamically calculated by utilizing the information interaction among the nodes in the network, so that the collection efficiency is improved while enough space is ensured to store the coding data. The encoding redundancy is dynamically adjusted by sensing the dangerous degree of the surrounding environment, so that the balance between reasonable utilization of the storage space and the reliability of the data is realized to a certain extent, and the recovery rate of the original data is improved.
Description
Technical Field
The invention relates to the field of wireless sensor network data collection, in particular to a method for reliably collecting partial areas of trigger data under a large-scale network.
Background
A wireless sensor network is a network formed by a large number of micro-nodes self-organizing with sensing, storing, computing and wireless communication functions. The wireless sensor network is often used for helping people to automatically collect data in a specific area, and has a particularly high application value in some scenes with severe environments. The wireless sensor network has the characteristics of flexible and convenient deployment, powerful functions and the like, and is widely applied to the scenes such as ecological environment monitoring, infrastructure monitoring, event positioning, target tracking, natural disaster monitoring and early warning, battlefield situation sensing and the like.
Network coding is one way in which data persistence and reliability can be improved. In a wireless sensor data collection scene with a severe environment, the network coding is utilized to reduce data loss caused by wireless sensor node failure, and the reliability of data is improved. The data collection mode based on network coding is mainly divided into two modes of real-time data collection and time delay data collection. The real-time data collection mode is represented by Groth Codes, the nodes in the wireless sensor network transmit the encoded data to the collection node through a single sink node in real time, and the collection node can decode the original data before encoding through the BP decoding mode after collecting all the data, and the mode focuses on the recovery efficiency of the data. Compared with the former, the method focuses on reliable storage of data, the method stores the data in a wireless sensor network through a network coding mode after the data is generated, and then the data enters the coded data in the collection node in the sensing area through a collector after a period of time, and then decoding recovery operation can be carried out.
However, in a large-scale wireless peer-to-peer sensing network scenario, the data collection of the sensor may not be periodic small data, but trigger large data, such as that the intelligent video sensor node starts to collect data after sensing that an object moves. I.e. either no data is generated for a long time or a large amount of data is generated suddenly. The conventional distributed encoding method encodes data between nodes, but since the data may be large and the size of the data generated by the nodes is different, the method is not suitable for the scene.
Furthermore, recovering data in a portion of the area from a large-scale wireless peer-to-peer aware network using conventional methods often requires collecting data in all nodes for decoding, which can cost unnecessary additional decoding costs. The previously proposed method still does not flexibly specify a subset of the source nodes that it is interested in and re-retrieves the corresponding partial data. For example, sensors are deployed on a large battlefield for battlefield situational awareness to specify a combat plan, so only data collected by source nodes within a target area need be collected.
Disclosure of Invention
The invention aims to provide a method for reliably collecting partial areas of trigger data under a large-scale network, which aims to solve the problems that the decoding cost is high, a subset of interested source nodes cannot be flexibly designated, corresponding partial data can be restored, and the like.
In order to solve the problems, the invention adopts the following technical scheme:
the invention relates to a method for reliably collecting partial areas of trigger data under a large-scale network, which comprises the following steps:
(1) Randomly dispersing a plurality of wireless sensors in a monitoring area, wherein each wireless sensor corresponds to one node;
(2) Each node sends periodic broadcast packets to each other to establish neighbors, and each node periodically announces node information to the neighbors;
(3) When a node senses an acquisition signal, the node serves as a source node N i Collecting multiple source dataCalculating the size of a coding unit and the coding redundancy according to the received node information of the neighbor advertisement, and enabling a source node N to i Source data +.>Coding unit size and maximum hop count L propagated by broadcast M Storing the source data packet;
(4) Source node N i Broadcast transmission of source packets to surrounding nodes, followed by source node N i Transmitting a plurality of unicast random walk packets to random neighbors;
(5) When a certain node N k After receiving the broadcast source data packet, if the node N k Is not locally provided with this source dataThen the node N k Storing source data in a data temporary area, if the node N k Is local to this source data->Discarding the source data packet; at the same time, node N k Viewing the remaining hop count L of a broadcast M If the remaining hop count L M Not 0 to make the remaining hop count L M Subtracting 1, and continuing broadcasting the source data packet, otherwise, not forwarding;
(6) After receiving the random walk packet, the other nodes are according to whether the own node isIncluding the source dataAnd whether the remaining space of the encoded memory area is sufficient to store the random walk packet for encoding, forming encoded data and storing the encoded data locally, forwarding or discarding;
(7) The collection node enters the monitoring area to collect the coded data stored in the node, and the collected coded data is used for decoding.
Preferably, the node information periodically announced to the neighbors by each node in the step (2) includes: remaining storage space C of itself i Storage space growth rateI.e. the quotient of the coded memory space used by the node and the current time t, and the mean value M of the memory spaces of the neighbors of the node i The calculation formula is as follows:
in the formula, M i As the source node N i The mean value of the storage space of the surrounding area nodes,as the source node N i Set of neighbors around time t, +.>For the source node N at time t i The number of the neighbor nodes around, j is the number of the neighbor nodes of the source node, C j Remaining memory space for neighbor j, where M i It is necessary to store in memory to calculate the size of the coding unit, M is done at each periodic calculation i And updating.
Preferably, the coding unit in step (3)The calculation of the size of (a) comprises the steps of:
(3.1) Source node N i When sensing the acquisition signal, determining the minimum coding unit according to the storage state of the nearby nodes
(3.2) calculating an expected A of the data quantity required to be stored by surrounding nodes in the future, wherein the calculation formula is as follows:
in the formula, T c To assume a collection period of the collection node, t represents the source node N i The moment at which the signal is collected,for node N at time t i An average amount of increase in stored data for surrounding area nodes;
(3.3) reading the source node N from the local i Mean value M of storage space of surrounding area nodes i ；
(3.4) calculating the average remaining memory space around the neighborsThe calculation formula is as follows:
in the formula, j is the number of the neighbor node of the source node, M j The average value of the storage space of the neighboring nodes around the node with the number j;
(3.5) giving a minimum value K of a minimum coding unit min Maximum value K max ；
(3.6) calculating an initial calculation value H of the encoding unit, the calculation formula being:
in the formula, lambda is the adjustment M i And (3) withThe value range of the coefficient of the duty ratio is (0, 1);
(3.7) the final coding unit size is:
preferably, the coding redundancy amount epsilon in the step (3) is calculated in the following manner:
(3.8) statistics of source node N at various times i The number of neighbors is respectively
(3.9) calculating neighbor reductionThe calculation formula is as follows:
(3.10) calculating the mean value of the gradient decrease over the span of time range rRangeThe calculation formula is that
In the formula, s is different rollback time lengths;
(3.11) computing Source node N i Peripheral risk factorThe calculation formula is as follows:
in the formula, alpha is balanceAnd->The value range of the coefficient is (0, 1); θ is a risk degree adjustment coefficient, and the value range thereof is (0, 1)]；
(3.12) setting redundancy amountIs expressed as:
ε min epsilon is the minimum amount of redundancy max Is the maximum amount of redundancy;
(3.13) calculating a specific value of the redundancy amount, wherein the calculation formula is as follows:
preferably, the number of the random walk packets in the step (4) is the number of the coding units divided by the source data packetAnd coding redundancy amount->The specific calculation steps of the method comprise:
(4.1) calculating the coding units of the segmentNumber of digitsThe calculation formula is as follows:
in the formula (i),as the source node N i The total amount of data acquired at time t;
and (4.2) calculating the number P of the random walk data packets, wherein the calculation formula is as follows:
preferably, in the step (6), after receiving the random walk packet, the remaining nodes store, forward, or discard the code according to whether the self node includes the source data s_i ((t)) and whether the remaining space of the code storage area is sufficient to store the random walk packet, which includes the following steps:
(6.1) when the random walk data packet is received, if the local cache of the node does not have corresponding source data, selecting to forward or discard according to whether the walk data packet has residual step length; if the local cache has corresponding source data, entering the next step;
(6.2) judging whether the residual space of the coded data storage area of the node is enough to store the corresponding coded packet, if not, selecting to forward or discard according to the free packet and whether the free packet has residual step length; if the remaining space of the coded data storage area of the node is enough to store the corresponding coded packet, entering the next step;
(6.3) judging whether the code storage area of the node already contains the code packets of the batch, if not, randomly selecting a plurality of code units from the source data according to the coding degree in the wandering packets for coding, and storing the code storage area; otherwise, selecting to forward or store codes according to whether the free packet has residual step length.
Preferably, in the step (6.1) and the step (6.2), the decision of selecting forwarding or discarding wandering is based on:
discarding if no step length exists, and forwarding if the step length exists;
the step (6.3) is based on whether the free packet has residual step length or not, and the basis for selecting forwarding or coding storage is as follows: if there is no residual step, the coding is stored, if there is residual step, the coding is forwarded. When the condition that a certain node collects data is triggered at the moment t
Compared with the prior art, the invention has the following beneficial effects:
the method can be well suitable for the partial area collection scene of the trigger data under a large-scale network, dynamically perceives the size of a dynamic dividing coding unit and perceives the dangerous degree of the surrounding environment to dynamically adjust the size of coding redundancy, thereby effectively improving the decoding rate after data collection.
Drawings
Fig. 1 is a block diagram of a general implementation of the method of the present invention.
FIG. 2 is an abstract network model architecture diagram.
Fig. 3 is a cut-away view of a coding unit.
Fig. 4 is a coding unit memory profile.
Detailed Description
The invention will be further understood by reference to the following examples which are given to illustrate the invention but are not intended to limit the scope of the invention.
Referring to fig. 1, the invention provides a method for reliably collecting partial area of trigger data under a large-scale network, which comprises the following steps:
(1) A plurality of wireless sensors are randomly scattered in a monitored area, one for each node.
(2) Each node establishes neighbors with surrounding node neighbors by sending periodic broadcast packets (Keep Alive packets) to each other, and announces the following information: remaining storage space C of itself i Average remaining memory space M of neighbors i Growth rate of self memory space(i.e. the quotient of the coded memory space used by the node and the current time t), etc., wherein the average remaining memory space M of the neighbors i The calculation formula of (2) is as follows:
in the formula, M i As the source node N i The mean value of the storage space of the surrounding area nodes,as the source node N i Set of neighbors around time t, +.>For the source node N at time t i The number of the neighbor nodes around, j is the number of the neighbor nodes of the source node, C j The remaining memory space for neighbor j;
wherein M is i Stored in memory to calculate the size of the coding unit, M is done at each periodic calculation i Then updating is carried out;
(3) When a node senses an acquisition signal, the node serves as a source node N i Collecting multiple source dataThe coding unit size and the coding redundancy amount are calculated according to the received node information of the neighbor advertisement,
the calculation of the coding unit size and the coding redundancy comprises the following steps:
(3.1) Source node N i When sensing the acquisition signal, determining the minimum coding unit according to the storage state of the nearby nodesReferring to fig. 3;
(3.2) calculating an expected A of the data quantity required to be stored by surrounding nodes in the future, wherein the calculation formula is as follows:
in the formula, T c To assume a collection period of the collection node, t represents the source node N i The moment at which the signal is collected,for node N at time t i An average amount of increase in stored data for surrounding area nodes;
(3.3) reading the source node N from the local i Mean value M of storage space of surrounding area nodes i ；
(3.4) simultaneously calculating the average remaining memory space around the neighborsThe calculation formula is as follows:
in the formula, j is the number of the neighbor node of the source node, M j Is the mean of the storage space of its surrounding neighbor nodes for the node numbered j.
(3.5) giving a minimum value K of a minimum coding unit min Maximum value K max ；
(3.6) calculating an initial calculation value H of the encoding unit, the calculation formula being:
in the formula, lambda is the adjustment M i And (3) withThe value range of the coefficient of the duty ratio is (0, 1);
(3.7) final coding unit size is:
referring to fig. 4, the encoded redundancy amount epsilon is calculated in the following manner:
(3.8) statistics of source node N at various times i The number of neighbors is respectively
(3.9) calculating neighbor reductionThe calculation formula is as follows:
(3.10) calculating the mean value of the gradient decrease over the span of time range rRangeThe calculation formula is that
In the formula, s is different rollback time lengths;
(3.11) computing Source node N i Peripheral risk factorThe calculation formula is as follows:
in the formula, alpha is balanceAnd->The value range of the coefficient is (0, 1); θ is a risk degree adjustment coefficient, and the value range thereof is (0, 1)]；
(3.12) setting redundancy amountIs expressed as:
ε min epsilon is the minimum amount of redundancy max Is the maximum amount of redundancy;
(3.13) calculating a specific value of the redundancy amount, wherein the calculation formula is as follows:
source node N i Source dataCoding unit size and maximum hop count L propagated by broadcast M Storing the source data packet;
(4) Source node N i Broadcast transmission of source packets to surrounding nodes, followed by source node N i Transmitting a plurality of unicast random walk packets to random neighbors;
(5) When a certain isNode N k After receiving the broadcast source data packet, firstly judging whether the source data exists in the buffer area, if so, discarding the packet, and ending the step; if not, further judging whether the space of the coding buffer area is enough, if not, the oldest source data in the buffer area is clear, and if so, directly storing the received source data packet into the buffer area; at the same time, node N k Viewing the remaining hop count L of a broadcast M If the remaining hop count L M Not 0 to make the remaining hop count L M And subtracting 1, and continuing to broadcast the source data packet, otherwise, not forwarding.
(6) After receiving the random walk packet, the other nodes determine whether the own node contains the source dataAnd whether the remaining space of the encoded memory area is sufficient to store the random walk packet for encoding, forming encoded data and storing the encoded data locally, forwarding or discarding, the specific steps of:
(6.1) assuming that a maximum step W of random walk is given at the time of system initialization L When a random walk data packet is received, if no corresponding source data exists in the local cache, selecting forwarding or discarding according to whether the walk packet has a residual step length (discarding if no residual step length exists and forwarding if the residual step length exists), and ending the step; if the local cache has corresponding source data, the step (6.2) is entered;
(6.2) judging whether the residual space of the coded data storage area is enough to store the corresponding coded packets, if not, selecting to forward or discard according to the free packet and whether the free packet has residual step length (discarding if no residual step length and forwarding if the free packet has residual step length), and ending the step; if the corresponding code packet is stored sufficiently, the step (6.3) is carried out;
(6.3) judging whether the code storage area contains the code packets of the batch, if not, randomly selecting a certain number of code units from the source data according to the coding degree in the wandering packets for coding, storing the code units into the code storage area, and ending the step; if not, the forwarding is selected or the coding storage is carried out according to whether the free packet has the residual step length (if not, the coding storage is carried out), and if so, the forwarding is carried out.
(7) Referring to fig. 2, the collection node enters the encoded data stored in the collection node of the monitoring area, and decodes the encoded data by using the collected encoded data, that is, decodes the original collected data in batches by using a BP decoding algorithm.
The present invention has been described in detail with reference to the embodiments, but the description is only the preferred embodiments of the present invention and should not be construed as limiting the scope of the invention. All equivalent changes and modifications within the scope of the present invention should be considered as falling within the scope of the present invention.
Claims (5)
1. A method for reliably collecting partial areas of trigger data under a large-scale network is characterized by comprising the following steps: the method comprises the following steps:
(1) Randomly dispersing a plurality of wireless sensors in a monitoring area, wherein each wireless sensor corresponds to one node; each node sends periodic broadcast packets to each other to establish neighbors, each node periodically announces node information to the neighbors, and each node periodically announces node information to the neighbors comprises a residual storage space C of the node i Storage space growth rateI.e. the quotient of the coded memory space used by the node and the current time t, and the mean value M of the memory spaces of the neighbors of the node i The calculation formula is as follows:
in the formula, M i As the source node N i The mean value of the storage space of the surrounding area nodes,as the source node N i Set of neighbors around time t, +.>For the source node N at time t i The number of the neighbor nodes around, j is the number of the neighbor nodes of the source node, C j The remaining memory space for neighbor j;
wherein M is i Stored in memory to calculate the size of the coding unit, M is done at each periodic calculation i Then updating is carried out;
when a node senses an acquisition signal, the node serves as a source node N i Collecting multiple source dataCalculating the size of a coding unit and the coding redundancy according to the received node information of the neighbor advertisement, and enabling a source node N to i Source data +.>Coding unit size and maximum hop count L propagated by broadcast M Storing source data packet, coding unit->The calculation of the size of (a) comprises the steps of:
(3.1) Source node N i When sensing the acquisition signal, determining the minimum coding unit according to the storage state of the nearby nodes
(3.2) calculating an expected A of the data quantity required to be stored by surrounding nodes in the future, wherein the calculation formula is as follows:
in the formula, T c To assume a collection period of the collection node, t represents the source node N i The moment at which the signal is collected,for node N at time t i An average amount of increase in stored data for surrounding area nodes;
(3.3) reading the source node N from the local i Mean value M of storage space of surrounding area nodes i ；
(3.4) calculating the average remaining memory space around the neighborsThe calculation formula is as follows:
in the formula, j is the number of the neighbor node of the source node, M j The average value of the storage space of the neighboring nodes around the node with the number j;
(3.5) giving a minimum value K of a minimum coding unit min Maximum value K max ；
(3.6) calculating an initial calculation value H of the encoding unit, the calculation formula being:
in the formula, lambda is the adjustment M i And (3) withThe value range of the coefficient of the duty ratio is (0, 1);
(3.7) the final coding unit size is:
(2)
(3) Source node N i Broadcast transmission of source packets to surrounding nodes, followed by source node N i Transmitting a plurality of unicast random walk packets to random neighbors;
(4) When a certain node N k After receiving the broadcast source data packet, if the sectionPoint N k Is not locally provided with this source dataThen the node N k Storing source data in a data temporary area, if the node N k Is local to this source data->Discarding the source data packet; at the same time, node N k Viewing the remaining hop count L of a broadcast M If the remaining hop count L M Not 0 to make the remaining hop count L M Subtracting 1, and continuing broadcasting the source data packet, otherwise, not forwarding;
(5) After receiving the random walk packet, the other nodes determine whether the own node contains the source dataAnd whether the remaining space of the encoded memory area is sufficient to store the random walk packet for encoding, forming encoded data and storing the encoded data locally, forwarding or discarding;
(6) The collection node enters the monitoring area to collect the coded data stored in the node, and the collected coded data is used for decoding.
2. The method for reliably collecting partial areas of trigger data under a large-scale network according to claim 1, wherein the method comprises the following steps: the coding redundancy epsilon in the step (3) is calculated by the following steps:
(3.8) statistics of source node N at various times i The number of neighbors is respectively
(3.9) calculating neighbor reductionThe calculation formula is as follows:
(3.10) calculating the mean value of the gradient decrease over the span of time range rRangeThe calculation formula is that
In the formula, s is different rollback time lengths;
(3.11) computing Source node N i Peripheral risk factorThe calculation formula is as follows:
in the formula, alpha is balanceAnd->The value range of the coefficient is (0, 1); θ is a risk degree adjustment coefficient, and the value range thereof is (0, 1)]；
(3.12) setting redundancy amountIs expressed as:
ε min epsilon is the minimum amount of redundancy max Is the maximum amount of redundancy;
(3.13) calculating a specific value of the redundancy amount, wherein the calculation formula is as follows:
3. the method for reliably collecting partial areas of trigger data under a large-scale network according to claim 2, wherein the method comprises the following steps: the number of the random walk packets in the step (4) is divided into the number of the coding units by the source data packetsAnd coding redundancy amount->The specific calculation steps of the method comprise:
(4.1) calculating the number of segmented coding unitsThe calculation formula is as follows:
in the formula (i),as the source node N i The total amount of data acquired at time t;
and (4.2) calculating the number P of the random walk data packets, wherein the calculation formula is as follows:
4. the method for reliably collecting partial areas of trigger data under a large-scale network according to claim 1, wherein the method comprises the following steps: in the step (6), after the other nodes receive the random walk packet, according to whether the own node packets or notContaining the source dataAnd whether the remaining space of the encoded storage area is sufficient to store the random walk packet for encoded storage, forwarding, or discarding is as follows:
(6.1) assuming that a maximum step W of random walk is given at the time of system initialization L When a random walk data packet is received, if no corresponding source data exists in the local cache of the node, forwarding or discarding is selected according to whether the walk data packet has the residual step length or not; if the local cache has corresponding source data, entering the next step;
(6.2) judging whether the residual space of the coded data storage area of the node is enough to store the corresponding coded packet, if not, selecting to forward or discard according to whether the free packet has residual step length; if the remaining space of the coded data storage area of the node is enough to store the corresponding coded packet, entering the next step;
(6.3) judging whether the code storage area of the node already contains the code packets of the batch, if not, randomly selecting a plurality of code units from the source data according to the coding degree in the wandering packets for coding, and storing the code storage area; otherwise, selecting to forward or store codes according to whether the free packet has residual step length.
5. The method for reliably collecting partial areas of trigger data under a large-scale network according to claim 4, wherein the method comprises the following steps: in the step (6.1) and the step (6.2), the judgment basis for selecting forwarding or discarding wandering is as follows:
discarding if no step length exists, and forwarding if the step length exists;
the step (6.3) is based on whether the free packet has residual step length or not, and the basis for selecting forwarding or coding storage is as follows: if there is no residual step, the coding is stored, if there is residual step, the coding is forwarded.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110772010.7A CN113573270B (en) | 2021-07-08 | 2021-07-08 | Method for reliably collecting partial area of trigger data under large-scale network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110772010.7A CN113573270B (en) | 2021-07-08 | 2021-07-08 | Method for reliably collecting partial area of trigger data under large-scale network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113573270A CN113573270A (en) | 2021-10-29 |
| CN113573270B true CN113573270B (en) | 2024-03-08 |
Family
ID=78164074
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110772010.7A Active CN113573270B (en) | 2021-07-08 | 2021-07-08 | Method for reliably collecting partial area of trigger data under large-scale network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113573270B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107959551A (en) * | 2017-12-29 | 2018-04-24 | 河海大学常州校区 | A kind of reliable data transport in wireless sensor networks method based on network code |
| CN109218747A (en) * | 2018-09-21 | 2019-01-15 | 北京邮电大学 | Video traffic classification caching method in super-intensive heterogeneous network based on user mobility |
| CN111405516A (en) * | 2020-03-25 | 2020-07-10 | 西安电子科技大学 | Data collection method based on random walk in wireless sensor network |
| CN111935664A (en) * | 2020-07-20 | 2020-11-13 | 杭州电子科技大学 | Network data real-time collection method based on dynamic feedback |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090265141A1 (en) * | 2008-04-21 | 2009-10-22 | Aly Salah A | Distributed storage in wireless sensor networks |
-
2021
- 2021-07-08 CN CN202110772010.7A patent/CN113573270B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107959551A (en) * | 2017-12-29 | 2018-04-24 | 河海大学常州校区 | A kind of reliable data transport in wireless sensor networks method based on network code |
| CN109218747A (en) * | 2018-09-21 | 2019-01-15 | 北京邮电大学 | Video traffic classification caching method in super-intensive heterogeneous network based on user mobility |
| CN111405516A (en) * | 2020-03-25 | 2020-07-10 | 西安电子科技大学 | Data collection method based on random walk in wireless sensor network |
| CN111935664A (en) * | 2020-07-20 | 2020-11-13 | 杭州电子科技大学 | Network data real-time collection method based on dynamic feedback |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113573270A (en) | 2021-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9705527B2 (en) | System and method for data compression over a communication network | |
| Akkaya et al. | The impact of data aggregation on the performance of wireless sensor networks | |
| US8949466B1 (en) | System and method for adaptive compression | |
| US9497829B2 (en) | Methods for adaptively controlling lighting based upon traffic in an outdoor lighting network | |
| CN102594509B (en) | Wireless sensor network coding data collection method based on node classification strategy | |
| CN113573270B (en) | Method for reliably collecting partial area of trigger data under large-scale network | |
| Shan-Shan et al. | Energy efficient multipath routing using network coding in wireless sensor networks | |
| CN111935664B (en) | Network data real-time collection method based on dynamic feedback | |
| CN106961574A (en) | Transmission method of the fused images in cognition wireless multimedia sensing network | |
| CN102006626A (en) | Compression method for sensor network data based on Huffman encoding and random optimization policy | |
| Oldewurtel et al. | Cross-layer design for distributed source coding in wireless sensor networks | |
| CN111182488A (en) | Traceability data energy-saving transmission method based on time channel | |
| CN106231644B (en) | The wireless sensor network data transmission method of distribution line area video monitoring | |
| Padwalkar et al. | MMRE-AOMDV based energy efficient (MAEE) routing protocol for WMSNs | |
| Lin et al. | Geometric random linear codes in sensor networks | |
| CN109450994B (en) | Agricultural environment intelligent monitoring system based on big data | |
| Chen et al. | Data gathering and fusion in sensor networks | |
| CN103067131A (en) | Reliable sensor network communication method for digital channel | |
| Mostefa et al. | Adaptive image compression in wireless sensor networks | |
| Huu et al. | Energy threshold adaptation algorithms on image compression to prolong WSN lifetime | |
| Tezcan et al. | A bidirectional reliable transport mechanism for wireless sensor networks | |
| Pacharaney et al. | Novel Spatially Correlated Clustering Using Compressive Sensing for Wireless Sensor Networks | |
| Zhang et al. | SCL: A cross-layer protocol for wireless sensor networks | |
| Soni et al. | A wireless sensor network: An overview | |
| Swaroop et al. | Effect Of Grouping Cluster Based on Overlapping FOV In Wireless Multimedia Sensor Network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |