CN102664716A - Wireless sensor network data collection method applied to real-time monitoring - Google Patents
Wireless sensor network data collection method applied to real-time monitoring Download PDFInfo
- Publication number
- CN102664716A CN102664716A CN2012101097931A CN201210109793A CN102664716A CN 102664716 A CN102664716 A CN 102664716A CN 2012101097931 A CN2012101097931 A CN 2012101097931A CN 201210109793 A CN201210109793 A CN 201210109793A CN 102664716 A CN102664716 A CN 102664716A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- packet
- routing
- father node
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a wireless sensor network data collection method applied to real-time monitoring, which comprises two processes of routing building and data transmission. In the router building process, a common coding mode is adopted, the data packet is subjected to cyclic redundancy check and then multipath routing meeting the requirements is built according to the load, link channel quality, hop number and other indexes; and in the data transmission process, a common coding mode or an enhanced type coding mode can be adopted, when the wireless channel conditions are poor, the enhanced type coding mode is adopted, that is, the data packet is subjected to segmentation, cyclic redundancy check, channel coding and bit interleave, whether the routing is switched is judged according to the current load of a father node in a routing list at the same time, when data packet is retransmitted, a physical layer, a data link layer and a routing layer are needed to be combined, multipath routing of the neighbor node of the father node is started for coordinated transmission, and a receiving node adopts a data packet receiving pooling technique. The wireless sensor network data collection method has the advantages of high routing building speed, low routing maintaining expense, high data transmission reliability and low time delay.
Description
Technical field
The invention belongs to the wireless sensor network field, relate to a kind of multi-hop wireless sensor network route and set up and data transmission method, can be used for the wireless sensor network of monitoring in real time.
Background technology
Along with microprocessor technology and development of wireless communication devices, wireless sensor network will be applied in the growing field, like traffic control, environmental monitoring and automatic data logging etc.Because radio sensing network has huge using value, caused the very big concern of domestic and international industrial quarters and academia at present.Research major part to wireless sensor network concentrated on data link layer and the network layer in the past, and less to the research of physical layer, data link layer and network layer co-design.
The wireless sensor network major function is exactly the data message that sensor node is gathered, and through multi-hop between the sensor node and cooperation transmission, is sent to and converges Centroid.According to the wireless sensor network different application requirements, weigh the energy consumption that its performance index mainly contain network, throughput, time delay etc.For the wireless sensor network of real-time monitoring, reliability of data transmission and real-time then are primary performance index.
Wherein, packet loss is a quantizating index weighing reliability of data transmission, the wireless sensor network data bust this, and through still unsuccessful after repeatedly retransmitting, then packet can be dropped.Usually having the reason of two aspects can cause serious packet loss phenomenon, is that some node load is redundant on the one hand, causes buffer queue to overflow and packet loss; On the other hand because the time variation of wireless communication link when being in the deep fading, causes packet loss easily.In order to guarantee reliability of data transmission; Method commonly used at present is the method for keeping out of the way re-transmission and power control; These all are the passive modes of remedying; Wherein keep out of the way the method for re-transmission and can only extenuate the congested of wireless sensor network, improve reliability of data transmission, bring very big data transfer delay but retransmit.And the method for power control can strengthen the transmitted power of sensor node for the relatively poor communication link of quality of wireless channel; Improve reliability of data transmission; But the additional energy consumption of but having wasted, and brought stronger interference for the transmission of other wireless sensor node.
Summary of the invention
Technical problem:The invention provides that a kind of time delay is low, reliability is high, can guarantee monitoring in real time the wireless sensor network data transmission reliability and real-time be applied to the radio sensor network data collection method of monitoring in real time.
Technical scheme:The radio sensor network data collection method of monitoring in real time that is applied to of the present invention,
Adopt the coding mode of joined multi-path re-transmission and enhancement mode, reduce the data re-transmission number of times, improve reliability of data transmission, reduce time delay.The present invention mainly comprises route foundation and two stages of transfer of data.
Route of the present invention is set up the process basic ideas:
1) route is set up process and is adopted the control information bag, comprises routing request packet RREQ and routing reply bag RREP, and they adopt common coding mode, promptly packet are carried out cyclic redundancy check (CRC);
2) node that node that newly powers on or route lost efficacy need be set up route, sends routing request packet RREQ, if in the time of setting, do not receive routing reply bag RREP, sets up satisfactory route, then resets the cycle, sends routing request packet RREQ;
3) receive the node of routing request packet RREQ; Measure and receive signal strength signal intensity indication RSSI; If being lower than the link-quality threshold value then abandons,, then do not reply routing reply bag RREP if the address in the father node set comprises the present node address among the routing request packet RREQ that receives;
4) receive routing reply bag RREP; Measure and receive signal strength signal intensity indication RSSI; Then abandon if be lower than the link-quality threshold value; If the address among the routing request packet RREP that receives in the father node set comprises the present node address, the load of father node size surpasses thresholding among the routing request packet RREP that perhaps receives, then abandons routing reply bag RREP;
5) set up satisfactory multipath route according to jumping figure at last; When receiving a plurality of routing reply bag RREP that satisfies load, link channel quality requirement; Select the minimum node of jumping figure as primary circuit routing, select jumping figure to equate or the node of the second little jumping figure as less important route; Intercept the neighbor node of primary circuit routing and less important route simultaneously.Primary circuit routing and less important route are selected 2 neighbor nodes respectively at most.
Data transmission procedure basic ideas of the present invention are:
1) data transmission procedure adopts packet DATA and data validation bag ACK; According to wireless propagation environment; Can adopt the coding mode of common coding mode or enhancement mode; Wherein the coding mode of enhancement mode is represented the data sementation Cyclic Redundancy Check, is carried out chnnel coding then, and final data carries out Bit Interleave;
2) load of father node surpasses certain thresholding in routing table, and perhaps radio link quality is relatively poor, and cooperation retransmits through multipath, still can not transmission success, when perhaps the routing table address be sky, represent that all this route is invalid;
3) in transmit queue, have real-time Monitoring Data to need transmission, whether inspection primary circuit routing and less important route be effective, if primary circuit routing is invalid, and less important route can switch to and transmit on the less important route when effective; If they are all invalid, then get into the route establishment stage;
4) if when primary circuit routing or less important route are effective; According to statistics to the link number of retransmissions, link-quality is adopted common coding mode in the path preferably, and to the relatively poor path of link-quality; Adopt the coding mode of enhancement mode; After accomplishing digital coding,, wait for data validation bag ACK according to the father node address transmission data bag in the routing table; If in the time of setting, do not receive data validation bag ACK, then need retransmission data packet may;
5) when packet retransmits, need unite physical layer, data link layer and route layer and handle, launch the multipath route cooperation transmission of father node neighbor node, the neighbor node of father node has increased unnecessary reliable transmission link as the node of auxiliary transmission; Receiving terminal adopts retransmission data packet may to receive folding, when data re-transmission, can switch to the coding mode of enhancement mode, improves the efficient of retransmission data packet may, reduces the time delay of transmission.
According to the basic ideas that route is set up, described route is set up and is comprised the steps:
Described route is set up and is comprised the steps:
Step 11: when routing table is in failure state; Source node sends the routing request packet RREQ of common coding mode; Wait receives that the neighbor node of routing request packet RREQ handles routing request packet RREQ, and the routing reply bag RREP that sends common coding mode gives source node;
Step 12: in the stand-by period T that sets, wait for that source node receives routing reply bag RREP, and handle routing reply bag RREP,, then set up route if satisfy simultaneously that link-quality is reliable, the data queue of father node is not congested and the condition of looping route not; If do not receive the routing reply bag RREP that satisfies condition, then change step 13;
Step 13: reset the time cycle of waiting for routing reply bag RREP, change step 11.
Described transfer of data comprises following steps:
Step 21: whether real-time Monitoring Data is arranged in the source node transmit queue or transmit data,, then change step 22 if data are arranged, if there are not data, then free of data transmission;
Step 22: the father node of source node inquiry primary circuit routing and the packet retransmission rate that sends to father node; If the packet retransmission rate that sends to father node is more than or equal to the retransmission rate thresholding; The enhancement mode coding mode then is set,, common coding mode is set then if be lower than the retransmission rate thresholding;
Step 23: the father node load size and the number of retransmissions of the primary circuit routing that source node arrives according to real-time sense; Whether the father node address of judging primary circuit routing is effective; If the load of the father node of primary circuit routing surpasses the congestion threshold value or number of retransmissions reaches 3 times; Then the father node address failure changes step 24, otherwise changes step 27;
Step 24: the father node load size and the number of retransmissions of the less important route that source node arrives according to real-time sense; Whether the father node address of judging less important route is effective; If the load of the father node of less important route surpasses the congestion threshold value or number of retransmissions reaches 3 times; Then the father node address failure of less important route changes step 25, otherwise changes step 26;
Step 25:,, change step 11 so need to rebuild route because primary circuit routing and less important route all lost efficacy;
Step 26: primary circuit routing lost efficacy, and less important route is effectively, and it is 0 that the number of retransmissions initial value is set;
Step 27: whether inspection data re-transmission number of times is 0, if 0, not retransmission packet, change step 28, if be not 0, then change step 29;
Step 28: source node is according to coding mode; Data are carried out coding and transmitted packet DATA give father node, wait for data validation bag ACK, receive the father node handle packet DATA of packet; If can correctly receive packet DATA; Then send data validation bag ACK and give source node,, then do not send data validation bag ACK if can not correctly receive packet DATA;
Step 29: whether inspection data re-transmission number of times is 1, if 1, then change step 210, if be not 1, then change step 212;
Step 210: to a neighbor node of more options current parent node, if no neighbor node, then data retransmission does not adopt the multi-node collaboration transmission, adopts common re-transmission pattern;
Step 211: source node is encoded to data according to coding mode, from the link of selecting, transmits data respectively to father node; Wait for data validation bag ACK; Receive the father node handle packet DATA of packet, if can correctly receive packet DATA, then father node sends data validation bag ACK and gives source node; If can not correctly receive packet DATA, then father node does not send data validation bag ACK;
Step 212: whether inspection data re-transmission number of times is 2, if 2, then change step 213, if be not 2, then change step 23, current route was lost efficacy;
Step 213: to two neighbor nodes of more options current parent node, if no neighbor node, then data retransmission does not adopt the multi-node collaboration transmission, adopts common re-transmission pattern;
Step 214: source node is encoded to data according to coding mode, from the link of selecting, transmits data respectively to father node; Wait for data validation bag ACK; Receive the father node handle packet DATA of packet, if can correctly receive packet DATA, then father node sends data validation bag ACK and gives source node; If can not correctly receive packet DATA, then father node does not send data validation bag ACK;
Step 215: waiting for data validation bag ACK in the time, if receive data validation bag ACK, and deal with data is confirmed bag ACK; If successfully do not receive the data validation bag ACK that father node sends, then change step 216, if successfully receive; Then packet sends successfully, changes step 217;
Step 216: because data packet transmission is unsuccessful, need to retransmit, number of retransmissions adds 1, and statistics sends to the number of retransmissions of this father node packet, and Data Coding Scheme is made as the enhancement mode coding mode, changes step 27 then;
Step 217: because data are sent successfully, then send the buffer queue data pointer and add 1, change step 21.
The step of described processing routing request packet RREQ is:
Step 31: at first according to the information of preceding two bytes, judgment data coding mode and data packet length, complete reception data;
Step 32: present node has been received the routing request packet RREQ that adopts common coding mode;
Step 33: according to cyclic redundancy check (CRC), judge whether the routing request packet RREQ that receives is correct,, then change step 35, otherwise change step 34 if incorrect;
Step 34: according to the address information among the routing request packet RREQ that receives, judge whether it is the routing request packet RREQ that the father node of the present node that listens to sends, if, then change step 36, if not, step 37 then changeed;
Step 35: abandon the routing request packet RREQ that receives;
Step 36: the queue length value record among the routing request packet RREQ of the father node transmission that listens to is got off;
Step 37: test receives data signal strength sign RSSI, judges whether link-quality satisfies transmission requirement, if do not satisfy, then changes step 35, otherwise changes step 38;
Step 38: judge that whether present node is aggregation node or whether has set up route,, then change step 35, if aggregation node or set up the ordinary node of route then changes step 39 if not aggregation node is not set up route yet;
Step 39: judge that whether the source node address among the routing request packet RREQ is present in the father node set of present node, if be present in the father node set of present node, then changes step 35, otherwise changes step 310;
Step 310: send routing reply bag RREP.
The step of described processing routing reply bag RREP is:
Step 41: at first according to preceding two uncoded information of byte, judgment data coding mode and data packet length, complete reception data;
Step 42: present node has been received the routing reply bag RREP that adopts common coding mode, according to cyclic redundancy check (CRC), judges whether the routing reply bag RREP that receives is correct, if incorrect, then changes step 49, otherwise changes step 43;
Step 43: according to the address information among the routing reply bag RREP that receives, judge whether it is the routing reply bag RREP that its father node of listening to sends, if, then change step 44, if not, step 45 then changeed;
Step 44: the queue length value record among the routing reply bag RREP of the father node transmission that listens to is got off;
Step 45: test receives data signal strength sign RSSI, judges whether link-quality satisfies transmission requirement, if do not satisfy, then changes step 49, otherwise changes step 46;
Step 46: whether incidentally father node set comprises present node among the inspection routing reply bag RREP, if comprise present node, will form round by, then change step 49, otherwise change step 47;
Step 47: incidentally the size of father node formation among the inspection routing reply bag RREP, if the load of father node surpasses the congestion threshold value, then change step 49, otherwise change step 48;
Step 48: the jumping figure size of at first relatively receiving the route of routing reply bag RREP, current primary circuit routing and less important route; The route that jumping figure is minimum is made as primary circuit routing; And the jumping figure second little route is made as less important route; If jumping figure equates, the route of the routing reply bag RREP that then selects to receive at first; Next is provided with the adjacent node of primary circuit routing and less important route, if no adjacent node then is set to sky;
Step 49: abandon the routing reply bag RREP that does not meet the demands.
The step of described handle packet DATA is:
Step 51: at first according to preceding two uncoded information of byte, judgment data coding mode and data packet length, complete reception data;
Step 52: according to Data Coding Scheme, data are decoded, if common coding mode then carries out cyclic redundancy check (CRC) to whole packet, whether the packet that inspection receives is correct; If the enhancement mode coding mode then carries out deinterleaving to packet, channel-decoding and cyclic redundancy check (CRC) are carried out in segmentation, check whether every segment data is correct; If the packet of receiving is entirely true, then change step 54, if the packet of receiving is not exclusively correct, then change step 53;
Can step 53: the packet of receiving be not exclusively correct, and whether the inspection front receives the packet that this is identical, the packet that receives is several times merged, if it is correct to receive merging back packet, then changes step 54, otherwise changes step 55;
Step 54: according to the address information in the packet that receives, judge whether it is the packet that the father node of the present node that listens to sends, if, then change step 56, if not, step 57 then changeed;
Step 55: through step 53, packet still can not be entirely true, can reserve part proper data section, but must guarantee that source address and packet id information are correct, could keep, otherwise can only abandon this packet;
Step 56: the queue length value record in the packet of the father node transmission that listens to is got off;
Step 57: the father node address of the packet that inspection is received is the present node address, if, then change step 59, if not, step 58 then changeed;
Step 58: the adjacent node address 1 of the packet that inspection is received or adjacent node address 2 are the present node address, if, then change step 511, if not, step 510 then changeed;
Step 59: the coding mode that data validation bag ACK is set is consistent with the coding mode of receiving packet, sends data validation bag ACK and gives source node;
Step 510:, then abandon this packet because adjacent node address 1 and 2 is not current node address;
Step 511:, transmit the packet of receiving according to the adjacent node address;
Step 512: wait for data validation bag ACK;
Step 513: judge and receive that the father node of packet DATA is an aggregation node, if not, then change step 514, if aggregation node then sends data processing centre to through the internet;
Step 514: the packet DATA that receives is deposited in the transmit queue of present node.
Described deal with data confirms that the step of bag ACK is:
Step 61: at first according to preceding two uncoded information of byte, judgment data coding mode and data packet length, complete reception data;
Step 62: according to Data Coding Scheme, data are decoded, if common coding mode then carries out cyclic redundancy check (CRC) to whole packet, whether the data validation bag ACK that inspection receives is correct; If the enhancement mode coding mode then carries out deinterleaving to packet, channel-decoding and cyclic redundancy check (CRC) are carried out in segmentation, check whether every segment data is correct; If the data validation bag ACK that receives is entirely true, then change step 64, if the data validation bag ACK that receives is incorrect, then change step 68;
Step 63: according to the address information among the data validation bag ACK that receives, judge whether it is the data validation bag ACK that the father node of the present node that listens to sends, if, then change step 64, if not, step 65 then changeed;
Step 64: the queue length value record among the data validation bag ACK of the father node transmission that listens to is got off;
Step 65: the source node address among the data validation bag ACK that receives of inspection is the present node address, if, represent that then data send successfully, if not, step 66 then changeed;
Step 66: the adjacent node address 1 of the packet that inspection is received or adjacent node address 2 are the present node address, if, then change step 67, if not, step 68 then changeed;
Step 67: transmit data validation bag ACK from present node and give source node;
Step 68: abandon data validation bag ACK.
Data Coding Scheme in the described step 22, common coding mode are that data are carried out simple CRC check, and the coding mode of enhancement mode is that data are carried out the segmentation CRC check, carries out chnnel coding then, at last data is carried out Bit Interleave; Wherein adopt different chnnel coding and interleaving technology according to different application scenes.
Beneficial effect:The embodiment of the invention provides the radio sensor network data collection method that a kind of time delay is low, reliability is high, has following advantage:
1, this method route set up to adopt common coding mode, and transfer of data can improve every communication link reliability of data transmission when adopting the enhancement mode coding mode.
2, this method adopts packet to intercept technology, can set up the loading condition of route and dynamic knowledge father node fast, reduces the expense of the controlling packet of safeguarding route.
3, this method adopts the mode that multipath retransmits, and utilizes the cooperation transmission of neighbor node, and receiving terminal merges the packet that repeatedly retransmits with multipath, improves reliability of data transmission, reduces retransmitting the time delay of bringing.
4, congested mode is initiatively avoided in employing in this method, according to the father node loading condition of collecting, judges whether main and less important route lost efficacy, and whether need rebuild route, made wireless sensor network reach load balancing.
5, can be in this method according to the actual needs of application scenarios, when communication environments was better, data transfer phase can adopt simple common coding mode, improves the validity of its transmission; When communication environments is relatively poor, can switch to the enhancement mode coding mode according to the packet number of retransmissions, improve its reliability of data transmission.
Description of drawings
Fig. 1 sets up the flow chart of process for route of the present invention;
Fig. 2 is the flow chart of data transmission procedure of the present invention;
Fig. 3 is the flow chart of processing routing request packet of the present invention;
Fig. 4 is the flow chart of processing routing reply bag of the present invention;
Fig. 5 is the flow chart of handle packet of the present invention;
Fig. 6 is the flow chart that deal with data of the present invention is confirmed bag;
Fig. 7 is the form of routing request packet RREQ of the present invention;
Fig. 8 is the form of routing reply bag RREP of the present invention;
Fig. 9 is the form of common coding mode packet DATA of the present invention;
Figure 10 is the form of enhancement mode coding mode packet DATA of the present invention;
Figure 11 is the form of common coding mode data validation bag ACK of the present invention.
Figure 12 is the form of enhancement mode coding mode data validation bag ACK of the present invention.
Embodiment
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention; To do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below; Obviously, the accompanying drawing in describing below only shows some embodiments of the present invention, for those of ordinary skills; Under the prerequisite of not paying creative work, can also obtain the accompanying drawing of other embodiment according to these accompanying drawings.
In order to make the object of the invention, technical scheme and advantage clearer, will combine accompanying drawing and specific embodiment to describe the present invention below.
Flow chart as shown in Figure 1, that the embodiment of the invention provides a kind of route to set up process, this method may further comprise the steps:
Step 101: when routing table was in failure state, source node sent the routing request packet RREQ of common coding mode, waited for the neighbor node processing routing request packet RREQ that receives routing request packet RREQ; And the routing reply bag RREP that sends common coding mode gives source node; Wherein adopt the RREQ packet format of common coding mode to see also Fig. 7, adopt the RREP packet format of common coding mode to see also Fig. 8, wherein coding mode is 00; The long expression of bag is through the whole length of data package after the CRC check; RREQ bag length is 14 bytes, and the RREP bag is long to be 18+4N byte, and N sends the jumping figure of the node of routing reply to aggregation node;
Step 102: in the stand-by period T that sets; Wait for that source node receives routing reply bag RREP; And handle routing reply bag RREP, if satisfy simultaneously that link-quality is reliable, the data queue of father node is not congested and the condition of looping route not, then set up route; If do not receive the routing reply bag RREP that satisfies condition, then change step 103;
Step 103: reset the time cycle of waiting for routing reply bag (RREP), change step 101.
As shown in Figure 2, the embodiment of the invention provides a kind of flow chart of transfer of data, and this method may further comprise the steps:
Step 201: whether real-time Monitoring Data is arranged in the source node transmit queue or transmit data,, then change step 202 if data are arranged, if there are not data, then free of data transmission;
Step 202: the father node of source node inquiry primary circuit routing and the packet retransmission rate that sends to father node if the packet retransmission rate that sends to father node then is provided with the enhancement mode coding mode more than or equal to 10%, if be lower than 10%, then are provided with common coding mode;
Step 203: the father node load size and the number of retransmissions of the primary circuit routing that source node arrives according to real-time sense; Whether the father node address of judging primary circuit routing is effective; If the load of the father node of primary circuit routing surpasses the congestion threshold value or number of retransmissions reaches 3 times; Then the father node address failure changes step 204, otherwise changes step 207;
Step 204: the father node load size and the number of retransmissions of the less important route that source node arrives according to real-time sense; Whether the father node address of judging less important route is effective; If the load of the father node of less important route surpasses the congestion threshold value or number of retransmissions reaches 3 times; Then the father node address failure of less important route changes step 205, otherwise changes step 206;
Step 205:,, change step 101-103 so need to rebuild route because primary circuit routing and less important route all lost efficacy;
Step 206: primary circuit routing lost efficacy, and less important route is effectively, and it is 0 that the number of retransmissions initial value is set;
Step 207: whether inspection data re-transmission number of times is 0, if 0, not retransmission packet, change step 208, if be not 0, then change step 209;
Step 208: source node is according to coding mode; Data are carried out coding and transmitted data DATA; Wait for data validation bag ACK; Adopt common coding mode DATA packet format to see also Fig. 9; Wherein coding mode is 00, and the long expression of bag is through the whole length of data package after the CRC check, Bao Changwei 24+M byte; M is a useful data length; Adopt enhancement mode coding mode DATA packet format to see also Figure 10, wherein coding mode is 01, and the whole length of data package in enhanced channel coding back is adopted in the long expression of bag; The enhancement mode coding mode representes that per 5 byte section carry out CRC 16 verifications; Then data are carried out (7,4) hamming code, at last data are carried out Bit Interleave; So the individual byte of Bao Changwei
, wherein L makes whole enhancement mode coded data length
divided exactly the byte number of being filled by 5; Adopt common coding mode ACK packet format to see also Figure 11; Wherein coding mode is 00; 13 bytes of Bao Changwei; Adopt enhancement mode coding mode ACK packet format to see also Figure 12, wherein coding mode is 01, the individual byte of Bao Changwei
;
Step 209: whether inspection data re-transmission number of times is 1, if 1, then change step 210, if be not 1, then change step 212;
Step 210: to a neighbor node of more options current parent node, if no neighbor node, then data retransmission does not adopt the multi-node collaboration transmission, adopts common re-transmission pattern;
Step 211: source node is encoded to data according to coding mode, transmits data respectively from the link of selecting, and waits for data validation bag ACK;
Step 212: whether inspection data re-transmission number of times is 2, if 2, then change step 213, if be not 2, then change step 203, current route was lost efficacy;
Step 213: to two neighbor nodes of more options current parent node, if no neighbor node, then data retransmission does not adopt the multi-node collaboration transmission, adopts common re-transmission pattern;
Step 214: source node is encoded to data according to coding mode, transmits data respectively from the link of selecting, and waits for data validation bag ACK;
Step 215: waiting for whether data validation bag ACK in the time, receives the data validation bag ACK that father node sends, if do not receive, then changes step 216, if receive that then packet sends successfully, changes step 217;
Step 216: because data packet transmission is unsuccessful, need to retransmit, number of retransmissions adds 1, and statistics sends to the number of retransmissions of this father node packet, and Data Coding Scheme is made as the enhancement mode coding mode, changes step 207 then;
Step 217: because data are sent successfully, then send the buffer queue data pointer and add 1, change step 201.
As shown in Figure 3, the embodiment of the invention provides a kind of flow chart of handling routing request packet, and this method may further comprise the steps:
Step 301: at first according to the information of preceding two bytes, Data Coding Scheme be 00 with data packet length be 14 bytes, confirm coding mode and data length bag after, complete reception data;
Step 302: present node has been received the routing request packet RREQ that adopts common coding mode
Step 303: according to cyclic redundancy check (CRC), judge whether the routing request packet RREQ that receives is correct,, then change step 305, otherwise change step 304 if incorrect;
Step 304: according to the address information among the routing request packet RREQ that receives, judge whether it is the routing request packet RREQ that the father node of the present node that listens to sends, if, then change step 306, if not, step 307 then changeed;
Step 305: abandon the routing request packet RREQ that receives;
Step 306: the queue length value record among the routing request packet RREQ of the father node transmission that listens to is got off;
Step 307: test receives data signal strength sign RSSI, judges whether link-quality satisfies transmission requirement, if do not satisfy, then changes step 305, otherwise changes step 308;
Step 308: judge that whether present node is aggregation node or whether has set up route,, then change step 305, if aggregation node or set up the ordinary node of route then changes step 309 if not aggregation node is not set up route yet;
Step 309: judge that whether the source node address among the routing request packet RREQ is present in the father node set of present node, if be present in the father node set of present node, then changes step 305, otherwise changes step 310;
Step 310: send routing reply bag RREP.
As shown in Figure 4, the embodiment of the invention provides a kind of flow chart of handling the routing reply bag, and this method may further comprise the steps:
Step 401: at first according to preceding two uncoded information of byte, Data Coding Scheme be 00 with data packet length be 18+4N byte, confirm coding mode and data length bag after, complete reception data;
Step 402: present node has been received the routing reply bag RREP that adopts common coding mode, according to cyclic redundancy check (CRC), judges whether the routing reply bag RREP that receives is correct, if incorrect, then changes step 409, otherwise changes step 403;
Step 403: according to the address information among the routing reply bag RREP that receives, judge whether it is the routing reply bag RREP that listens to its father node transmission, if, then change step 404, if not, step 405 then changeed;
Step 404: the queue length value record among the routing reply bag RREP of the father node transmission that listens to is got off;
Step 405: test receives data signal strength sign RSSI, judges whether transmission requirement of link-quality, if do not satisfy, then changes step 409, otherwise commentaries on classics step 406;
Step 406: whether incidentally father node set comprises present node among the inspection routing reply bag RREP, if comprise present node, will form round by, then change step 409, otherwise commentaries on classics step 407;
Step 407: incidentally the size of father node formation among the inspection routing reply bag RREP, if the load of father node surpasses the congestion threshold value, then change step 409, otherwise change step 408;
Step 408: the jumping figure size of at first relatively receiving the route of routing reply bag RREP, current primary circuit routing and less important route; The route that jumping figure is minimum is made as primary circuit routing; And the jumping figure second little route is made as less important route; If jumping figure equates, the route of the routing reply bag RREP that then selects to receive at first; Next is provided with the adjacent node of primary circuit routing and less important route, if no adjacent node then is set to sky;
Step 409: abandon the routing reply bag RREP that does not meet the demands.
As shown in Figure 5, the embodiment of the invention provides a kind of flow chart of handle packet, and this method may further comprise the steps:
Step 501: at first according to preceding two uncoded information of byte; If Data Coding Scheme be 00 with data packet length be 24+M byte; If Data Coding Scheme be 01 with data packet length be
individual byte; After confirming coding mode and data packet length, complete reception data;
Step 502: according to Data Coding Scheme, data are decoded, if common coding mode then carries out cyclic redundancy check (CRC) to whole packet, whether the packet that inspection receives is correct; If the enhancement mode coding mode is then separated Bit Interleave to packet, channel-decoding and cyclic redundancy check (CRC) are carried out in segmentation, check whether every segment data is correct; If the packet of receiving is entirely true, then change step 54, if the packet of receiving is not exclusively correct, then change step 503;
Can step 503: the packet of receiving be not exclusively correct, and whether the inspection front receives the packet that this is identical, the packet that receives is several times merged, if it is correct to receive merging back packet, then changes step 504, otherwise changes step 505;
Step 504: according to the address information in the packet that receives, judge whether it is the packet that the father node of the present node that listens to sends, if, then change step 506, if not, step 507 then changeed;
Step 505: through step 503, packet still can not be entirely true, can reserve part proper data section, but must guarantee that source address and packet id information are correct, could keep, otherwise can only abandon this packet;
Step 506: the queue length value record in the packet of the father node transmission that listens to is got off;
Step 507: the father node address of the packet that inspection is received is the present node address, if, then change step 509, if not, step 508 then changeed;
Step 508: the adjacent node address 1 of the packet that inspection is received or adjacent node address 2 are the present node address, if, then change step 511, if not, step 510 then changeed;
Step 509: the coding mode that data validation bag ACK is set is consistent with the coding mode of receiving packet, sends data validation bag ACK and gives source node;
Step 510:, then abandon this packet because adjacent node address 1 and 2 is not current node address;
Step 511:, transmit the packet of receiving according to the adjacent node address;
Step 512: wait for data validation bag ACK.
Step 513: judge and receive that the father node of packet DATA is an aggregation node, if not, then change step 514, if aggregation node then sends data processing centre to through the internet;
Step 514: the packet DATA that receives is deposited in the transmit queue of present node.
As shown in Figure 6, the embodiment of the invention provides a kind of deal with data to confirm the flow chart of bag, and this method may further comprise the steps:
Step 601: at first according to preceding two uncoded information of byte; If Data Coding Scheme be 00 with data packet length be 23 bytes; If Data Coding Scheme be 01 with data packet length be
individual byte; After confirming coding mode and data length bag, complete reception data;
Step 602: according to Data Coding Scheme, data are decoded, if common coding mode then carries out cyclic redundancy check (CRC) to whole packet, whether the data validation bag ACK that inspection receives is correct; If the enhancement mode coding mode then carries out deinterleaving to packet, channel-decoding and cyclic redundancy check (CRC) are carried out in segmentation, check whether every segment data is correct; If the data validation bag ACK that receives is entirely true, then change step 604, if the data validation bag ACK that receives is incorrect, then change step 608;
Step 603: according to the address information among the data validation bag ACK that receives, judge whether it is the data validation bag ACK that the father node of the present node that listens to sends, if, then change step 604, if not, step 605 then changeed;
Step 604: the queue length value record among the data validation bag ACK of the father node transmission that listens to is got off;
Step 605: the source node address among the data validation bag ACK that receives of inspection is the present node address, if, represent that then data send successfully, if not, step 606 then changeed;
Step 606: the adjacent node address 1 of the packet that inspection is received or adjacent node address 2 are the address of present node, if, then change step 607, if not, step 608 then changeed;
Step 607: transmit data validation bag ACK from present node and give source node;
Step 608: abandon data validation bag ACK.
Claims (6)
1. one kind is applied to the radio sensor network data collection method of monitoring in real time, it is characterized in that this method mainly comprises route and sets up and two processes of transfer of data;
Described route is set up and is comprised the steps:
Step 11: when routing table is in failure state; Source node sends the routing request packet RREQ of common coding mode; Wait receives that the neighbor node of routing request packet RREQ handles routing request packet RREQ, and the routing reply bag RREP that sends common coding mode gives source node;
Step 12: in the stand-by period T that sets, wait for that source node receives routing reply bag RREP, and handle routing reply bag RREP,, then set up route if satisfy simultaneously that link-quality is reliable, the data queue of father node is not congested and the condition of looping route not; If do not receive the routing reply bag RREP that satisfies condition, then change step 13;
Step 13: reset the time cycle of waiting for routing reply bag RREP, change step 11.
Described transfer of data comprises following steps:
Step 21: whether real-time Monitoring Data is arranged in the source node transmit queue or transmit data,, then change step 22 if data are arranged, if there are not data, then free of data transmission;
Step 22: the father node of source node inquiry primary circuit routing and the packet retransmission rate that sends to father node; If the packet retransmission rate that sends to father node is more than or equal to the retransmission rate thresholding; The enhancement mode coding mode then is set,, common coding mode is set then if be lower than the retransmission rate thresholding;
Step 23: the father node load size and the number of retransmissions of the primary circuit routing that source node arrives according to real-time sense; Whether the father node address of judging primary circuit routing is effective; If the load of the father node of primary circuit routing surpasses the congestion threshold value or number of retransmissions reaches 3 times; Then the father node address failure changes step 24, otherwise changes step 27;
Step 24: the father node load size and the number of retransmissions of the less important route that source node arrives according to real-time sense; Whether the father node address of judging less important route is effective; If the load of the father node of less important route surpasses the congestion threshold value or number of retransmissions reaches 3 times; Then the father node address failure of less important route changes step 25, otherwise changes step 26;
Step 25:,, change step 11 so need to rebuild route because primary circuit routing and less important route all lost efficacy;
Step 26: primary circuit routing lost efficacy, and less important route is effectively, and it is 0 that the number of retransmissions initial value is set;
Step 27: whether inspection data re-transmission number of times is 0, if 0, not retransmission packet, change step 28, if be not 0, then change step 29;
Step 28: source node is according to coding mode; Data are carried out coding and transmitted packet DATA give father node, wait for data validation bag ACK, receive the father node handle packet DATA of packet; If can correctly receive packet DATA; Then send data validation bag ACK and give source node,, then do not send data validation bag ACK if can not correctly receive packet DATA;
Step 29: whether inspection data re-transmission number of times is 1, if 1, then change step 210, if be not 1, then change step 212;
Step 210: to a neighbor node of more options current parent node, if no neighbor node, then data retransmission does not adopt the multi-node collaboration transmission, adopts common re-transmission pattern;
Step 211: source node is encoded to data according to coding mode, from the link of selecting, transmits data respectively to father node; Wait for data validation bag ACK; Receive the father node handle packet DATA of packet, if can correctly receive packet DATA, then father node sends data validation bag ACK and gives source node; If can not correctly receive packet DATA, then father node does not send data validation bag ACK;
Step 212: whether inspection data re-transmission number of times is 2, if 2, then change step 213, if be not 2, then change step 23, current route was lost efficacy;
Step 213: to two neighbor nodes of more options current parent node, if no neighbor node, then data retransmission does not adopt the multi-node collaboration transmission, adopts common re-transmission pattern;
Step 214: source node is encoded to data according to coding mode, from the link of selecting, transmits data respectively to father node; Wait for data validation bag ACK; Receive the father node handle packet DATA of packet, if can correctly receive packet DATA, then father node sends data validation bag ACK and gives source node; If can not correctly receive packet DATA, then father node does not send data validation bag ACK;
Step 215: waiting for data validation bag ACK in the time, if receive data validation bag ACK, and deal with data is confirmed bag ACK; If successfully do not receive the data validation bag ACK that father node sends, then change step 216, if successfully receive; Then packet sends successfully, changes step 217;
Step 216: because data packet transmission is unsuccessful, need to retransmit, number of retransmissions adds 1, and statistics sends to the number of retransmissions of this father node packet, and Data Coding Scheme is made as the enhancement mode coding mode, changes step 27 then;
Step 217: because data are sent successfully, then send the buffer queue data pointer and add 1, change step 21.
2. according to the described a kind of radio sensor network data collection method of monitoring in real time that is applied to of claim 1, it is characterized in that the step of described processing routing request packet RREQ is:
Step 31: at first according to the information of preceding two bytes, judgment data coding mode and data packet length, complete reception data;
Step 32: present node has been received the routing request packet RREQ that adopts common coding mode;
Step 33: according to cyclic redundancy check (CRC), judge whether the routing request packet RREQ that receives is correct,, then change step 35, otherwise change step 34 if incorrect;
Step 34: according to the address information among the routing request packet RREQ that receives, judge whether it is the routing request packet RREQ that the father node of the present node that listens to sends, if, then change step 36, if not, step 37 then changeed;
Step 35: abandon the routing request packet RREQ that receives;
Step 36: the queue length value record among the routing request packet RREQ of the father node transmission that listens to is got off;
Step 37: test receives data signal strength sign RSSI, judges whether link-quality satisfies transmission requirement, if do not satisfy, then changes step 35, otherwise changes step 38;
Step 38: judge that whether present node is aggregation node or whether has set up route,, then change step 35, if aggregation node or set up the ordinary node of route then changes step 39 if not aggregation node is not set up route yet;
Step 39: judge that whether the source node address among the routing request packet RREQ is present in the father node set of present node, if be present in the father node set of present node, then changes step 35, otherwise changes step 310;
Step 310: send routing reply bag RREP.
3. according to the described a kind of radio sensor network data collection method of monitoring in real time that is applied to of claim 1, it is characterized in that the step of described processing routing reply bag RREP is:
Step 41: at first according to preceding two uncoded information of byte, judgment data coding mode and data packet length, complete reception data;
Step 42: present node has been received the routing reply bag RREP that adopts common coding mode, according to cyclic redundancy check (CRC), judges whether the routing reply bag RREP that receives is correct, if incorrect, then changes step 49, otherwise changes step 43;
Step 43: according to the address information among the routing reply bag RREP that receives, judge whether it is the routing reply bag RREP that its father node of listening to sends, if, then change step 44, if not, step 45 then changeed;
Step 44: the queue length value record among the routing reply bag RREP of the father node transmission that listens to is got off;
Step 45: test receives data signal strength sign RSSI, judges whether link-quality satisfies transmission requirement, if do not satisfy, then changes step 49, otherwise changes step 46;
Step 46: whether incidentally father node set comprises present node among the inspection routing reply bag RREP, if comprise present node, will form round by, then change step 49, otherwise change step 47;
Step 47: incidentally the size of father node formation among the inspection routing reply bag RREP, if the load of father node surpasses the congestion threshold value, then change step 49, otherwise change step 48;
Step 48: the jumping figure size of at first relatively receiving the route of routing reply bag RREP, current primary circuit routing and less important route; The route that jumping figure is minimum is made as primary circuit routing; And the jumping figure second little route is made as less important route; If jumping figure equates, the route of the routing reply bag RREP that then selects to receive at first; Next is provided with the adjacent node of primary circuit routing and less important route, if no adjacent node then is set to sky;
Step 49: abandon the routing reply bag RREP that does not meet the demands.
4. according to the described a kind of radio sensor network data collection method of monitoring in real time that is applied to of claim 1, it is characterized in that the step of described handle packet DATA is:
Step 51: at first according to preceding two uncoded information of byte, judgment data coding mode and data packet length, complete reception data;
Step 52: according to Data Coding Scheme, data are decoded, if common coding mode then carries out cyclic redundancy check (CRC) to whole packet, whether the packet that inspection receives is correct; If the enhancement mode coding mode then carries out deinterleaving to packet, channel-decoding and cyclic redundancy check (CRC) are carried out in segmentation, check whether every segment data is correct; If the packet of receiving is entirely true, then change step 54, if the packet of receiving is not exclusively correct, then change step 53;
Can step 53: the packet of receiving be not exclusively correct, and whether the inspection front receives the packet that this is identical, the packet that receives is several times merged, if it is correct to receive merging back packet, then changes step 54, otherwise changes step 55;
Step 54: according to the address information in the packet that receives, judge whether it is the packet that the father node of the present node that listens to sends, if, then change step 56, if not, step 57 then changeed;
Step 55: through step 53, packet still can not be entirely true, can reserve part proper data section, but must guarantee that source address and packet id information are correct, could keep, otherwise can only abandon this packet;
Step 56: the queue length value record in the packet of the father node transmission that listens to is got off;
Step 57: the father node address of the packet that inspection is received is the present node address, if, then change step 59, if not, step 58 then changeed;
Step 58: the adjacent node address 1 of the packet that inspection is received or adjacent node address 2 are the present node address, if, then change step 511, if not, step 510 then changeed;
Step 59: the coding mode that data validation bag ACK is set is consistent with the coding mode of receiving packet, sends data validation bag ACK and gives source node;
Step 510:, then abandon this packet because adjacent node address 1 and 2 is not current node address;
Step 511:, transmit the packet of receiving according to the adjacent node address;
Step 512: wait for data validation bag ACK;
Step 513: judge and receive that the father node of packet DATA is an aggregation node, if not, then change step 514, if aggregation node then sends data processing centre to through the internet;
Step 514: the packet DATA that receives is deposited in the transmit queue of present node.
5. according to the described a kind of radio sensor network data collection method of monitoring in real time that is applied to of claim 1, it is characterized in that the step of described deal with data affirmation bag ACK is:
Step 61: at first according to preceding two uncoded information of byte, judgment data coding mode and data packet length, complete reception data;
Step 62: according to Data Coding Scheme, data are decoded, if common coding mode then carries out cyclic redundancy check (CRC) to whole packet, whether the data validation bag ACK that inspection receives is correct; If the enhancement mode coding mode then carries out deinterleaving to packet, channel-decoding and cyclic redundancy check (CRC) are carried out in segmentation, check whether every segment data is correct; If the data validation bag ACK that receives is entirely true, then change step 64, if the data validation bag ACK that receives is incorrect, then change step 68;
Step 63: according to the address information among the data validation bag ACK that receives, judge whether it is the data validation bag ACK that the father node of the present node that listens to sends, if, then change step 64, if not, step 65 then changeed;
Step 64: the queue length value record among the data validation bag ACK of the father node transmission that listens to is got off;
Step 65: the source node address among the data validation bag ACK that receives of inspection is the present node address, if, represent that then data send successfully, if not, step 66 then changeed;
Step 66: the adjacent node address 1 of the packet that inspection is received or adjacent node address 2 are the present node address, if, then change step 67, if not, step 68 then changeed;
Step 67: transmit data validation bag ACK from present node and give source node;
Step 68: abandon data validation bag ACK.
6. according to the described a kind of radio sensor network data collection method of monitoring in real time that is applied to of claim 1; It is characterized in that Data Coding Scheme in the described step 22; Common coding mode is that data are carried out simple CRC check; And the coding mode of enhancement mode is that data are carried out the segmentation CRC check, carries out chnnel coding then, at last data is carried out Bit Interleave; Wherein adopt different chnnel coding and interleaving technology according to different application scenes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210109793.1A CN102664716B (en) | 2012-04-13 | 2012-04-13 | Wireless sensor network data collection method applied to real-time monitoring |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210109793.1A CN102664716B (en) | 2012-04-13 | 2012-04-13 | Wireless sensor network data collection method applied to real-time monitoring |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102664716A true CN102664716A (en) | 2012-09-12 |
| CN102664716B CN102664716B (en) | 2014-08-06 |
Family
ID=46774139
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210109793.1A Expired - Fee Related CN102664716B (en) | 2012-04-13 | 2012-04-13 | Wireless sensor network data collection method applied to real-time monitoring |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102664716B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105050149A (en) * | 2015-06-01 | 2015-11-11 | 苏州博联科技有限公司 | Routing method for overcoming congestion of tree type Zigbee network |
| CN105281832A (en) * | 2014-07-02 | 2016-01-27 | 北京邮电大学 | Neighbor discovery method in ultraviolet light network |
| CN103716137B (en) * | 2013-12-30 | 2017-02-01 | 上海交通大学 | Method and system for identifying reasons of ZigBee sensor network packet loss |
| CN107302582A (en) * | 2017-07-10 | 2017-10-27 | 广东工业大学 | The data acquisition of millions scenes of internet of things and weak method for pushing |
| CN107548120A (en) * | 2017-08-11 | 2018-01-05 | 北京航空航天大学 | Face the method for routing and device of sky communication network |
| CN108763109A (en) * | 2018-06-13 | 2018-11-06 | 成都心吉康科技有限公司 | Date storage method, device and its application |
| CN110278138A (en) * | 2019-06-27 | 2019-09-24 | 苏州市厚宏智能科技有限公司 | The communication system and method for kinds of goods management |
| CN112566208A (en) * | 2020-11-30 | 2021-03-26 | 浙江大学 | Intelligent power grid wireless data communication path searching method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006114511A1 (en) * | 2005-04-28 | 2006-11-02 | France Telecom | Routing method, a transmitting-receiving station and a computer program for carrying out said method |
| CN1933445A (en) * | 2006-09-04 | 2007-03-21 | 南通大学 | Radio senser network up and down isomeric routing method |
| CN101150518A (en) * | 2007-10-29 | 2008-03-26 | 北京科技大学 | A method for route establishment under unidirectional link environment |
| US20110196955A1 (en) * | 2006-09-14 | 2011-08-11 | Hitachi, Ltd. | Sensor Network System for Managing the Latest Data and History Data |
| CN102223683A (en) * | 2011-06-07 | 2011-10-19 | 中兴通讯股份有限公司 | Data transmission method, node and system in wireless sensor network |
-
2012
- 2012-04-13 CN CN201210109793.1A patent/CN102664716B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006114511A1 (en) * | 2005-04-28 | 2006-11-02 | France Telecom | Routing method, a transmitting-receiving station and a computer program for carrying out said method |
| CN1933445A (en) * | 2006-09-04 | 2007-03-21 | 南通大学 | Radio senser network up and down isomeric routing method |
| US20110196955A1 (en) * | 2006-09-14 | 2011-08-11 | Hitachi, Ltd. | Sensor Network System for Managing the Latest Data and History Data |
| CN101150518A (en) * | 2007-10-29 | 2008-03-26 | 北京科技大学 | A method for route establishment under unidirectional link environment |
| CN102223683A (en) * | 2011-06-07 | 2011-10-19 | 中兴通讯股份有限公司 | Data transmission method, node and system in wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| XU CHEN: "Uplink-Downlink Heterogeneous Routing Protocol for Wireless Sensor Network", 《ITERNATIONAL CONFERENCE ON WICOM2007》, 31 December 2007 (2007-12-31) * |
| 王华: "无线传感器网络中数据可靠传输的节能路由算法", 《计算机应用》, vol. 26, no. 1, 31 January 2006 (2006-01-31) * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716137B (en) * | 2013-12-30 | 2017-02-01 | 上海交通大学 | Method and system for identifying reasons of ZigBee sensor network packet loss |
| CN105281832B (en) * | 2014-07-02 | 2018-01-02 | 北京邮电大学 | Neighbor discovering method in a kind of ultraviolet optical-fiber network |
| CN105281832A (en) * | 2014-07-02 | 2016-01-27 | 北京邮电大学 | Neighbor discovery method in ultraviolet light network |
| CN105050149A (en) * | 2015-06-01 | 2015-11-11 | 苏州博联科技有限公司 | Routing method for overcoming congestion of tree type Zigbee network |
| CN107302582B (en) * | 2017-07-10 | 2021-03-09 | 广东工业大学 | Data acquisition and weak push method for million-level Internet of things scene |
| CN107302582A (en) * | 2017-07-10 | 2017-10-27 | 广东工业大学 | The data acquisition of millions scenes of internet of things and weak method for pushing |
| CN107548120A (en) * | 2017-08-11 | 2018-01-05 | 北京航空航天大学 | Face the method for routing and device of sky communication network |
| CN107548120B (en) * | 2017-08-11 | 2020-07-03 | 北京航空航天大学 | Routing method and device of air-to-air communication network |
| CN108763109A (en) * | 2018-06-13 | 2018-11-06 | 成都心吉康科技有限公司 | Date storage method, device and its application |
| CN108763109B (en) * | 2018-06-13 | 2022-04-26 | 成都心吉康科技有限公司 | Data storage method and device and application thereof |
| CN110278138A (en) * | 2019-06-27 | 2019-09-24 | 苏州市厚宏智能科技有限公司 | The communication system and method for kinds of goods management |
| CN112566208A (en) * | 2020-11-30 | 2021-03-26 | 浙江大学 | Intelligent power grid wireless data communication path searching method |
| CN112566208B (en) * | 2020-11-30 | 2022-05-03 | 浙江大学 | Intelligent power grid wireless data communication path searching method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102664716B (en) | 2014-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102664716B (en) | Wireless sensor network data collection method applied to real-time monitoring | |
| CN102333344B (en) | Adaptive error control method applied to wireless sensor network | |
| CN100355232C (en) | Method and apparatus for controlling flow of data in a communication system | |
| CN103001751B (en) | Cross-layer ARQ (Automatic Repeat Request) method in LTE-WLAN (Long Term Evolution and Wireless Local Area Network) heterogeneous wireless network system | |
| CN100566225C (en) | Method and apparatus in the communicated upon radio communication channels data service | |
| CN102170332B (en) | Opportunistic routing protocol data distributing method based on fountain code and network coding | |
| CN103312478B (en) | Method and system for the data transfer in data network | |
| CN102123471B (en) | Stub network of Internet of things and seepage data transmission method thereof | |
| CN103051424B (en) | A kind of radio transmitting method of unequal error protection fountain codes | |
| CN106254202A (en) | A kind of multidiameter delay transmission method based on fountain codes and device | |
| CN101621368A (en) | Method, device and system for retransmitting data packet | |
| CN103096410A (en) | Data transmission method of wireless meter reading system | |
| CN103209435A (en) | Congestion control based wireless multi-hop network multicast method | |
| CN103959852A (en) | Data transmission method, forwarding method, reception method, device, and system | |
| CN113315559A (en) | Wireless sensor network based on distributed reception and transmission method thereof | |
| CN102208962A (en) | Wireless data transmission method | |
| CN102315923B (en) | Radio link control method of 3G (The 3rd Generation) satellite communication system | |
| CN103944689B (en) | A kind of pipeline method of suitable physical layer no rate coding transmission | |
| CN103546245A (en) | Data packet retransmission method based on network codes | |
| CN102970111B (en) | Redundant-coding-based multi-channel access method for satellite network communication | |
| CN110996351A (en) | Method for improving network service quality | |
| CN101860981A (en) | Routing method and system of wireless sensor network | |
| CN108900284A (en) | Efficiently fault-tolerant wireless interface in a kind of on piece wireless network | |
| CN102025473A (en) | Retransmission method based on intergenerational network coding in packet network | |
| CN104486040A (en) | Efficient coding-aware routing method based on cache management |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200724 Address after: Room 288, building e, No. 11, Limin Road, Changlu street, Jiangbei new district, Nanjing, Jiangsu Province 210000 Patentee after: Xinentropy Technology (Nanjing) Co.,Ltd. Address before: 226019 Jiangsu city of Nantong province Nantong University sik Road No. 9 Patentee before: NANTONG University |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140806 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |