CN115442000A - Transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network - Google Patents
Transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network Download PDFInfo
- Publication number
- CN115442000A CN115442000A CN202211027206.4A CN202211027206A CN115442000A CN 115442000 A CN115442000 A CN 115442000A CN 202211027206 A CN202211027206 A CN 202211027206A CN 115442000 A CN115442000 A CN 115442000A
- Authority
- CN
- China
- Prior art keywords
- data
- message
- messages
- service
- thread
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 73
- 230000005540 biological transmission Effects 0.000 title claims abstract description 62
- 230000006854 communication Effects 0.000 claims abstract description 55
- 238000004891 communication Methods 0.000 claims abstract description 54
- 238000012544 monitoring process Methods 0.000 claims abstract description 40
- 238000012545 processing Methods 0.000 claims abstract description 31
- 238000007781 pre-processing Methods 0.000 claims abstract description 15
- 230000008569 process Effects 0.000 claims description 42
- 238000012790 confirmation Methods 0.000 claims description 41
- 238000012546 transfer Methods 0.000 claims description 16
- 230000007246 mechanism Effects 0.000 claims description 12
- 230000004044 response Effects 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 11
- 238000004806 packaging method and process Methods 0.000 claims description 7
- 230000006837 decompression Effects 0.000 claims description 6
- 230000003044 adaptive effect Effects 0.000 claims description 5
- 238000007906 compression Methods 0.000 claims description 4
- 230000006835 compression Effects 0.000 claims description 4
- 230000006870 function Effects 0.000 claims description 4
- FFBHFFJDDLITSX-UHFFFAOYSA-N benzyl N-[2-hydroxy-4-(3-oxomorpholin-4-yl)phenyl]carbamate Chemical compound OC1=C(NC(=O)OCC2=CC=CC=C2)C=CC(=C1)N1CCOCC1=O FFBHFFJDDLITSX-UHFFFAOYSA-N 0.000 claims description 3
- 210000004460 N cell Anatomy 0.000 claims description 2
- 210000004027 cell Anatomy 0.000 claims description 2
- 238000013467 fragmentation Methods 0.000 claims description 2
- 238000006062 fragmentation reaction Methods 0.000 claims description 2
- 238000001914 filtration Methods 0.000 abstract description 6
- 238000011161 development Methods 0.000 abstract description 2
- 238000012163 sequencing technique Methods 0.000 abstract description 2
- 238000001514 detection method Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 108091081062 Repeated sequence (DNA) Proteins 0.000 description 2
- 238000011217 control strategy Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000003999 initiator Substances 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000002452 interceptive effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005215 recombination Methods 0.000 description 1
- 230000006798 recombination Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
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/1867—Arrangements specially adapted for the transmitter end
-
- 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
-
- 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/1806—Go-back-N protocols
-
- 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
- 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
- H04L1/1835—Buffer management
-
- 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
- H04L1/1835—Buffer management
- H04L1/1841—Resequencing
-
- 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/1867—Arrangements specially adapted for the transmitter end
- H04L1/1874—Buffer management
-
- 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/1867—Arrangements specially adapted for the transmitter end
- H04L1/188—Time-out mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/36—Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]
- H04L47/365—Dynamic adaptation of the packet size
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a transmission guarantee method and a system suitable for a low-bandwidth and easily-consumed ad hoc network, which comprises a data sender service part and a data receiver service part, wherein the data sender service part comprises a data service scheduling thread, a service data communication processing thread and a link quality monitoring thread; the data receiving party service comprises a data monitoring thread, a data preprocessing thread, a data distribution thread, a service data communication processing thread and a link quality monitoring thread, and the data messages are transmitted to the receiving end without repetition, loss and disorder through the measures of application layer retransmission, data message sequencing, repeated message filtering, link self-adaptive control and the like, so that reliable communication transmission under the weak network environment is realized. The invention is superior to the similar technical scheme in the aspects of performance, expansibility and development simplicity.
Description
Technical Field
The invention relates to a message and file transmission technology, in particular to a transmission guarantee method suitable for a low-bandwidth and easily-consumed ad hoc network.
Background
With the continuous development and evolution of domain-specific information systems, more and more network models become compatible targets of the systems. Due to the physical limitation of the devices and the influence of the actual complex environment, the networks have the characteristics of low bandwidth, high delay, instability, easy loss and the like, so that how to ensure the reliable transmission of data under the complex conditions becomes a problem which needs to be solved urgently.
The reliable communication transmission method adaptive to the weak network needs to be combined with the characteristics of the weak network, so that the channel utilization rate is improved as much as possible, and the smoothness of the network can be ensured. At present, the reliable transmission strategy under the weak network condition mainly comprises the following steps:
firstly, a data sending end sends a data packet, a data receiving end sends an acknowledgement packet to the data sending end when receiving the data packet, the data sending end sends the next data packet after receiving the acknowledgement packet, and if the data sending end does not receive the acknowledgement packet beyond a specific time, the data packet is retransmitted. By combining the characteristics of high delay and low bandwidth of the weak network, the acknowledgement response of the data packet under the strategy consumes a large amount of time, and the one-to-one corresponding acknowledgement mechanism occupies a certain proportion of bandwidth.
Secondly, a strategy for sending the redundant packets is adopted to guarantee reliable transmission, the same data packet is sent for multiple times, response does not need to wait, and bandwidth occupied by the response packet is reduced, so that the channel utilization rate is high, the transmission rate is high, but a large number of redundant data packets exist on the channel, certain challenges exist on the bandwidth, a confirmation mechanism is lacked, and if a plurality of packets of data are lost, the possibility of transmission failure still occurs, so that the strategy cannot objectively guarantee reliable communication transmission.
Thirdly, the lack of necessary flow control or flow control strategy is not suitable for weak network environment, data transmission in the weak network environment, and if the lack of flow control is caused, network congestion may occur, and even the network environment is crashed. The traditional flow control adjusts the transmission speed at two ends of information exchange based on the window size, and the strategy effectively solves the problem of IO buffer overflow during big data exchange, but is not suitable for data exchange in the weak network environment, because the data transmission speed under the weak network condition is usually obviously lower than the processing speed of data at two ends, and is generally only used for transmitting texts, voice, small files and the like.
In summary, the conventional reliable transmission schemes all involve a large amount of handshake acknowledgements or redundant data, which has a large disadvantage in a network environment with large fluctuation and weak signal, and therefore, it is necessary to research a reliable transmission strategy compatible with a weak network.
Disclosure of Invention
The invention aims to provide a transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc networks.
The technical solution for realizing the purpose of the invention is as follows: a transmission guarantee method suitable for low bandwidth and vulnerable ad hoc network comprises a data sender service part and a data receiver service part, wherein the data sender service part comprises a data service scheduling part, a service data communication processing part, a link quality monitoring part and an IO event processor; the data receiver service comprises data monitoring, data preprocessing, data distribution, service data communication processing, link quality monitoring and IO event processor. The data transmission communication process comprises the following steps:
process 1: the data service scheduling thread of the data sender detects the occurrence of a service to be executed, and a service data communication processing thread and a link quality monitoring thread are sequentially established;
and (2) a process: and the data sending party service data communication processing thread completes initialization, performs cutting, compression and encryption preprocessing on service data to be executed, sorts the processed data packets, encapsulates the packet sequence into a service data message, and delivers the service data message to the IO event processor to queue for transmission. If the data message needs to be responded and confirmed, a timer is started, and if the data message does not receive the confirmed message before timeout, retransmission operation is carried out;
and 3, process: the link quality monitoring thread of a data sending party is responsible for packaging a link quality monitoring type data message, delivering the data message to an IO event processor, detecting the state of a link in real time, detecting important link quality data such as maximum effective load (MTU), calculating packet loss rate and the like besides collecting link real-time delay (RTT) key data by the link quality monitoring thread, and synchronizing the data to a retransmission mechanism and link adaptive control;
and 4, process 4: a data monitoring thread resident in a background of a data receiver monitors data received by an IO event processor;
and (5) a process: the data receiving party firstly sequences and filters the data through the data preprocessing thread, filters and discards the messages with repeated sequence numbers, and simultaneously shares the data to the data distribution thread in sequence according to the sequence numbers;
and 6, a process: the data distribution thread receives the data message, reads the data message type, and distributes the data message type to a corresponding processing thread, wherein the data message type comprises a service data type and a link quality monitoring type;
and a process 7: if the data type is the service data type, the data is distributed to a service data processing thread, the service data processing thread de-encapsulates the data message, the data domain is taken out, decompression and decryption operations are carried out, so that original data are obtained, and finally the original data are stored or reported; if the link quality monitoring type message is the link quality monitoring type message, the link quality monitoring type message is distributed to a link quality monitoring thread to finish de-encapsulation, decompression and decryption operations, and original data is taken out;
and (8) a process: and after the data receiver service data processing thread processes the data message, if a confirmation operation is needed, the packaging response message is delivered to the IO event processor to be queued for transmission.
Further, the retransmission mechanism agrees that the data packets exchanged between the data sender and the data receiver are divided into two types, namely packets requiring response and packets not requiring response, and the specific process is as follows:
the data sending party obtains complete data of a service to be executed, firstly, the data is cut and encapsulated into data messages in sequence, the messages containing the data content of the service to be executed are all messages without response, in addition, the data sending party inserts a request confirmation message every N data messages, and the message contains the serial number S of the next data message n (S≥0，n∈N + ) The messages are all messages needing to be responded, and the two types of messages form all messages of one-time communication service. The data transmitting side transmits N data messages and a request confirmation message, which are called a data exchange stage, each communication service comprises at least one stage, and the data transmitting side firstly stores two types of messages in a transmitting buffer zone in sequence in each stage.
The data sending party traverses the sending buffer area and sends the messages in sequence, and the data receiving party receives the messages and records the message sequence numbers. When the sent message is a message without response, the next message can be directly sent continuously until N data messages are continuously sent, the data sending party sends a request confirmation message, the data sending party starts a timer, and the timeout time T is set. And if the message confirmed by the data receiver is not received before timeout, retransmitting the request confirmation message, and repeating the retransmission for at most R times. If the message confirmed by the data receiver is received before timeout, the situation is as follows:
the sender requests to confirm that the message contains the initial sequence number S of the next stage message n The data receiver records the sequence number of the data message received in this stage as a set G n (
And S n-1 ≤g<S n ) Then set { S n-1 ，S n-1 +1，S n-1 +2,……,S n -2，S n -1} subtracting the set G n The obtained difference set isAnd packaging the message serial number lost in the current stage into a confirmation message, and replying the confirmation message to the data sending party (the confirmation message is a message which does not need to be responded). After receiving the confirmation message, the data sender firstly analyzes the lost sequence number in the message, then traverses the sending buffer area, clears the message which does not appear in the lost set from the buffer area, then re-executes the sending process of the current stage until the sending buffer area is cleared finally, and executes the sending process of the next stage.
Repeating the above process until all the stages of one communication service data exchange are completed, and marking that one communication service is completed.
Further, the sorting and filtering of the data includes the following specific processes:
aiming at the problems of packet out-of-sequence and packet repetition in the IP network environment, a unique identification ID is provided for each complete communication service to identify the uniqueness of the service, an increasing sequence number is added to all data messages of each service, and the unique identification ID and the packet sequence number are packaged into the head of the data message.
And the data sender sends the data messages in order according to the head sequence numbers of the data messages, and the messages reach the data receiver through the network environment. When a data receiver monitors that unread data appears in an IO input buffer area, firstly, an identification ID of the head of an unread data message is extracted, a transfer area is distributed or searched according to the identification ID, each transfer area is divided into N cells, each cell contains one data message, and the data messages are written into the transfer area according to the sequence of the messages reaching the buffer area.
After data are written in a transfer area, a data receiver informs a transfer area address and an identification ID to a data preprocessing thread, after the data preprocessing thread acquires the transfer area address and the identification ID, firstly applies for a memory with a hash table structure, takes the ID as an index of the memory, adopts a remainder removing method as a hash function, reads a data message through the transfer area address, analyzes the head of the data message, acquires a CRC check code, a serial number, a message type and the like, substitutes the serial number of the message passing the CRC check as a parameter into the hash function to acquire the position of each block of data message in the hash table, finally stores the data message into the hash table according to the serial number carried by the head, stores the data message with the same serial number into the same position, and automatically filters and discards the subsequent data message when the data message falls into the position and is occupied.
Further, the link adaptive control specifically includes the following processes:
aiming at the fact that the ad hoc network is easily influenced by climate, terrain, electromagnetic environment and communication distance, and the network quality state has large difference under different scenes, a link self-adaptive control strategy is provided, and the characteristics of the network environment which is easy to lose are adapted.
The two data exchange sides respectively maintain a network quality monitoring thread which is mainly responsible for collecting round-trip delay of messages, detecting maximum effective load, counting data message packet loss rate and other data, the link self-adaptive control calculates overtime waiting time according to the real-time round-trip delay of the messages and synchronizes the overtime time to a retransmission mechanism, and the retransmission mechanism can adjust the waiting time of a message timer needing to be confirmed according to the overtime time; adjusting the size of the data message slices according to the maximum effective load, and ensuring that each data message is divided according to a single IP layer message which cannot be fragmented; adjusting the sending interval delay time between data messages according to the packet loss rate of the data messages, increasing the sending interval delay time of the data messages when the packet loss rate is increased, reducing the sending interval delay time of the data messages when the packet loss rate is reduced, simultaneously adjusting the proportion between messages needing to be confirmed and messages needing no confirmation, when the packet loss rate of one sending stage reaches N percent, if N is greater than X, reducing N-X messages needing no confirmation in the next stage, otherwise, if N is less than X, increasing X-N messages needing no confirmation in the next stage until the packet loss rate is maintained at X percent, wherein X is a settable parameter.
A transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network is based on the transmission guarantee method suitable for the low-bandwidth and easily-consumed ad hoc network, and data communication transmission under the low-bandwidth and easily-consumed ad hoc network is achieved.
When the processor executes the computer program, the data communication transmission under the low-bandwidth and vulnerable self-networking is realized based on the transmission guarantee method suitable for the low-bandwidth and vulnerable self-networking.
A computer-readable storage medium, on which a computer program is stored, where when the computer program is executed by a processor, the computer program implements data communication transmission in a low-bandwidth and vulnerable ad hoc network based on the transmission ensuring method applicable in the low-bandwidth and vulnerable ad hoc network.
Compared with the prior art, the invention has the remarkable advantages that: 1) The retransmission strategy is autonomously controlled, so that the communication interaction times are reduced, and the bandwidth consumption and the packet loss risk are effectively reduced; 2) The method dynamically adapts to the weak network delay which is easy to lose, corrects the overtime waiting time, and improves the channel utilization rate and the data communication efficiency; 3) Data fragmentation and data compression are carried out synchronously, so that the processing time is reduced, and the communication efficiency is improved; (4) The method has no requirement on a lower-layer transmission protocol and can adapt to a communication mode with a more complex interactive flow.
Drawings
Fig. 1 is a schematic diagram of the overall structure of the transmission guaranteeing method under the low-bandwidth and vulnerable ad hoc network of the present invention.
Fig. 2 is a schematic diagram of a data communication timing sequence in the transmission guarantee method under the low-bandwidth and vulnerable ad hoc network of the present invention.
Fig. 3 is a schematic diagram of a link round-trip delay detection strategy in the transmission guaranteeing method under the low-bandwidth and easily-consumed ad hoc network of the present invention.
Fig. 4 is a schematic diagram illustrating data sorting and filtering effects in the transmission guaranteeing method under the low-bandwidth and vulnerable ad hoc network of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clearly understood, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of and not restrictive on the broad application.
The invention provides measures of application layer retransmission, dynamic adaptation to round-trip delay, data message sequencing and filtering, controllable data cutting and recombination and the like for solving data communication in a low-bandwidth and easily-lost ad hoc network environment.
The detailed description is as follows:
(1) An application layer retransmission mechanism, wherein a data sender continuously sends a plurality of data messages and then sends a request confirmation message; and after receiving the request confirmation message, the data receiving party encapsulates the message serial numbers which are not received into a confirmation packet and sends the confirmation packet to the data sending party.
(2) Dynamically adapting to the round-trip delay, requiring the confirmation message to set the overtime waiting time, if the confirmation message is not received before overtime, retransmitting the request confirmation message, and dynamically adjusting the overtime waiting time according to the real-time round-trip delay in order to adapt to the weak network environment with low bandwidth and instability.
(3) And (3) sorting and filtering the data messages, wherein when the data messages reach a data receiver, the data receiver firstly analyzes the sequence numbers carried by the message headers, carries out sorting processing according to the sequence numbers, and simultaneously discards the messages with the same sequence numbers, thereby ensuring that the data messages enter the next processing process from small to large according to the sequence numbers.
(4) Controllable data cutting and recombining, wherein a data sending party cuts data to be communicated into message segments with controllable size bytes, each message segment is ensured to be transmitted by an IP layer message which cannot be fragmented, and a data receiving party recombines the cut units into original communication data after receiving the data message.
By the technology, the data message is transmitted to the receiving party without repetition, loss and disorder, and the throughput of the ad hoc network is improved to a certain extent, so that reliable communication transmission under the low-bandwidth and easily-consumed ad hoc network is realized.
With reference to fig. 1, the communication transmission guaranteeing method applicable to the ad hoc network environment with low bandwidth and high vulnerability includes two parts, namely, a data sender service and a data receiver service, which interact data through an agreed protocol to realize reliable data communication. The data sender service comprises the following steps: data service scheduling, service data communication processing, link quality monitoring and IO event processor; the data receiver service comprises: the system comprises a data monitoring processor, a data preprocessing processor, a data distribution processor, a service data communication processor, a link quality monitoring processor and an IO event processor. Taking a primary data exchange as an example, a specific working process of the transmission guarantee method applicable to the ad hoc network with low bandwidth and easy loss is introduced:
process 1: the data service scheduling thread of the data sender detects the occurrence of a service to be executed, and a service data communication processing thread and a link quality monitoring thread are sequentially established;
and (2) a process: and the service data communication processing thread of the data sending party initializes the environment, performs cutting, compression and encryption preprocessing on service data to be executed, sequences the processed data, encapsulates the sequence number into a service data message, and delivers the service data message to the IO event processor for waiting transmission. If the data message needs to be responded and confirmed, a timer is started, and if the data message does not receive the confirmed message before timeout, retransmission operation is carried out;
and (3) a process: the link quality monitoring thread of a data sending party is responsible for packaging a link quality monitoring type data message, delivering the data message to an IO event processor, detecting the state of a link in real time, detecting important link quality data such as maximum effective load (MTU), calculating packet loss rate and the like besides collecting link real-time delay (RTT) key data by the link quality monitoring thread, and synchronizing the data to a retransmission mechanism and link adaptive control;
and 4, process 4: a data monitoring thread resident in a background of a data receiver monitors data received by an IO event processor;
and a process 5: the data receiving party firstly sequences and filters the data through the data preprocessing thread, filters and discards the messages with repeated sequence numbers, and simultaneously shares the data to the data distribution thread in sequence according to the sequence numbers;
and 6, a process: the data distribution thread receives the data message, reads the data message type, and then distributes the data message type to the corresponding processing thread, wherein the data message type comprises a service data type and a link quality monitoring type;
and a process 7: if the data type is the service data type, the data is distributed to a service data processing thread, the service data processing thread de-encapsulates the data message, a data domain is taken out, decompression and decryption operations are carried out, so that original data are obtained, and finally the original data are stored or reported; if the message is a link quality monitoring type message, the message is distributed to a link quality monitoring thread to complete the operations of decapsulation, decompression and decryption, and original data is taken out;
and (8) a process: and after the data receiver service data processing thread processes the data message, if a confirmation operation is needed, the packaging response message is delivered to the IO event processor to wait for transmission.
With reference to fig. 2: in the communication transmission interactive process under the low-bandwidth and easily-consumed ad hoc network environment, the service of a data sending party starts a task scheduling execution sending service, firstly, data is subjected to cutting, compression and encryption preprocessing, then, the preprocessed data is packaged into a message, and the message is continuously sent to the service of a data receiving party through an IO event processor. And the service of the data receiving party is in a monitoring state, and when the monitoring result shows that the data is not read, the data receiving party executes decapsulation, decryption and decompression processing, and takes out and stores the carried data. After the data sender completes the data message sending actions continuously for many times, the data sender sends a request confirmation message, the message contains the serial number of the next data message to be sent by the data sender, and meanwhile, a timer is started, and if the confirmation message is not received before timeout, the request confirmation message is retransmitted. And the data receiving party receives the request confirmation message, takes out the sequence number carried in the message, compares the sequence number with the sequence number of the received message to obtain a lost message sequence number set, encapsulates the lost message sequence number set into the confirmation message, and simultaneously sends the confirmation message to the data sending party. And the data sender receives the confirmation message before overtime, analyzes the confirmation message to obtain a lost message sequence number set, completes data exchange in one stage if the sequence number set is empty, and takes out the message corresponding to the sequence number in the lost set from the sending cache area if the lost set is not empty, and repeats the steps. For communication with large data volume, data is cut and divided into a plurality of stages for communication interaction, all the stages are completed, and a data receiver reconstructs received data messages into original complete data.
With reference to fig. 3: the invention is suitable for the ad hoc network environment with easy loss by continuously detecting the real-time round-trip delay of the link and dynamically adjusting the time-out waiting time under the ad hoc network environment with low bandwidth and easy loss. The specific process is that a data message containing four timestamps is constructed, and the following four timestamps are respectively obtained according to the sequence of fig. 2:
detecting a timestamp t0 when the message leaves a detection initiator;
detecting a timestamp t1 when the message reaches a detection receiver;
detecting a timestamp t2 when the message leaves a detection receiver;
and detecting the time stamp t3 when the message reaches the detection initiator.
Setting:
defining the offset of a time system of a detection initiating terminal and a detection receiving terminal as theta;
the round-trip delay of a link is defined as δ.
Due to the fact that
t 0 +θ+δ 1 ＝t 1 ①
t 2 -θ+δ 2 ＝t 3 ②
δ 1 +δ 2 ＝δ ③
Then the
δ＝(t 3 -t 0 )-(t 2 -t 1 )
And delta is called RTT (Round-trip-TripTime) in the computer network, according to the Jacobaon/Karels algorithm [ RFC6298], when the timeout waiting time is calculated for the first time, if the first Round-trip delay RTT is set as R, then
SRTT 1 ＝R
RTTVAR 1 ＝R/2
RTO 1 ＝SRTT 1 +max(G,K*RTTVAR 1 )
Wherein, SRTT (smooth-triangle) smoothing RTT time, RTTVAR (round-triangle variation) RTT variable, G represents the granularity of system clock, the minimum is us level, K takes constant 4, RTO (retransmission time-OutD) is timeout waiting time.
Let real-time RTT be R', a relationship between RTO and real-time RTT in a subsequent process is:
RTTVAR n ＝(1-beta)*RTTVAR n-1 +beta*|SRTT n-1 -R'|
SRTT n ＝(1-alpha)*SRTT n-1 +alpha*R'
RTO n ＝SRTT n +max(G,K*RTTVAR n )
where beta =1/4, alpha =1/8, and the jacobion/Karels algorithm specifies that RTO must not fall below 1s at any time. Through the processing, the overtime waiting time can be dynamically changed according to the real-time round-trip delay.
With reference to fig. 4: the invention provides a solution for sorting and filtering messages in a low-bandwidth and easily-consumed ad hoc network environment and aiming at the situations that the data messages are repeated and disordered after the data messages reach a data receiver, and the specific process comprises the following steps: the data message reaches a data receiver through the ad hoc network, firstly, the data message is respectively written into a transfer area from an IO cache area according to a head identification ID according to the time sequence of the message reaching the receiver, the data message in the same transfer area belongs to the same communication transmission service, secondly, a sequence number field carried by the head of the data message is analyzed, and the sequence number is used as a key value of the data message to be inserted into a hash table structure. Due to the characteristics of the hash table, the message inserted with the repeated key value is rejected to be inserted, and the increasing sequence number is used as the key value, so that the storage sequence of the message inserted into the hash table is ordered.
The invention also provides a communication transmission system suitable for the ad hoc network environment with low bandwidth and easy consumption, and the data communication transmission suitable for the ad hoc network with low bandwidth and easy consumption is realized based on the communication guarantee method suitable for the ad hoc network environment with low bandwidth and easy consumption.
A computer device comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein when the processor executes the computer program, data communication transmission under the weak ad hoc network environment is realized based on the communication transmission guarantee method which is suitable for the ad hoc network environment with low bandwidth and easy consumption.
A computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements data communication transmission in a weak ad hoc network environment based on the communication transmission securing method in the low-bandwidth, vulnerable ad hoc network environment.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present application should be subject to the appended claims.
Claims (7)
1. A transmission guarantee method suitable for low bandwidth and vulnerable ad hoc network is characterized by comprising a data sender service part and a data receiver service part, wherein the data sender service part comprises a data service scheduling thread, a service data communication processing thread and a link quality monitoring thread; the data receiver service comprises a data monitoring thread, a data preprocessing thread, a data distribution thread, a service data communication processing thread and a link quality monitoring thread, and the data transmission process specifically comprises the following steps:
process 1: the data service scheduling thread of the data sender detects the occurrence of a service to be executed, and a service data communication processing thread and a link quality monitoring thread are sequentially established;
and (2) a process: a data sender service data communication processing thread initializes an environment, performs fragmentation, compression and encryption preprocessing on service data to be executed, sorts the processed data, encapsulates sequence numbers into service data type messages together, delivers the service data type messages to an IO event processor for transmission, starts a timer if the data messages need response confirmation, and performs retransmission operation if the confirmation messages are not received before timeout;
and (3) a process: the link quality monitoring thread of the data sending party is responsible for packaging link quality monitoring type data messages, delivering the data messages to an IO event processor to detect the link state in real time, collecting link real-time delay key data, detecting the maximum effective load, calculating the packet loss rate, and synchronously sending the data messages to a retransmission mechanism and link self-adaptive control;
and 4, process 4: a data monitoring thread resident in a background of a data service receiver monitors data received by an IO event processor;
and a process 5: the data receiving party firstly sequences and filters the data through a data preprocessing thread, filters and discards messages with repeated serial numbers, and simultaneously shares the data to a data distribution thread in sequence according to the serial numbers;
and 6, a process: the data distribution thread receives the data message, reads the data message type, and distributes the data message type to the corresponding processing thread, wherein the data message type comprises a service data type and a link quality monitoring type;
and a process 7: if the data type is the service data type, the data is distributed to a service data processing thread, the service data processing thread de-encapsulates the data message, takes out the data domain, decompresses and decrypts the data domain to obtain the original data, and stores or reports the original data; if the message is a link quality monitoring type message, the message is distributed to a link quality monitoring thread to complete the operations of decapsulation, decompression and decryption, and original data is taken out;
and (8) process: and after the data receiver service data processing thread processes the data message, if a confirmation operation is needed, the packaging response message is delivered to the IO event processor to wait for transmission.
2. The transmission ensuring method applicable to the low-bandwidth and vulnerable ad hoc network according to claim 1, wherein the retransmission mechanism agrees to divide the data packets exchanged between the data sender and the data receiver into the required-to-respond packets and the non-required-to-respond packets, and the specific process is as follows:
the data sending party obtains the complete data of the service to be executed, firstly cuts the data and encapsulates the data into data messages in sequence, wherein the messages containing the data content of the service to be executed are all messages without response, in addition, the data sending party inserts a request confirmation message every N data messages, and the message contains the serial number S of the next data message n The messages are all messages needing to be responded, and the two types of messages form all messages of a primary communication service; the data sending party sends N data messages and a request confirmation message, which are called a data exchange stage, each communication service comprises at least one stage, and the data sending party firstly stores two types of messages into a sending buffer area in sequence in each stage;
the data sending party traverses the sending buffer area, sends the messages in sequence, the data receiving party receives the messages and records the message sequence number, when the sent messages are messages which do not need to be responded, the next message is directly sent continuously, the data sending party sends a request confirmation message until N data messages are continuously sent, the data sending party starts a timer, the overtime time T is set, if the messages confirmed by the data receiving party are not received before the overtime, the request confirmation message is sent again, and so on, the R times are sent again at most, if the messages confirmed by the data receiving party are received before the overtime, the condition is that:
the sender requests to confirm that the message contains the initial sequence number S of the next stage message n The data receiver records the sequence number of the data message received in this stage as a set G n Then set { S n-1 ，S n-1 +1，S n-1 +2,……,S n -2，S n -1} subtracting the set G n The obtained difference set is the lost message serial number at the stage, the serial number is packaged into a confirmation message and is replied to the data sending party, after the data sending party receives the confirmation message, the lost serial number in the message is firstly analyzed, then the sending buffer area is traversed, the message which does not appear in the lost set is emptied from the buffer area, then the sending process at the stage is executed again until the sending buffer area is emptied at last, and the data sending party executes the sending process at the next stage;
repeating the above process until all the stages of one communication service data exchange are completed, and marking that one communication service is completed.
3. The transmission guaranteeing method applicable to the low-bandwidth and vulnerable ad hoc network according to claim 1, wherein the data is sorted and filtered by the following specific processes:
when a data receiver monitors that unread data appears in an IO input buffer area, firstly extracting an identification ID of the head of an unread data message, distributing or searching a transfer area according to the identification ID, dividing each transfer area into N cells, containing one data message in each cell, and writing the data messages into the transfer area according to the sequence of the messages reaching the buffer area;
after data are written in a transfer area, a data receiving party informs a transfer area address and an identification ID to a data preprocessing thread, the data preprocessing thread acquires the transfer area address and the identification ID, firstly applies a memory with a hash table structure, takes the ID as an index of the memory, adopts a remainder removing method as a hash function, then reads a data message through the transfer area address, analyzes the head of the data message, acquires a CRC check code, a serial number, a message type and the like, then substitutes the serial number of the message passing the CRC check as a parameter into the hash function to acquire the position of each data message in the hash table, finally stores the data message into the hash table according to the serial number carried by the head, stores the data messages with the same serial number into the same position, and automatically filters and discards subsequent data messages when the data messages fall into the same position.
4. The transmission guaranteeing method applicable to the low-bandwidth and vulnerable ad hoc network according to claim 1, wherein the link adaptive control comprises the following specific processes:
calculating the overtime waiting time according to the real-time round-trip delay of the message, synchronizing the overtime time to a retransmission mechanism, and adjusting the waiting time of a message timer needing to be confirmed by the retransmission mechanism according to the overtime time;
adjusting the size of the data message slices according to the maximum effective load, and ensuring that each data message is divided according to a single IP layer message which cannot be fragmented;
adjusting the sending interval delay time between data messages according to the packet loss rate of the data messages, increasing the sending interval delay time of the data messages when the packet loss rate is increased, reducing the sending interval delay time of the data messages when the packet loss rate is reduced, simultaneously adjusting the proportion between messages needing to be confirmed and messages needing no confirmation, when the packet loss rate of one sending stage reaches N percent, if N is greater than X, reducing N-X messages needing no confirmation in the next stage, otherwise, if N is less than X, increasing X-N messages needing no confirmation in the next stage until the packet loss rate is maintained at X percent, wherein X is a settable parameter.
5. A transmission guarantee system suitable for a low-bandwidth and easily-consumed ad hoc network is characterized in that data communication transmission under a weak network environment is achieved based on the transmission guarantee method suitable for the low-bandwidth and easily-consumed ad hoc network according to any one of claims 1 to 4.
6. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement data communication transmission in a weak network environment based on the transmission guaranteeing method applicable to a low-bandwidth and vulnerable ad hoc network according to any one of claims 1 to 4.
7. A computer-readable storage medium, on which a computer program is stored, wherein the computer program, when being executed by a processor, implements data communication transmission in a weak network environment based on the transmission ensuring method applicable to a low-bandwidth and vulnerable ad hoc network of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211027206.4A CN115442000A (en) | 2022-08-25 | 2022-08-25 | Transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211027206.4A CN115442000A (en) | 2022-08-25 | 2022-08-25 | Transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115442000A true CN115442000A (en) | 2022-12-06 |
Family
ID=84244306
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211027206.4A Pending CN115442000A (en) | 2022-08-25 | 2022-08-25 | Transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115442000A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116264565A (en) * | 2023-05-16 | 2023-06-16 | 山东省邱集煤矿有限公司 | Underground coal mine data transmission method, device and equipment based on semantic splitting |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1415146A (en) * | 2000-01-04 | 2003-04-30 | 诺基亚公司 | Data retransmission method |
| CN102480346A (en) * | 2010-11-26 | 2012-05-30 | 中国科学院声学研究所 | Reliable network data transmission method |
| CN106230744A (en) * | 2016-07-26 | 2016-12-14 | 京信通信***（中国）有限公司 | A kind of method of out of order restructuring of data stream and forwarding unit |
| CN108429700A (en) * | 2017-02-13 | 2018-08-21 | 华为技术有限公司 | A kind of method and device sending message |
| KR20210094528A (en) * | 2018-11-08 | 2021-07-29 | 인터디지탈 패튼 홀딩스, 인크 | How to Improve WLAN with Advanced HARQ Design |
| CN113300817A (en) * | 2020-09-22 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Data transmission method and device |
| CN113572750A (en) * | 2021-07-20 | 2021-10-29 | 北京奇艺世纪科技有限公司 | Video data transmission method and device |
| CN114499772A (en) * | 2020-11-12 | 2022-05-13 | 华为技术有限公司 | Data transmission method and electronic equipment |
-
2022
- 2022-08-25 CN CN202211027206.4A patent/CN115442000A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1415146A (en) * | 2000-01-04 | 2003-04-30 | 诺基亚公司 | Data retransmission method |
| CN102480346A (en) * | 2010-11-26 | 2012-05-30 | 中国科学院声学研究所 | Reliable network data transmission method |
| CN106230744A (en) * | 2016-07-26 | 2016-12-14 | 京信通信***（中国）有限公司 | A kind of method of out of order restructuring of data stream and forwarding unit |
| CN108429700A (en) * | 2017-02-13 | 2018-08-21 | 华为技术有限公司 | A kind of method and device sending message |
| KR20210094528A (en) * | 2018-11-08 | 2021-07-29 | 인터디지탈 패튼 홀딩스, 인크 | How to Improve WLAN with Advanced HARQ Design |
| CN113300817A (en) * | 2020-09-22 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Data transmission method and device |
| CN114499772A (en) * | 2020-11-12 | 2022-05-13 | 华为技术有限公司 | Data transmission method and electronic equipment |
| CN113572750A (en) * | 2021-07-20 | 2021-10-29 | 北京奇艺世纪科技有限公司 | Video data transmission method and device |
Non-Patent Citations (1)
| Title |
|---|
| ***;张新荣;: "基于延迟抖动分析的TCP友好拥塞控制算法", 计算机工程与科学, no. 06, 15 June 2007 (2007-06-15), pages 2 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116264565A (en) * | 2023-05-16 | 2023-06-16 | 山东省邱集煤矿有限公司 | Underground coal mine data transmission method, device and equipment based on semantic splitting |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2674655C (en) | Improved data transfer method, system and protocol | |
| US6026075A (en) | Flow control mechanism | |
| US20070008883A1 (en) | Transport layer relay method, transport layer relay device, and program | |
| CN101141406B (en) | Distributed flow control method, system and device | |
| CN100534069C (en) | Accelerating method for asymmetric and multi-concurrency network | |
| CN202841192U (en) | High-speed reliable one-way transmission system supporting wide area network | |
| Liu et al. | Improving explicit congestion notification with the mark-front strategy | |
| US20220368633A1 (en) | Congestion control method and apparatus | |
| CN112104562A (en) | Congestion control method and device, communication network and computer storage medium | |
| CN115442000A (en) | Transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network | |
| CN114826495B (en) | Method for reducing NR, RLC, AM fragment loss report overhead | |
| CN118301078A (en) | Flow rate control method and device | |
| CN109890082B (en) | Time-triggered TT frame message transmission method | |
| WO2021238764A1 (en) | Intra-network cache-based differentiated transmission method | |
| CN103595552B (en) | Analysis method and analysis system for cluster storage network parallel load | |
| CN117544571A (en) | Safe and reliable transmission method and device for large message | |
| CN113273149B (en) | Data sending method and device and FlexE exchange system | |
| CN115514709B (en) | Congestion control event queue scheduling method, device, equipment and storage medium | |
| CN106850153B (en) | Data retransmission method and system | |
| Hurtig et al. | SCTP: designed for timely message delivery? | |
| JP5539161B2 (en) | Data transmission method and multi-site data distribution method | |
| Elloumi et al. | A simulation-based study of TCP dynamics over HFC networks | |
| JP3131607B2 (en) | State change aggregation method of network monitoring system | |
| CN112380175B (en) | Time management method for receiving temporary file by operating system | |
| CN111641698B (en) | Data statistical method, system, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |