WO2015051736A1 - 一种网络节点的报文传输的容错方法及网络节点 - Google Patents

一种网络节点的报文传输的容错方法及网络节点 Download PDF

Info

Publication number
WO2015051736A1
WO2015051736A1 PCT/CN2014/088136 CN2014088136W WO2015051736A1 WO 2015051736 A1 WO2015051736 A1 WO 2015051736A1 CN 2014088136 W CN2014088136 W CN 2014088136W WO 2015051736 A1 WO2015051736 A1 WO 2015051736A1
Authority
WO
WIPO (PCT)
Prior art keywords
segment
error
matching
determining
vacant
Prior art date
Application number
PCT/CN2014/088136
Other languages
English (en)
French (fr)
Inventor
程龙龙
马卫国
张大龙
施里涛
Original Assignee
电信科学技术研究院
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 电信科学技术研究院 filed Critical 电信科学技术研究院
Publication of WO2015051736A1 publication Critical patent/WO2015051736A1/zh

Links

Images

Classifications

    • 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/04—Arrangements for maintaining operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements

Definitions

  • the present invention relates to communication technologies, and in particular, to a fault tolerance method and network node for message transmission of a network node.
  • Wireless sensor networks which are usually powered by batteries, fail when the battery is exhausted, so power consumption is saved as much as possible The reliability of the transmission, so it is necessary to improve the fault tolerance of such network nodes.
  • the wireless sensor network is quite different from the wireless communication network.
  • the main function of the wireless communication network is to provide interconnection, interworking and interoperability of the network to provide correct and reliable transmission of data, while the wireless sensor network collects and processes data.
  • the current fault-tolerant technology for wireless network communication networks cannot be completely applied to wireless sensor networks, and must be studied for the characteristics of wireless sensor networks.
  • the data frame of the wireless data transmission usually includes the header and the actual data, and the address information is included in the header.
  • the data frame in which the header is erroneous during the transmission may cause the actual data carried by the header to be unable to be transmitted to the correct location or to be in the same position as other data frames. A conflict has occurred in the location.
  • the data frame format of the wireless sensor network transmitted by the Transmission Control Protocol/Internet Protocol (TCP/IP) protocol is: frame header + IP header + TCP header + actual data + frame tail, where the frame header Including source and destination host Media Access Control (MAC) address and type, IP header includes source and destination host IP addresses, TCP header includes source and destination host port number, sequence number, acknowledgment number, check word, etc.
  • TCP/IP Transmission Control Protocol/Internet Protocol
  • the actual data is the body of the data to be transmitted, and the end of the frame is the check word.
  • the frame header, the IP header, and the TCP header form a header. Any error in the header, IP header, or TCP header in the header may cause the receiving end to fail to correctly splicing the packet. That is, when an error occurs in the transmission of the header.
  • the actual data carried by it will not be transmitted to the correct location, including the fact that the actual data has nowhere to be placed and the location where the data frame is placed in conflict with other data frames.
  • ARQ Automatic Repeat-reQuest
  • the automatic retransmission request the transmitting end performs error correction coding and verification on the transmission sequence, and the receiving end determines whether the error is transmitted according to the coding rule of the check sequence, and returns the result of the judgment to the transmitting end through the feedback channel. If there is nothing wrong, the receiving end confirms the reception, and the transmitting end clears the contents of the buffer; if there is an error, the receiving end rejects the reception, and at the same time sends a command to resend the sequence to the transmitting end until the receiving end receives the correct.
  • the utilization rate of the communication channel of the method is not high, That is to say, the channel is far from being filled by data bits, has a long transmission delay and brings large communication overhead and communication energy consumption. When the channel environment is poor, it consumes a large amount of energy and speeds up the network. The energy consumption of the node shortens the lifetime of the network node.
  • the embodiments of the present invention provide a fault tolerance method and a network node for packet transmission of a network node, so as to improve communication efficiency of the network node and reduce communication energy consumption of the network node.
  • the matching the error-containing segment and the vacant position to form a complete packet includes:
  • the data of the error-containing segment is connected to the corresponding vacant position to form a complete packet.
  • the determining the maximum matching result of the bipartite graph of the set A and the set B includes:
  • the pair of each error-containing segment is respectively determined to have a matching weight for all the vacant positions, and specifically includes:
  • the matching weight of all the vacant positions is determined as the maximum posterior probability or the minimum Hamming distance of the error-containing segment and the corresponding vacant position.
  • the determining the best matching result according to the weight matrix includes:
  • a best match result is determined based on the new weight matrix.
  • An embodiment of the present invention provides a network node, including:
  • a receiving unit configured to receive a segment sent by the sending end, and determine the error packet segment included therein;
  • a determining unit configured to determine a vacant location formed by a missing segment of the message after the data segment is connected to the correct segment
  • a matching unit configured to match the error-containing segment and the vacant location to form a complete packet.
  • the matching unit in the network node matches the error-containing segment and the vacant location to form a complete packet, which does not need to be retransmitted, improves the communication efficiency of the network node, and reduces the communication energy consumption of the network node.
  • the matching unit is specifically configured to:
  • the data of the error-containing segment is connected to the corresponding vacant position to form a complete packet.
  • the matching unit determines the maximum matching result of the bipartite graph of the set A and the set B, and specifically includes:
  • the embodiment of the invention further provides a network node, comprising: a sensor module, a processor module, a wireless communication module and an energy supply module, wherein:
  • a sensor module for performing information collection and data conversion in an area
  • a wireless communication module for wirelessly communicating with other network nodes
  • An energy supply module for providing energy to the sensor module, the processor module, and the wireless communication module
  • a processor module configured to control the sensor module, the wireless communication module, and the energy supply module, and after the wireless communication module receives the segment, determine the error-containing segment and determine the correct segment After the data connection, a complete message is formed due to the vacant position formed by the missing segment segment and the matching of the error-containing segment and the vacant position.
  • the processor module in the network node matches the error-containing segment and the vacant location to form a complete packet, which does not need to be retransmitted, improves the communication efficiency of the network node, and reduces the communication energy consumption of the network node.
  • the processor module matches the error-containing segment and the vacant location to form a complete packet, which specifically includes:
  • the data of the error-containing segment is connected to the corresponding vacant position to form a complete packet.
  • the processor module determines a maximum matching result of the bipartite graph of the set A and the set B, specifically including:
  • the embodiment of the invention further provides a network node, including:
  • a processor for reading a program in the memory performing the following process:
  • the receiver is configured to receive data under control of the processor.
  • the processor is specifically configured to:
  • the data with the wrong segment is connected to the corresponding vacant position to form a complete packet.
  • the processor determines the maximum matching result of the bipartite graph of the set A and the set B, specifically including:
  • the best match result is determined based on the weight matrix.
  • the processor determines, for each of the error-containing segments, the matching weights of all the vacant positions, including:
  • the matching weight of all the vacant positions is determined as the maximum posterior probability or the minimum Hamming distance of the error-containing segment and the corresponding vacant position.
  • the processor determines the best matching result according to the weight matrix, which specifically includes:
  • a best match result is determined based on the new weight matrix.
  • the embodiment of the invention provides a fault-tolerant method for transmitting a message of a network node and a network node. After receiving a segment sent by the sender, the network node determines the error-containing segment and determines the data for the correct segment. After the connection, due to the vacant position formed by the missing segment, the error message segment and the vacant position are matched to form a complete message, and no retransmission is needed, which improves the communication efficiency of the network node and reduces the network node. Communication energy consumption.
  • FIG. 1 is a flowchart of a fault tolerance method for message transmission of a network node according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a principle of a KM algorithm according to an embodiment of the present invention.
  • 3a is a schematic diagram of packet transmission errors of a network node according to an embodiment of the present invention.
  • FIG. 3b is a schematic diagram of packet error matching of a network node according to an embodiment of the present invention.
  • FIG. 4 is a simulation diagram of a fault tolerance method for message transmission of a network node according to an embodiment of the present invention
  • FIG. 5 is a schematic diagram of a network node according to an embodiment of the present disclosure.
  • FIG. 6 is a second schematic diagram of a network node according to an embodiment of the present invention.
  • FIG. 7 is a third schematic diagram of a network node according to an embodiment of the present invention.
  • the embodiment of the invention provides a fault-tolerant method for transmitting a message of a network node and a network node. After receiving a segment sent by the sender, the network node determines the error-containing segment and determines the data for the correct segment. After the connection, due to the vacant position formed by the missing segment, the error message segment and the vacant position are matched to form a complete message, and no retransmission is needed, which improves the communication efficiency of the network node and reduces the network. The communication energy consumption of the node.
  • a fault tolerance method for packet transmission of a network node includes:
  • Step S101 Receive a segment sent by the sending end, and determine an error packet segment included therein;
  • Step S102 Determine a vacant location formed by a missing segment of the message after performing a data connection on the correct segment.
  • Step S103 Match the error-containing segment and the vacant location to form a complete packet.
  • the vacant location formed by connecting the erroneous packet with the correct packet is matched, so that the complete packet can be directly obtained without retransmission, thereby improving the communication efficiency of the network node.
  • the communication energy consumption of the network node is reduced.
  • the data frame of the wireless data transmission usually includes the header and the actual data, and the address information is included in the header.
  • the data frame in which the header is erroneous during the transmission may cause the actual data carried by the header to be unable to be transmitted to the correct location or to be in the same position as other data frames. A conflict has occurred in the location.
  • the data frame with the header address error is called the error message; because the header has an error, the location where the data should be received without receiving the data or the location where the collision occurs is called a vacant location.
  • step S103 the error message segment and the vacant location are matched to form a complete packet, which includes:
  • the data with the wrong segment is connected to the corresponding vacant position to form a complete packet.
  • the maximum matching result of the bipartite graph of the set A and the set B is determined, which specifically includes:
  • the best match result is determined based on the weight matrix.
  • the matching weights of all the vacant positions are respectively determined, including:
  • the matching weight of all the vacant positions is determined as the maximum posterior probability or the minimum Hamming distance of the error-containing segment and the corresponding vacant position.
  • the matching weight of the error message segment and the vacant location may be determined for any one or combination of the address, the port number, and the sequence number, that is, the address, the port number, and the sequence number in the error-containing segment are received.
  • the maximum posterior probability or minimum Hamming distance of any or combination of corresponding content with the vacant position may be determined for any one or combination of the address, the port number, and the sequence number, that is, the address, the port number, and the sequence number in the error-containing segment are received.
  • the matching weights of the erroneous segment and the vacant position it is not limited to use the maximum posterior probability or the minimum Hamming distance, and those skilled in the art may also embody the error-containing segment by other similar parameters.
  • the matching weight of the free position it is not limited to use the maximum posterior probability or the minimum Hamming distance, and those skilled in the art may also embody the error-containing segment by other similar parameters.
  • the matching weight of the free position it is not limited to use the maximum posterior probability or the minimum Hamming distance, and those skilled in the art may also embody the error-containing segment by other similar parameters.
  • the best matching result is determined according to the weight matrix, which specifically includes:
  • the graph is called a bipartite graph; further, if each of X The vertices are connected to each vertex of Y, which is called a complete bipartite graph.
  • V a set of vertices
  • E a set of certain unordered pairs of elements in V, called a set of edges.
  • M be a subset of E. If any two sides of M are not adjacent, then M is called a match of G; the endpoint of the edge in the matching M is called M-saturation point, and the other vertex is called M-unsaturated point.
  • each vertex in G is an M-saturation point, that is, the matching M pairs all the vertices in G, then M is said to be a perfect match of G; and if there is no other match M' in G, so
  • M be a match of G
  • M's M interlace means a path whose edges alternate in E ⁇ M (E ⁇ M means belonging to set E but not M) and M.
  • E ⁇ M means belonging to set E but not M
  • M Zeng Guang Road means that the starting point and the end point are M-unsaturated M-interlaced roads.
  • G be a bipartite graph with two partitions (X, Y), then G has a saturated X match if and only if Where N(S) represents the set of all neighbors of S.
  • Step 1 If
  • Step 2 If M saturates X, stop and output M; otherwise, take an M non-saturation point x in X, and record S: ⁇ x ⁇ ,
  • Step 3 If Then stop, there is no match of saturation X in G (due to
  • -1). Otherwise, obtain an M augmentation path P(x,y), and let M: M ⁇ E(P), and go to step 2.
  • Step 1 Let a match M of G, let the set of M non-saturation points in X be A.
  • the algorithm repeatedly searches for the M augmentation path, increases the matching edge, and reduces the M non-saturation point until there is no augmentation path, and the maximum matching of G is obtained.
  • the KM algorithm was independent of Kuhn and Munkres in 1955 and 1957 respectively. It is a good algorithm for solving the optimal allocation problem. It was later called the Kuhn-Munkres algorithm and the KM algorithm.
  • viable vertex markers exist, such as commonly used viable vertex markers.
  • any feasible vertex label of the weighted bipartite graph G (such as the above-mentioned commonly used viable vertex labels) is given, then the equal subgraph G l is determined, and the Hungarian algorithm is executed in G l . If a perfect match is found in G l , it is the perfect match of G's maximum weight. Otherwise, the Hungarian algorithm ends in And as shown in picture 2. Let the currently found match be M.
  • ⁇ l min ⁇ l(x)+l(y)-w(xy)
  • Step 2 Start with any feasible vertex label l of G (such as the commonly available vertex markers mentioned earlier in this section) and find the equal subgraph G l .
  • Step 3 Execute the Hungarian algorithm in G l . If a perfect match M of G l is obtained, output M (M is the perfect match of G's maximum weight, delete the edge with the weight of 0 and its endpoint, That is, the maximum weight of the original graph is matched), the algorithm stops; otherwise, the Hungarian algorithm must terminate in two sets. Make At this point, turn to the next step.
  • Step 4 Calculate ⁇ l according to formula (20), calculate the new feasible vertex label l′ of G according to formula (21), replace l with l′, replace G l with G l , and turn to step 3.
  • the matching weights (which can be the matching probability or the Hamming distance) of all the missing packets and all the missing segments on the TCP connection can be used to form a weight matrix of the bipartite graph.
  • the KM algorithm finds the corresponding maximum weight matching, that is, the matching between the missing segment and the error-containing segment, and then puts the data carried by the error-containing segment matching the missing segment into the The location in the TCP connection corresponding to the missing segment, that is, the fault-tolerant restoration of all connections is completed.
  • a TCP packet (message) that does not pass the check or cannot be delivered because it contains an incorrect IP address, port number, or sequence number is called an error-containing segment (as shown in FIG. 3a).
  • an error-containing segment (as shown in FIG. 3a).
  • the location where the TCP packet should have been received is not received as a vacant location (e.g., message 2' and message 5' in Figure 3a).
  • the error message segment may be in the header parsing error, the segment where the segment is located cannot be determined, or the result of the header parsing conflicts with the header parsing result of other segments.
  • the conflicting segments are all containing the wrong segment.
  • the headers of packets 2 and 5 cannot be parsed, or the parsing results of packets 2 and 5 indicate that they are reports. Text 2 or both indicate that they are message 5.
  • the address, port number, sequence number or combination of the error-containing segment with one or the combination of the address, port number, sequence number or combination of the vacant segments is regarded as a bipartite graph in the graph theory (eg 2, 5 and 2', 5 'Composed bipartite graphs.'
  • the matching probability method or the minimum Hamming distance method is used to calculate the matching weights for all the vacant positions.
  • a is the matching weight of 2 and 2'
  • b is the matching weight of 2 and 5'
  • c is the matching weight of 5 and 2'
  • d is the matching weight of 5 and 5'.
  • the KM algorithm is used to find the best match between the address, port number, and the address, port number, and sequence number of the error message. That is, 2 should be matched with 2' or 5', and 5 should match 2' or 5'.
  • the data part carried by the error-containing segment matching the vacant position is placed in the spare position to complete the fault-tolerant restoration work. For example, by calculating 2 and 2' matches, 5 and 5' match, as shown in Figure 3b.
  • the simulation experiment simulates the fault-tolerant method, and simulates and compares the fault-tolerant effect when the TCP segment carries 1460 bytes of length data and 240 bytes of data and the fault-tolerant effect when using statistical inference fault-tolerant method. Simulation results As shown in Figure 4, the simulation environment is as follows:
  • the quaternion data is collected from the real network data received by the node in the real network for a period of time. Let the four fields of the quad (C sip , C dip , C spt , C dpt ) randomly take values from the sample values of the IP address and port number sample value files. Using the experimental samples, four different sets of quads (C sip , C dip , C spt , C dpt ) are randomly generated to simulate four TCP data streams in the real network, and then C ack is randomly generated for each data stream.
  • the field and the C seq field of the first TCP segment, the number of segments of each data stream is randomly generated from 40-200, and the C seq field of other TCP segments on each data stream can be obtained according to the algebraic relationship.
  • C sip is required to be different from C dip
  • C spt is different from C dpt .
  • the quaternion tuple randomly generates a Cack field and a C seq field of the first TCP segment to determine the correct location for each TCP packet (message) carrying data.
  • the fault-tolerant reduction method based on KM algorithm has better fault-tolerant effect than the fault-tolerant reduction method based on statistical reasoning.
  • FIG. 4 in the case of a bit error rate of 0.0005, if a fault-tolerant reduction method based on statistical reasoning is adopted, about 80% of the TCP segments carrying the 1460 bytes of data are not restored to the TCP segment. The correct location of the corresponding TCP connection, and if the fault-tolerant restoration method based on the KM algorithm is adopted, all the TCP segments can be restored to the correct position of the corresponding TCP connection, and the fault tolerance effect is good. However, when all segments are all wrong, the fault-tolerant restoration method based on the KM algorithm will lose its effect. This is because, when all the segments of a TCP connection are all wrong, any information of the connection will not be known by the receiver, and the error message cannot find a matching target, so the KM algorithm fails.
  • An embodiment of the present invention further provides a network node, as shown in FIG. 5, including:
  • the receiving unit 501 is configured to receive the segment sent by the sending end, and determine the error-containing segment in the packet;
  • a determining unit 502 configured to determine a vacant location formed by a missing segment after performing a data connection on the correct segment
  • the matching unit 503 is configured to match the error-containing segment and the vacant location to form a complete packet.
  • the matching unit 503 is specifically configured to:
  • the data with the wrong segment is connected to the corresponding vacant position to form a complete packet.
  • the matching unit 503 determines the maximum matching result of the bipartite graph of the set A and the set B, and specifically includes:
  • the best match result is determined based on the weight matrix.
  • the matching unit 503 determines the matching weights of all the vacant positions for each of the erroneous segments, including:
  • the matching weight of all the vacant positions is determined as the maximum posterior probability or the minimum Hamming distance of the error-containing segment and the corresponding vacant position.
  • the matching unit 503 determines the best matching result according to the weight matrix, which specifically includes:
  • a best match result is determined based on the new weight matrix.
  • the embodiment of the present invention further provides a network node, as shown in FIG. 6, comprising: a sensor module 601, a processor module 604, a wireless communication module 602, and an energy supply module 603, wherein:
  • a sensor module 601 configured to perform information collection and data conversion in an area
  • a wireless communication module 602 configured to perform wireless communication with other network nodes
  • An energy supply module 603, configured to provide energy to the sensor module 601, the processor module 604, and the wireless communication module 602;
  • the processor module 604 is configured to control the sensor module 601, the wireless communication module 602, and the energy supply module 603, and after the wireless communication module 602 receives the segment, determine the error-containing segment therein, and determine the correct report. After the data segment is connected, the vacant position formed by the missing segment, and the matching error message segment and the vacant position form a complete message.
  • the processor module 604 matches the error-containing segment and the vacant position to form a complete packet, which specifically includes:
  • the data with the wrong segment is connected to the corresponding vacant position to form a complete packet.
  • the processor module 604 determines the maximum matching result of the bipartite graph of the set A and the set B, which specifically includes:
  • the best match result is determined based on the weight matrix.
  • an embodiment of the present invention further provides a network node, including:
  • the processor 701 is configured to read a program in the memory 702 and perform the following process:
  • the receiver 703 is configured to receive data under the control of the processor 701.
  • the bus architecture may include any number of interconnected buses and bridges, specifically linked by one or more processors represented by processor 701 and various circuits of memory represented by memory 702.
  • the bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein.
  • the bus interface provides an interface.
  • Receiver 703 provides means for communicating with various other devices on a transmission medium.
  • the processor 701 is responsible for managing the bus architecture and general processing, and the memory 702 can store data used by the processor 701 in performing operations.
  • the processor 701 is specifically configured to:
  • the data with the wrong segment is connected to the corresponding vacant position to form a complete packet.
  • the processor 701 determines the maximum matching result of the bipartite graph of the set A and the set B, which specifically includes:
  • the best match result is determined based on the weight matrix.
  • the processor 701 determines, for each of the error-containing segments, the matching weights of all the vacant positions, including:
  • the matching weight of all the vacant positions is determined as the maximum posterior probability or the minimum Hamming distance of the error-containing segment and the corresponding vacant position.
  • the processor 701 determines the best matching result according to the weight matrix, which specifically includes:
  • a best match result is determined based on the new weight matrix.
  • the embodiment of the invention provides a fault-tolerant method for transmitting a message of a network node and a network node. After receiving a segment sent by the sender, the network node determines the error-containing segment and determines the data for the correct segment. After the connection, due to the vacant position formed by the missing segment, the error message segment and the vacant position are matched to form a complete message, and no retransmission is needed, which improves the communication efficiency of the network node and reduces the network node. Communication energy consumption.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the present invention may employ one or more computers having computer usable program code embodied therein. The form of a computer program product embodied on a storage medium, including but not limited to disk storage, CD-ROM, optical storage, and the like.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请公开了一种网络节点的报文传输的容错方法及网络节点，涉及通信技术，网络节点接收发送端发送的报文段后，确定其中的含错报文段，并确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置，对含错报文段和空余位置进行匹配，即可形成完整报文，不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。

Description

一种网络节点的报文传输的容错方法及网络节点
本申请要求在2013年10月9日提交中国专利局、申请号为201310468469.3、发明名称为“一种网络节点的报文传输的容错方法及网络节点”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明涉及通信技术，尤其涉及一种网络节点的报文传输的容错方法及网络节点。
背景技术
无线传感器网络这种新型网络节点通常由电池供电，当电池电量耗尽时，该网络节点即失效，所以需要尽量节省耗电，同时，为节省耗电，则可能降低这种网络节点的网络数据传输的可靠性，所以需要提高这种网络节点的容错性。
无线传感器网络与无线通信网络有着较大的区别，无线通信网络的主要功能是提供网络的互联、互通和互操作，为数据提供正确、可靠的传输，而无线传感器网络则以数据的采集、处理为中心，因此当前有关无线网络通信网络容错技术不能完全照搬应用于无线传感器网络，必须针对无线传感器网络的特点进行研究。
无线数据传输数据帧中通常包含报头与实际数据，在报头中包含地址信息，报头在传输过程中发生错误的数据帧会导致其所携带的实际数据无法传输到正确的位置或与其它数据帧在位置上发生冲突。例如采用传输控制协议/网际协议(Transmission Control Protocol/Internet Protocol，TCP/IP)协议传输的无线传感器网络的数据帧格式为：帧头+IP头+TCP头+实际数据+帧尾，其中帧头包括源和目标主机媒体接入控制(Media Access Control，MAC)地址及类型，IP头包括源和目标主机IP地址，TCP头包括源和目标主机端口号、顺序号、确认号、校验字等，实际数据是要传输数据的主体，帧尾是校验字。帧头、IP头、TCP头构成报头，报头中帧头、IP头、TCP头的任意一个出现错误，都可能导致接收端不能正确拼接报文，即，当报头在传输过程中发生错误时，会导致其所携带的实际数据无法传送到正确的位置，包括实际数据无处可放以及本数据帧安放数据的位置与其他数据帧发生冲突。目前解决这种差错控制的方法通常采用自动重传请求(Automatic Repeat-reQuest，ARQ)。
自动重传请求，发送端对发送序列进行纠错编码和检验，接收端根据校验序列的编码规则判断是否传错，并把判断的结果通过反馈信道传回给发送端。如果没有错，接收端就确认接收，发送端清除缓冲器的内容；如果有错，则接收端拒绝接收，同时向发送端发送重新发送该序列的命令，直到接收端接收正确为止。该方法的通信信道的利用率均不高， 也就是说，信道还远远没有被数据比特填满，有较长的传输时延并且带来较大的通信开销和通信能耗，当信道环境较差的时候，消耗大量的能量，加快网络节点的能量消耗，缩短了网络节点的生存时间。
发明内容
本发明实施例提供一种网络节点的报文传输的容错方法及网络节点，以提高网络节点的通信效率，减小网络节点的通信能耗。
本发明实施例提供的一种网络节点的报文传输的容错方法，包括：
接收发送端发送的报文段，并确定其中的含错报文段；
确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置；
匹配所述含错报文段和所述空余位置，形成完整报文。
由于对含错报文段和空余位置进行匹配，形成了完整报文，不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。
进一步，为提高匹配的准确性，所述匹配所述含错报文段和所述空余位置，形成完整报文，具体包括：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据所述二分图最大匹配结果，将所述含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高匹配的准确性，所述确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据所述权值矩阵，确定最佳匹配结果。
较佳的，所述对每个含错报文段，分别确定其对所有空余位置的匹配权值，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值为该含错报文段与相应空余位置的最大后验概率或最小汉明距离。
具体的，当通过确定最小汉明距离的方法确定含错报文段和空余位置的匹配权值时，所述根据所述权值矩阵，确定最佳匹配结果，具体包括：
对所述权值矩阵中的各个元素取反，确定新的权值矩阵；
根据所述新的权值矩阵，确定最佳匹配结果。
本发明实施例提供一种网络节点，包括：
接收单元，用于接收发送端发送的报文段，并确定其中的含错报文段；
确定单元，用于确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置；
匹配单元，用于匹配所述含错报文段和所述空余位置，形成完整报文。
该网络节点中的匹配单元对含错报文段和空余位置进行匹配，形成了完整报文，不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。
进一步，为提高匹配的准确性，所述匹配单元具体用于：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据所述二分图最大匹配结果，将所述含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高匹配的准确性，所述匹配单元确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据所述权值矩阵，确定最佳匹配结果。
本发明实施例还提供一种网络节点，包括：传感器模块、处理器模块、无线通信模块和能量供应模块，其中：
传感器模块，用于在区域内进行信息采集和数据转换；
无线通信模块，用于与其它网络节点进行无线通信；
能量供应模块，用于向传感器模块、处理器模块、无线通信模块提供能量；
处理器模块，用于对传感器模块、无线通信模块和能量供应模块进行控制，并在所述无线通信模块接收到报文段后，确定其中的含错报文段，确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置，以及匹配所述含错报文段和所述空余位置，形成完整报文。
该网络节点中的处理器模块对含错报文段和空余位置进行匹配，形成了完整报文，不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。
进一步，为提高匹配的准确性，所述处理器模块匹配所述含错报文段和所述空余位置，形成完整报文，具体包括：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据所述二分图最大匹配结果，将所述含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高匹配的准确性，所述处理器模块确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据所述权值矩阵，确定最佳匹配结果。
本发明实施例还提供一种网络节点，包括：
处理器，用于读取存储器中的程序，执行下列过程：
通过接收机接收发送端发送的报文段，并确定其中的含错报文段；确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置；匹配含错报文段和空余位置，形成完整报文；
所述接收机，用于在所述处理器的控制下接收数据。
进一步，为提高匹配的准确性，所述处理器具体用于：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据二分图最大匹配结果，将含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高匹配的准确性，所述处理器确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据权值矩阵，确定最佳匹配结果。
较佳的，所述处理器对每个含错报文段，分别确定其对所有空余位置的匹配权值，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值为该含错报文段与相应空余位置的最大后验概率或最小汉明距离。
当通过确定最小汉明距离的方法确定含错报文段和空余位置的匹配权值时，所述处理器根据所述权值矩阵，确定最佳匹配结果，具体包括：
对所述权值矩阵中的各个元素取反，确定新的权值矩阵；
根据所述新的权值矩阵，确定最佳匹配结果。
本发明实施例提供一种网络节点的报文传输的容错方法及网络节点，网络节点接收发送端发送的报文段后，确定其中的含错报文段，并确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置，对含错报文段和空余位置进行匹配，即可形成完整报文，不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。
附图说明
图1为本发明实施例提供的网络节点的报文传输的容错方法流程图；
图2为本发明实施例提供的KM算法原理示意图；
图3a为本发明实施例提供的网络节点的报文传输错误示意图；
图3b为本发明实施例提供的网络节点的报文传输错误匹配示意图；
图4为本发明实施例提供的网络节点的报文传输的容错方法仿真图；
图5为本发明实施例提供的网络节点示意图之一；
图6为本发明实施例提供的网络节点示意图之二；
图7为本发明实施例提供的网络节点示意图之三。
具体实施方式
本发明实施例提供一种网络节点的报文传输的容错方法及网络节点，网络节点接收发送端发送的报文段后，确定其中的含错报文段，并确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置，对含错报文段和空余位置进行匹配，即可形成完整报文，也不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。
如图1所示，本发明实施例提供的网络节点的报文传输的容错方法，包括：
步骤S101、接收发送端发送的报文段，并确定其中的含错报文段；
步骤S102、确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置；
步骤S103、匹配含错报文段和空余位置，形成完整报文。
由于在接收到报文后，将含错报文段和正确报文连接后形成的空余位置进行了匹配，所以可以直接得到完整报文，不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。
无线数据传输数据帧中通常包含报头与实际数据，在报头中包含地址信息，报头在传输过程中发生错误的数据帧会导致其所携带的实际数据无法传输到正确的位置或与其它数据帧在位置上发生冲突。这里将报头地址发生错误的数据帧称为含错报文；由于报头发生错误，本应接收数据而没有接收到数据的位置或发生冲突的位置称为空余位置。
其中，为更准确的将含错报文段和空余位置进行匹配，步骤S103中，匹配含错报文段和空余位置，形成完整报文，具体包括：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据二分图最大匹配结果，将含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高含错报文段和空余位置匹配的准确性，确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据权值矩阵，确定最佳匹配结果。
其中，对每个含错报文段，分别确定其对所有空余位置的匹配权值，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值为该含错报文段与相应空余位置的最大后验概率或最小汉明距离。
例如：可以针对地址、端口号、顺序号中任一或组合，来确定含错报文段和空余位置的匹配权值，即接收到到含错报文段中地址、端口号、顺序号中任一或组合与空余位置的相应内容的最大后验概率或最小汉明距离。
当然，在确定含错报文段和空余位置的匹配权值时，并不限于使用最大后验概率或最小汉明距离，本领域技术人员也可以通过其他类似参数来体现含错报文段和空余位置的匹配权值。
当通过确定最小汉明距离的方法确定含错报文段和空余位置的匹配权值时，根据权值矩阵，确定最佳匹配结果，具体包括：
对权值矩阵中的各个元素取反，确定新的权值矩阵；
根据新的权值矩阵，确定最佳匹配结果。
下面，对二分图匹配原理进行详细说明：
若图的顶点集分为两个非空子集X和Y，并且每条边都有一个顶点在X中，另一个顶点在Y中，则称此图为二分图；进一步，若X的每个顶点都和Y的每个顶点相连，则称为完全二分图。
图可以表示为G＝(V，E)这种形式，其中集合V称为顶点集，集合E是V中元素组成的某些无序对的集合，称为边集。设M是E的子集，如果M中任何两边都不邻接，则称M为G的一个匹配；在匹配M中边的端点称为M-饱和点，其他顶点称为M-未饱和点。进一步，若G中每个顶点都是M-饱和点，即匹配M将G中所有顶点配成对，则称M为G的完美匹配；而若G中不存在另一个匹配M’，使得|M’|>|M|，则称M为最大匹配。
设M是G的匹配，G的M交错路是指其边在E\M(E\M表示属于集合E但不属于M)和M中交替出现的路。M增广路是指起点和终点都是M未饱和的M交错路。
匈牙利算法：
匈牙利算法由匈牙利数学家Egervary首次提出，后来由Edmonds(1965)进行了改进。这种算法既能判定一个二分图G＝(X，Y)是否存在饱和X的匹配，又能在存在的情况下求出一个饱和X的匹配。
(一)理论基础
1、Berge定理：G的匹配M是最大匹配的充要条件是G中不存在M增广路。
2、Hall定理：设G是具有二划分(X，Y)的二分图，则G有饱和X的匹配当且仅当对
Figure PCTCN2014088136-appb-000001
其中N(S)表示S的所有邻点之集。
(二)算法思想
从二分图G＝(X，Y)的任何匹配M开始，若M饱和X，则算法结束；若M不饱和X，在X中选择一个M不饱和点x。若G中不存在以x为起点的M增广路，则可找到与x由M交错路相连的顶点集合A，而S＝A∩X满足|N(S)|<|S|，此时由Hall定理，G不存在饱和X的匹配。若存在以x为起点的M增广路P，则由Berge定理知M不是最大匹配，且M'＝M⊕E(P)是比M更大的匹配，用M’替代M。反复进行上述过程，使匹配的边数逐步增加，直至得到|X|条匹配边为止。
(三)算法步骤
输入：二分图G＝(X，Y)。
输出：G的一个饱和X的匹配。
第1步：若|X|>|Y|，则G中不存在饱和X的匹配，停止。否则，任取G的一个匹配M。
第2步：若M饱和X，则停止，输出M；否则，取X中一个M非饱和点x，记S：{x}，
Figure PCTCN2014088136-appb-000002
第3步：若
Figure PCTCN2014088136-appb-000003
则停止，G中不存在饱和X的匹配(因|N(S)|≤|T|＝|S|-1<|S|)；否则取y∈N(S)-T。
第4步：若y是M饱和的，设yz∈M，令S:＝S∪{z}，T:＝T∪{y}，转第3步(此时仍保持|T|＝|S|-1)。否则，获得一条M增广路P(x，y)，令M:＝M⊕E(P)，转第2步。
注：当|X|＝|Y|时，上述算法所求的就是二分图G＝(X，Y)的完美匹配。
(四)求二分图最大匹配的匈牙利算法
输入：二分图G＝(X，Y)。
输出：G的一个最大匹配。
第1步：任取G的一个匹配M，设X中M非饱和点的集合为A。
第2步：若
Figure PCTCN2014088136-appb-000004
则停止，输出当前的M(最大匹配)；否则，任取x∈A(一个M非饱和点)，记S:＝{x}，
Figure PCTCN2014088136-appb-000005
转下步。
第3步：若
Figure PCTCN2014088136-appb-000006
则不存在从x出发的M增广路，令A:＝A-{x}，转第2步；否则，取y∈N(S)-T，转下步。
第4步：若y是M饱和的，设yz∈M，令S:＝S∪{z}，T:＝T∪{y}，转第3步。否则，获得一条M增广路P(x，y)，令M:＝M⊕E(P)，A:＝A-{x,y}，转第2步。
算法通过第2步至第4步的循环，反复寻找M增广路，增加匹配边，减少M非饱和点，直至不存在增广路为止，此时便得到G的最大匹配。
KM算法是Kuhn和Munkres分别于1955年和1957年独立出来的，它是一个解决最优分配问题的好算法，后来被称为Kuhn-Munkres算法，简记KM算法。
(一)理论基础
1、可行顶点标号与相等子图
设有二分类(X，Y)的赋权二分图G＝(V，E)，其中两部顶点集分别为X＝{x1,x2,…,xn}，Y＝{y1,y2,…,yn}，并且给任意边xiyj赋权wij＝w(xiyj)。设L为二分图G的顶点集V到实数集R的映射，若对任意x∈X，y∈Y，均有L(x)+L(y)≥w(x,y)，则称L为G的可行顶点标记；令EL＝{xy|e＝xy∈E(G)，且L(x)+L(y)＝w(e)}，则称以EL为边集的二分图G的生成子图为G的相等子图，简记为GL。
显然，可行顶点标记是存在的，例如常用的可行顶点标记
Figure PCTCN2014088136-appb-000007
2、定理：设l是赋权二分图G的一个可行顶点标号。若相等子图Gl有完美匹配M*，则M*是G的最大权完美匹配。
(二)算法思想
首先给出赋权二分图G的任意一个可行顶点标号(如上述常用的可行顶点标记)，然后决定相等子图Gl，在Gl中执行匈牙利算法。若在Gl中找到完美匹配，它就是G的最大权完美匹配。否则，匈牙利算法终止于
Figure PCTCN2014088136-appb-000008
且
Figure PCTCN2014088136-appb-000009
如图2所示。设当前找到的匹配为M。
令：
αl＝min{l(x)+l(y)-w(xy)|x∈S,y∈Y-T}  公式(20)；
对每个顶点u，修改其标号如下：
Figure PCTCN2014088136-appb-000010
   公式(21)；
可以检验l'仍是G的一个可行顶点标号。用l'替代l，获得新的相等子图Gl'。
注意S与T间及X-S与Y-T间每条边的端点标号之和未变，因而原来在相等子图中的边仍会保留在新标号下的相等子图中；S与Y-T间的边原来都不在相等子图中，修改标号后，每条边的端点标号之后减小αl，因而至少有一条边进入新的相等子图；T与X-S间每条边的端点标号之和增加αl，可能有一些原来属于相等子图的边会退出新的相等子图，但这些边中不会有原相等子图的匹配M中的边。因此，M中的边全在新的子图Gl'中，且Gl'中有M增广路，因而可得到更大的匹配。
反复进行上述过程，直到获得一个相等子图含有完美匹配为止。
(三)算法步骤
输入：二分图G＝(X，Y)及各边上的权(矩阵)。
输出：G的最大权匹配。
第1步：给G＝(X，Y)添加一些顶点和权为0的边，使其成为赋权完全二分图，仍记为G。
第2步：从G的任一可行的顶点标号l(比如本节前面提到的常用可行顶点标记)开始，求出相等子图Gl。
第3步：在Gl中执行匈牙利算法，如果求得Gl的一个完美匹配M，则输出M(M即为G的最大权完美匹配，删去其中权为0的边及其端点后，即得原始图的最大权匹配)，算法停止；否则，匈牙利算法必终止于两个集合
Figure PCTCN2014088136-appb-000011
使得
Figure PCTCN2014088136-appb-000012
此时转下步。
第4步：按公式(20)计算αl，按公式(21)计算G的新的可行顶点标号l'，以l'替代l，Gl'替代Gl，转第3步。
经过上面的分析与介绍，可以将所有含错报文与所有TCP连接上缺失的报文段的匹配权值(可以是匹配概率，也可以是汉明距离)组成一个二分图的权矩阵，利用KM算法求出对应的最大权匹配，也就是缺失的报文段与含错报文段之间的匹配，然后，将与缺失报文段匹配的含错报文段所携带的数据放入该缺失报文段对应的TCP连接中的位置，即完成了对所有连接的容错还原工作。
例如，如图3a所示，将因为包含错误IP地址、端口号或顺序号而并未通过校验或无法送达的TCP分组(报文)，称为含错报文段(如图3a中报文2和报文5)。因为含错报文段的存在，导致原本应该接收到TCP分组的位置没有接收到数据称之为空余位置(如图3a中报文2’和报文5’)。
实际情况中，含错报文段可能是报头解析出现错误，不能确定该报文段所在位置的报文段，也可能是报头解析的结果与其他报文段的报头解析的结果冲突，则认为冲突的报文段都是含错报文段，如图3a中，可能是报文2和报文5的报头都不能解析，或者是报文2和报文5的解析结果都表示自己是报文2或者都表示自己是报文5。
含错报文段的地址、端口号、顺序号之一或组合与空余位置的地址、端口号、顺序号之一或组合视为图论中的二分图(如2，5与2’，5’组成二分图)。对每个含错报文段运用匹配概率方法或者最小汉明距离方法计算得出其对所有空余位置的匹配权值
Figure PCTCN2014088136-appb-000013
其中a为2与2’的匹配权值，b为2与5’的匹配权值，c为5与2’的匹配权值，d为5与5’的匹配权值。运用KM算法求含错报文的地址、端口号以及顺序号和空余位置的地址、端口号以及顺序号的最佳匹配。即计算出2应该与2’还是5’匹配，5应该与2’还是5’匹配。
将与空余位置匹配的含错报文段所携带的数据部分，放置到空余位置，完成容错还原工作。例如通过计算2与2’匹配，5与5’匹配，即为图3b所示。
仿真实验对该容错方法进行了仿真，并对TCP报文段携带1460字节长度数据与240字节长度数据时的容错效果与采用统计推理容错方法时的容错效果进行了仿真与比较，仿真结果如图4所示，仿真环境如下：
四元组数据均采集于真实网络中节点在一段时间内接收的真实网络数据。令四元组(Csip，Cdip，Cspt，Cdpt)四个字段从IP地址及端口号样本值文件的样本值中随机取值。利用实验样本，随机生成4组不同的四元组(Csip，Cdip，Cspt，Cdpt)，以此模拟真实网络中的4条TCP数据流，再为每条数据流随机生成Cack字段和第一个TCP段的Cseq字段，每条数据流的报文段个数从40-200随机生成，每条数据流上其他TCP段的Cseq字段则可依据其代数关系而得到。这里要求Csip与Cdip不同，且Cspt与Cdpt不同。将上述生成的4条TCP数据流按一定误比特率加噪后，则生成仿真的接收数据。四元组元组随机生成Cack字段和第一个TCP段的Cseq字段确定了每个TCP分组(报文)携带数据对应的正确位置。
从图4可以看出，与基于统计推理的容错还原方法相比，基于KM算法的容错还原方法具有更好的容错效果。如图4所示，在误比特率为0.0005的情况下，如果采用基于统计推理的容错还原方法，携带1460字节数据的TCP报文段仍有80％左右的TCP报文段没有被还原到相应TCP连接的正确位置，而如果采用基于KM算法的容错还原方法，则可以将全部的TCP报文段还原到相应TCP连接的正确位置，容错效果较好。然而，当所有报文段全部错误时，基于KM算法的容错还原方法将失去作用。这是因为，当一条TCP连接的所有报文段全部错误时，该连接的任何信息都不会被接收方所知晓，错误报文找不到匹配目标，因此KM算法失效。
本发明实施例还提供一种网络节点，如图5所示，包括：
接收单元501，用于接收发送端发送的报文段，并确定其中的含错报文段；
确定单元502，用于确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置；
匹配单元503，用于匹配含错报文段和空余位置，形成完整报文。
进一步，为提高匹配的准确性，匹配单元503具体用于：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据二分图最大匹配结果，将含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高匹配的准确性，匹配单元503确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据权值矩阵，确定最佳匹配结果。
较佳的，匹配单元503对每个含错报文段，分别确定其对所有空余位置的匹配权值，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值为该含错报文段与相应空余位置的最大后验概率或最小汉明距离。
当通过确定最小汉明距离的方法确定含错报文段和空余位置的匹配权值时，匹配单元503根据所述权值矩阵，确定最佳匹配结果，具体包括：
对所述权值矩阵中的各个元素取反，确定新的权值矩阵；
根据所述新的权值矩阵，确定最佳匹配结果。
本发明实施例还提供一种网络节点，如图6所示，包括：传感器模块601、处理器模块604、无线通信模块602和能量供应模块603，其中：
传感器模块601，用于在区域内进行信息采集和数据转换；
无线通信模块602，用于与其它网络节点进行无线通信；
能量供应模块603，用于向传感器模块601、处理器模块604、无线通信模块602提供能量；
处理器模块604，用于对传感器模块601、无线通信模块602和能量供应模块603进行控制，并在无线通信模块602接收到报文段后，确定其中的含错报文段，确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置，以及匹配含错报文段和空余位置，形成完整报文。
进一步，为了提高匹配的准确性，处理器模块604匹配含错报文段和空余位置，形成完整报文，具体包括：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据二分图最大匹配结果，将含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高匹配的准确性，处理器模块604确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据权值矩阵，确定最佳匹配结果。
下面结合优选的硬件结构，对本发明实施例提供的网络节点的结构、处理方式进行说明。
如图7所示，本发明实施例还提供一种网络节点，包括：
处理器701，用于读取存储器702中的程序，执行下列过程：
通过接收机703接收发送端发送的报文段，并确定其中的含错报文段；确定对正确报 文段进行数据连接后由于报文段缺失形成的空余位置；匹配含错报文段和空余位置，形成完整报文；
接收机703，用于在处理器701的控制下接收数据。
其中，在图7中，总线架构可以包括任意数量的互联的总线和桥，具体由处理器701代表的一个或多个处理器和存储器702代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口提供接口。接收机703提供用于在传输介质上与各种其他装置通信的单元。处理器701负责管理总线架构和通常的处理，存储器702可以存储处理器701在执行操作时所使用的数据。
进一步，为提高匹配的准确性，处理器701具体用于：
确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
确定集合A和集合B的二分图最大匹配结果；
根据二分图最大匹配结果，将含错报文段的数据接入相应的空余位置，形成完整报文。
为更进一步提高匹配的准确性，处理器701确定集合A和集合B的二分图最大匹配结果，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值；
根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
根据权值矩阵，确定最佳匹配结果。
较佳的，处理器701对每个含错报文段，分别确定其对所有空余位置的匹配权值，具体包括：
对每个含错报文段，分别确定其对所有空余位置的匹配权值为该含错报文段与相应空余位置的最大后验概率或最小汉明距离。
当通过确定最小汉明距离的方法确定含错报文段和空余位置的匹配权值时，处理器701根据所述权值矩阵，确定最佳匹配结果，具体包括：
对所述权值矩阵中的各个元素取反，确定新的权值矩阵；
根据所述新的权值矩阵，确定最佳匹配结果。
本发明实施例提供一种网络节点的报文传输的容错方法及网络节点，网络节点接收发送端发送的报文段后，确定其中的含错报文段，并确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置，对含错报文段和空余位置进行匹配，即可形成完整报文，不需要进行重传，提高了网络节点的通信效率，减小了网络节点的通信能耗。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机 可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本发明的优选实施例，但本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例作出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。
显然，本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。这样，倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包含这些改动和变型在内。

Claims (11)

  1. 一种网络节点的报文传输的容错方法，其特征在于，包括：
    接收发送端发送的报文段，并确定其中的含错报文段；
    确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置；
    匹配所述含错报文段和所述空余位置，形成完整报文。
  2. 如权利要求1所述的方法，其特征在于，所述匹配所述含错报文段和所述空余位置，形成完整报文，具体包括：
    确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
    确定集合A和集合B的二分图最大匹配结果；
    根据所述二分图最大匹配结果，将所述含错报文段的数据接入相应的空余位置，形成完整报文。
  3. 如权利要求2所述的方法，其特征在于，所述确定集合A和集合B的二分图最大匹配结果，具体包括：
    对每个含错报文段，分别确定其对所有空余位置的匹配权值；
    根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
    根据所述权值矩阵，确定最佳匹配结果。
  4. 如权利要求3所述的方法，其特征在于，所述对每个含错报文段，分别确定其对所有空余位置的匹配权值，具体包括：
    对每个含错报文段，分别确定其对所有空余位置的匹配权值为该含错报文段与相应空余位置的最大后验概率或最小汉明距离。
  5. 如权利要求4所述的方法，其特征在于，当通过确定最小汉明距离的方法确定含错报文段和空余位置的匹配权值时，所述根据所述权值矩阵，确定最佳匹配结果，具体包括：
    对所述权值矩阵中的各个元素取反，确定新的权值矩阵；
    根据所述新的权值矩阵，确定最佳匹配结果。
  6. 一种网络节点，其特征在于，包括：
    接收单元，用于接收发送端发送的报文段，并确定其中的含错报文段；
    确定单元，用于确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置；
    匹配单元，用于匹配所述含错报文段和所述空余位置，形成完整报文。
  7. 如权利要求6所述的网络节点，其特征在于，所述匹配单元具体用于：
    确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
    确定集合A和集合B的二分图最大匹配结果；
    根据所述二分图最大匹配结果，将所述含错报文段的数据接入相应的空余位置，形成完整报文。
  8. 如权利要求7所述的网络节点，其特征在于，所述匹配单元确定集合A和集合B的二分图最大匹配结果，具体包括：
    对每个含错报文段，分别确定其对所有空余位置的匹配权值；
    根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
    根据所述权值矩阵，确定最佳匹配结果。
  9. 一种网络节点，其特征在于，包括：传感器模块、处理器模块、无线通信模块和能量供应模块，其中：
    传感器模块，用于在区域内进行信息采集和数据转换；
    无线通信模块，用于与其它网络节点进行无线通信；
    能量供应模块，用于向所述传感器模块、所述处理器模块、所述无线通信模块提供能量；
    处理器模块，用于对所述传感器模块、所述无线通信模块和所述能量供应模块进行控制，并在所述无线通信模块接收到报文段后，确定其中的含错报文段，确定对正确报文段进行数据连接后由于报文段缺失形成的空余位置，以及匹配所述含错报文段和所述空余位置，形成完整报文。
  10. 如权利要求9所述的网络节点，其特征在于，所述处理器模块匹配所述含错报文段和所述空余位置，形成完整报文，具体包括：
    确定所有含错报文段构成集合A，确定所有空余位置构成集合B；
    确定集合A和集合B的二分图最大匹配结果；
    根据所述二分图最大匹配结果，将所述含错报文段的数据接入相应的空余位置，形成完整报文。
  11. 如权利要求10所述的网络节点，其特征在于，所述处理器模块确定集合A和集合B的二分图最大匹配结果，具体包括：
    对每个含错报文段，分别确定其对所有空余位置的匹配权值；
    根据各个含错报文段和各个空余位置的匹配权值，确定权值矩阵；
    根据所述权值矩阵，确定最佳匹配结果。
PCT/CN2014/088136 2013-10-09 2014-10-08 一种网络节点的报文传输的容错方法及网络节点 WO2015051736A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310468469.3A CN104581772B (zh) 2013-10-09 2013-10-09 一种网络节点的报文传输的容错方法及网络节点
CN201310468469.3 2013-10-09

Publications (1)

Publication Number Publication Date
WO2015051736A1 true WO2015051736A1 (zh) 2015-04-16

Family

ID=52812526

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/088136 WO2015051736A1 (zh) 2013-10-09 2014-10-08 一种网络节点的报文传输的容错方法及网络节点

Country Status (3)

Country Link
CN (1) CN104581772B (zh)
TW (1) TWI516140B (zh)
WO (1) WO2015051736A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112528102A (zh) * 2020-12-15 2021-03-19 深圳供电局有限公司 一种基于布尔逻辑判断的规范词条匹配方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1225741A1 (en) * 2000-10-30 2002-07-24 Siemens Aktiengesellschaft High speed interconnection for embedded systems within a computer network
CN101026441A (zh) * 2006-02-24 2007-08-29 中芯国际集成电路制造(上海)有限公司 一种自动重发出错数据包的方法及重发缓冲器
CN101645766A (zh) * 2009-09-09 2010-02-10 成都市华为赛门铁克科技有限公司 实现数据包重发的方法、装置及系统
CN103176796A (zh) * 2013-02-04 2013-06-26 浙江大学 一种在autosar中实现复杂数据到信号组的映射方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102118267B (zh) * 2011-01-19 2016-11-23 刘敬梅 应用于多级功能节点冗余容错的路由装置和冗余容错系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1225741A1 (en) * 2000-10-30 2002-07-24 Siemens Aktiengesellschaft High speed interconnection for embedded systems within a computer network
CN101026441A (zh) * 2006-02-24 2007-08-29 中芯国际集成电路制造(上海)有限公司 一种自动重发出错数据包的方法及重发缓冲器
CN101645766A (zh) * 2009-09-09 2010-02-10 成都市华为赛门铁克科技有限公司 实现数据包重发的方法、装置及系统
CN103176796A (zh) * 2013-02-04 2013-06-26 浙江大学 一种在autosar中实现复杂数据到信号组的映射方法

Also Published As

Publication number Publication date
CN104581772A (zh) 2015-04-29
CN104581772B (zh) 2018-04-17
TW201519672A (zh) 2015-05-16
TWI516140B (zh) 2016-01-01

Similar Documents

Publication Publication Date Title
CN111512603B (zh) 一种数据传输方法及第一设备
CN100448224C (zh) 探索路径最大传输单元的方法和设备
US11381514B2 (en) Methods and apparatus for early delivery of data link layer packets
US9432251B2 (en) Enhanced acknowledgement and retransmission mechanism
JP4985565B2 (ja) 送受信回路、受信回路及び送受信回路の制御方法
EP4020864A1 (en) Scalable protocol-agnostic reliable transport
EP2978171B1 (en) Communication method, communication device, and communication program
CN103248467A (zh) 基于片内连接管理的rdma通信方法
JP6623137B2 (ja) 通信装置、コンピュータプログラムおよび無線通信システム
US11133980B2 (en) Detecting sources of computer network failures
US8976814B2 (en) Method of transporting data from sending node to destination node
JP2020515175A (ja) フィードバック情報送信方法およびデバイス
WO2018201960A1 (zh) 一种进行反馈的方法和设备
KR20120112981A (ko) 데이터 프레임의 재전송 감소 방법 및 이를 위한 수신 노드
US20090210770A1 (en) Method, system and computer program product for end to end error checking in ethernet
WO2015051736A1 (zh) 一种网络节点的报文传输的容错方法及网络节点
US8332707B2 (en) Method of transmission of large data amounts in sensor network based on MAC
Phung et al. Enhancing rest http with random linear network coding in dynamic edge computing environments
CN111385069A (zh) 数据传输方法及计算机设备
JP5998923B2 (ja) プログラム、情報処理装置、及び通信方法
US9008077B2 (en) Method for quick map recovery in case of error in MoCA
WO2022000208A1 (zh) 一种数据重传方法和装置
Henze A Machine-Learning Packet-Classification Tool for Processing Corrupted Packets on End Hosts
CN110138505B (zh) 一种异构协议转换的crc计算方法及系统
WO2020024814A1 (zh) 用于确定物理共享信道传输数据的方法和设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14852210

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14852210

Country of ref document: EP

Kind code of ref document: A1