CN112996055A - Small data message merging method for wireless ad hoc network data synchronization - Google Patents
Small data message merging method for wireless ad hoc network data synchronization Download PDFInfo
- Publication number
- CN112996055A CN112996055A CN202110282803.0A CN202110282803A CN112996055A CN 112996055 A CN112996055 A CN 112996055A CN 202110282803 A CN202110282803 A CN 202110282803A CN 112996055 A CN112996055 A CN 112996055A
- Authority
- CN
- China
- Prior art keywords
- data
- small
- merging
- node
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
- H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a small datagram combination method for wireless self-organizing network data synchronization, which comprises the following steps: judging whether the data is the small message data, if so, entering the next step, and otherwise, directly transmitting the data; determining a fixed transmission path from a source node to a destination node; calculating the waiting merging probability according to the priority score; sequencing the merging waiting probabilities of the relay nodes, and screening the first q subsequences as the relay nodes for merging; establishing multi-hop transmission of small message data with a target node, if the waiting merging probability of each relay node triggers merging waiting, entering the next step, otherwise, transmitting the small message data to the target node; the small message data waits for L minutes at the node, and if k small message data with the same destination address exist in the waiting time, data combination is carried out; otherwise, after any one small message data reaches the waiting time, merging all the small message data at present; the merged data message is transmitted to a destination node; after receiving the message, the destination node updates the priority score and sends the message to each source node through a confirmation message to store the updated information.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to a small datagram combination method for wireless ad hoc network data synchronization.
Background
With the development of network and distributed technologies, the need for data synchronization is increasing. However, in a wireless ad hoc network with limited bandwidth, how to achieve efficient data synchronization is an urgent problem to be solved.
In a multi-hop network with limited bandwidth, some middle or edge nodes send a large number of synchronous small data messages to the same destination node within a period of time, so that the network transmission efficiency is reduced, and unnecessary network transmission overhead is increased.
Therefore, for the data synchronization problem of the wireless ad hoc network with limited bandwidth, how to utilize the intermediate data node and the network characteristics to efficiently perform small data message combination and transmission is challenging, so that the data synchronization efficiency is effectively improved, and the network overhead is reduced.
The prior art is as disclosed in Chinese patent publication No.: CN105636148A, published: 2016-06-01, a wireless multi-hop network data transmission method is proposed, which comprises the following steps:
(1) node detection: the main node or the boundary node sends the detection information of the controlled relay area, other nodes receive, respond and forward the detection information, and after the transmission and the response of the digit wheel, the adjacent nodes in three hops of the main node or the boundary node all know the hop count and the forwarding path of the adjacent nodes from the main node or the boundary node;
(2) setting the role of the node: setting the adjacent nodes as blocking nodes or relay nodes according to the receiving and responding conditions of the detection message, and setting the nodes adjacent to the blocking nodes as boundary nodes;
(3) and (3) establishing a controlled relay area: establishing a controlled relay area by taking the boundary node as a boundary condition for logic area division, so that all nodes in the controlled relay area are reliable relay nodes;
(4) and (3) time slot multiplexing allocation: performing information time slot multiplexing distribution on each reliable relay node in the controlled relay area;
(5) data receiving and transmitting: the reliable relay node transmits data in the time slot of the information period allocated to the reliable relay node and receives data in the time slot of the information period not allocated to the reliable relay node;
(6) time slot competition: and the blocking node and the node which is not allocated to the time slot of the information period adopt a carrier sense mode to compete to occupy the reserved time slot.
However, the prior art has the following disadvantages:
(1) data are not merged by using the characteristics of intermediate nodes of a multi-hop network, and the situation of wasting bandwidth by repeatedly establishing connection within a certain time period exists.
(2) Each node requires a large amount of computation, and the computation and network transmission overhead of detection and setting is large.
Chinese patent publication No.: CN101252534A, published: 2008-08-27, a method for improving communication capacity of a mobile ad hoc network by link layer message merging is disclosed, which comprises the steps of firstly adding a newly generated network layer message to different buffer queues of a sending buffer area according to a next hop address at a sending end, and merging the network layer message with an original queue tail message according to the length of the network layer message or storing the network layer message as an opposite message; when the receiving end extracts the received link layer message, the data length of the link layer is compared with the length of the network layer message for judgment, and the extraction of each network layer message is completed through circulating processing.
This prior art also suffers from the following problems:
(1) the existing protocol stack needs to be modified.
(2) There is no network consideration for multihop.
(3) The method considered from the data link layer does not consider the characteristics of the application and service layers, and the method is proposed in the network layer.
Disclosure of Invention
The invention provides a small datagram combination method for wireless self-organizing network data synchronization, aiming at overcoming the problems of high network transmission overhead, low transmission efficiency and waste of broadband resources in the prior art, and the method can effectively improve the data synchronization efficiency and effectively reduce the network overhead.
In order to solve the technical problems, the technical scheme of the invention is as follows: a small datagram combination method for wireless ad hoc network data synchronization, the method comprises the following steps:
s1: before the data synchronization is established and transmitted, judging whether the data is small message data or not, if the data is small message data, entering a step S2, otherwise, directly transmitting the data;
s2: determining a fixed transmission path from a source node to a destination node according to the known routing information;
s3: calculating the waiting merging probability P corresponding to each relay node N on the path according to the priority score S of each relay node stored in the source node;
s4: sequencing the waiting combination probabilities P of the relay nodes from high to low, screening the first q subsequences with the highest waiting combination probability as the relay nodes, and combining according to the waiting combination probabilities corresponding to the subsequences;
s5: establishing multi-hop transmission of small message data with a destination node, triggering merging waiting according to the waiting merging probability of each relay node in the transmission process, entering step S6 when triggered, otherwise continuing to transmit until the data message reaches the destination node;
s6: the transmitted small message data waits for L minutes at the node, and if k small message data with the same destination address exist in a buffer queue of the relay node in the waiting time, the k small message data are directly merged; otherwise, after any one of the small message data of all the same destination addresses reaches the waiting time, merging all the small message data at present; recording the merged information vector V;
s7: the merged data message is transmitted to a destination node along a transmission path;
s8: after the target node receives the information, the priority score is updated, the updated priority score is sent to each source node through a confirmation message, and the relay node and the source node store the updated information.
Preferably, the small message data means that the transmission time is required to be 2 minutes or more, and the transmission data does not exceed 2 KB.
Further, the format of the small message data is as follows:
Flag-ip_to-MSGTEXT
wherein, Flag represents a small message data Flag bit, when the data is a small message, Flag is 1, otherwise, Flag is 0;
the ip _ to represents the ip address of the transmission destination node, and the length is 2 bits;
MSGTEXT represents the data carried in the small message.
Still further, in step S3, in the initial state, the initial scores of the priority scores of all the relay nodes are all 100;
wherein, the waiting merging probability Pk of the kth relay node is calculated as follows:
Pk＝(Sk/∑(S1+S2+S3…+Sm))*100％；
where Sk is a priority score of the kth relay node.
Still further, the merge information vector V is represented as follows:
V＝(I,U,T)
wherein, I represents a merging success flag bit, and when merging succeeds, I is 1, and when merging fails, I is 0; u represents the number of the merged data packets, and when merging fails, U is 0; and T represents the longest waiting time in all the small message data, and the unit is s.
Still further, in step S6, the merging process includes the following steps:
s601: after the relay node receives the merging waiting request of the small data message, adding the small data message into a buffer queue, and marking the buffer queue with the ip address of the destination node;
s602: after triggering the merging condition, the relay node reads the small data messages from the buffer queue in sequence, adds a destination address at the head of the merged message, and merges the small data messages into information such as a flag bit;
s603: and sending the merged data message according to the destination address.
Still further, in step S8, specifically, according to the merged information vector V and the priority score Sk of the original relay node k, the corresponding priority score Sk _ n is updated, and acknowledgement packets carrying the corresponding packet sequence number and the updated node priority score Sk _ n are sent to each source node, and each relay node is saved during receiving and forwarding.
Still further, in step S8, the process of updating the priority score Sk _ n by merging the information vector V based on the original Sk is as follows:
sk _ n ═ Sk ═ 2/3 (when I ═ 0;
sk _ n ═ Sk (1+ (U/m _ max)) × (1+ T _ area), when I ═ 1;
wherein, U represents the number of the merged data packets; m _ max represents the maximum number of relay nodes passed by a single small data message in all small data messages in the transmission;
wherein T _ area is determined by:
T_area＝1/2，T<1min；
T_area＝1/3，1min≤T<2min；
T_area＝1/4，2min≤T<3min；
T_area＝1/5，3min≤T<4min；
T_area＝1/6，4min≤T<5min；
t represents the longest latency among all small message data.
A computer system comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method as described above when executing the computer program.
A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, carries out the steps of the method as described above.
Compared with the prior art, the technical scheme of the invention has the beneficial effects that:
the invention establishes multi-hop transmission of small message data with the destination node, and performs small data merging by effectively selecting reasonable merging positions, thereby improving the efficiency of data synchronization; meanwhile, through a reasonable feedback mechanism, the combining frequency of the relay nodes with higher transmission frequency is increased, and the network overhead is effectively reduced.
Drawings
FIG. 1 is a flow chart of the steps of the method described in example 1.
Fig. 2 is the small message data format described in example 1.
Fig. 3 is a data structure of a small message described in example 1.
Fig. 4 is an example of data synchronization in embodiment 1.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and are used for illustration only, and should not be construed as limiting the patent. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without any inventive step, are within the scope of the present invention.
The technical solution of the present invention is further described below with reference to the accompanying drawings and examples.
Example 1
As shown in fig. 1, a method for merging small datagram messages for wireless ad hoc network data synchronization includes the following steps:
s1: before the data synchronization is established and transmitted, judging whether the data is small message data or not, if the data is small message data, entering a step S2, otherwise, directly transmitting the data;
the small message data refers to data with low real-time requirement (the transmission time is required to be more than 2 minutes) and small data (not more than 2 KB);
s2: determining a fixed transmission path N from the source node to the destination node, wherein the fixed transmission path N is { N1, N2, N3 … Nm }, according to the known routing information;
wherein, Nk is the kth node passing from the source node on the path, and m is the total number of the relay nodes on the transmission path;
s3: calculating the waiting merging probability P corresponding to each relay node N on the path according to the priority score S of each relay node stored in the source node;
wherein, in the initial state, the priority scores of all the relay nodes are set to the same initial score 100;
for the waiting combination probability Pk of the kth relay node, the calculation expression is as follows:
Pk＝(Sk/∑(S1+S2+S3…+Sm))*100％；
where Sk denotes a priority score of the kth relay node.
S4: sequencing the waiting combination probabilities P of all the relay nodes from high to low, randomly sequencing the relay nodes when the waiting combination probabilities of a plurality of relay nodes are the same, thereby obtaining priority combination sequences P '({ P1', P2 ', P3' … Pm '} of all the relay nodes on a transmission path N, screening the first 5 subsequences { P1', P2 ', P3', P4 ', P5' which are used as the relay nodes and have the highest waiting combination probabilities, and combining the subsequences according to the waiting combination probabilities corresponding to the subsequences;
wherein, Pk' represents a relay node with a high waiting merging probability k;
s5: establishing multi-hop transmission of small message data with a destination node, triggering merging waiting according to the waiting merging probability of each relay node in the transmission process, entering step S6 when triggered, otherwise continuing to transmit until the data message reaches the destination node;
the format composition of the small message data is shown in figure 2,
Flag-ip_to-MSGTEXT
wherein, the flag represents a small message data flag bit, when the data is a small message, the flag is 1, otherwise, the flag is 0; ip _ to represents the ip address of the transmission destination node; MSGTEXT represents the data carried by the small message;
s6: the transmitted small message data waits for L minutes (for example, L is 2) at the node, and if there are k small message data (for example, k is 5) with the same destination address in the buffer queue of the relay node during the waiting time, the data of the k small messages are directly merged; otherwise, after any one of the small message data of all the same destination addresses reaches the waiting time, merging all the small message data at present; recording the merged information vector V after merging;
the merging information vector V is expressed as follows:
V＝(I,U,T)
wherein, I represents a merging success flag bit, and when merging succeeds, I is 1, and when merging fails, I is 0; u represents the number of the merged data packets, and when merging fails, U is 0; and T represents the longest waiting time in all the small message data, and the unit is s.
In a specific embodiment, the merging process includes the following steps:
s601: after the relay node receives the merging waiting request of the small data message, adding the small data message into a buffer queue, and marking the buffer queue with the ip address of the destination node;
s602: after triggering the merging condition, the relay node reads the small data messages from the buffer queue in sequence, adds a destination address at the head of the merged message, and merges the small data messages into information such as a flag bit;
s603: and sending the merged data message according to the destination address.
Wherein, the merged message data structure MSGTEXT is as shown in fig. 3; wherein len represents the length of the merged message data; act represents the merging success flag bit I; get represents the longest waiting time T in all small message data; num represents the number U of the merged data packets; ip _ from represents the ip address of the merged relay node; ip _ to represents the destination node address; ip _ src _ k represents the source node ip address of the kth small data packet; msgk _ len represents the length of the kth small data message; the MSGk represents the content of the kth small message data.
S7: the merged data message is transmitted to a destination node along a transmission path;
s8: after the destination node finishes receiving, updating the corresponding priority score Sk _ n according to the merged information vector V and the priority score Sk of the original relay node k, and respectively sending a confirmation message carrying the corresponding message sequence number and the updated node priority score Sk _ n to each source node, wherein each relay node is stored during receiving and forwarding;
the process that the server updates the priority score Sk _ n through the merging information vector V on the basis of the original Sk is as follows:
sk _ n ═ Sk ═ 2/3 (when I ═ 0;
sk _ n ═ Sk (1+ (U/m _ max)) × (1+ T _ area), when I ═ 1;
wherein, U represents the number of the merged data packets; m _ max represents the maximum number of relay nodes passed by a single small data message in all small data messages in the transmission;
wherein T _ area is determined by:
T_area＝1/2，T<1min；
T_area＝1/3，1min≤T<2min；
T_area＝1/4，2min≤T<3min；
T_area＝1/5，3min≤T<4min；
T_area＝1/6，4min≤T<5min；
t represents the longest latency among all small message data.
Based on the above-mentioned small datagram message merging method, a specific example is given as follows:
as shown in fig. 4, when a small data packet with a length of 200B and without limiting the arrival time requirement is sent from the node a to the node D, the transmission flow of the small data packet is entered; determining a transmission path as N ═ B, C } according to the routing information; assuming that the priority scores of B and C are Sb 30 and Sc 50, respectively, the results are shown in the following
The waiting merging probability of B is 30/(30+50) ═ 37.5%
The waiting merging probability of C is 50/(30+50) ═ 62.5%
According to the waiting combination probability, the subsequence of the relay nodes which can be subjected to waiting combination is obtained as { C, B }
Then, establishing multi-hop transmission of A and D;
assuming that waiting for merging is triggered at the node B by 37.5% of probability, the small data packets sent by the node a wait for 2 minutes at the node B and enter a corresponding buffer queue of the node B, assuming that 5 small data packets in the corresponding buffer queue reach 1 minute and 20 seconds, then merging is directly performed, and the waiting time of the small data packet with the longest waiting time in the buffer queue is obtained for 3 minutes and 40 seconds (220 seconds), and then a merging information vector V ═ 1, U ═ 5, and T ═ 220 of the merged packet is added to the header information of the merged packet, and transmission with the next hop node C is performed at the same time;
after receiving the merged message, the node C identifies the merged information vector at the head of the merged message and directly transmits the merged information vector to the next hop node D;
after receiving the merged packet, the node D obtains an information vector V ═ 1, U ═ 5, and T ═ 220, and obtains that the longest path in all the small data packets passes through 5 relay nodes, and then m ═ 5 and updates the priority score Sb _ n ═ Sb (1+5/5) ((1 +1/5) ═ 72) of the node B;
sending confirmation messages to corresponding source nodes of all the small data messages, and adding a priority score Sb _ n updated by the node B;
after receiving the confirmation message, the relay node forwards and stores the priority score Sb _ n updated by the node B; after receiving the confirmation message, each source node stores the priority score Sb _ n updated by the node B.
Example 2
A computer system comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following method steps when executing the computer program:
s1: before the data synchronization is established and transmitted, judging whether the data is small message data or not, if the data is small message data, entering a step S2, otherwise, directly transmitting the data;
s2: determining a fixed transmission path from a source node to a destination node according to the known routing information;
s3: calculating the waiting merging probability P corresponding to each relay node N on the path according to the priority score S of each relay node stored in the source node;
s4: sequencing the waiting combination probabilities P of the relay nodes from high to low, screening the first q subsequences with the highest waiting combination probability as the relay nodes, and combining according to the waiting combination probabilities corresponding to the subsequences;
s5: establishing multi-hop transmission of small message data with a destination node, triggering merging waiting according to the waiting merging probability of each relay node in the transmission process, entering step S6 when triggered, otherwise continuing to transmit until the data message reaches the destination node;
s6: the transmitted small message data waits for L minutes at the node, and if k small message data with the same destination address exist in a buffer queue of the relay node in the waiting time, the k small message data are directly merged; otherwise, after any one of the small message data of all the same destination addresses reaches the waiting time, merging all the small message data at present; recording the merged information vector V;
s7: the merged data message is transmitted to a destination node along a transmission path;
s8: after the target node receives the information, the priority score is updated, the updated priority score is sent to each source node through a confirmation message, and the relay node and the source node store the updated information.
Example 3
A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, performs the method steps of:
s1: before the data synchronization is established and transmitted, judging whether the data is small message data or not, if the data is small message data, entering a step S2, otherwise, directly transmitting the data;
s2: determining a fixed transmission path from a source node to a destination node according to the known routing information;
s3: calculating the waiting merging probability P corresponding to each relay node N on the path according to the priority score S of each relay node stored in the source node;
s4: sequencing the waiting combination probabilities P of the relay nodes from high to low, screening the first q subsequences with the highest waiting combination probability as the relay nodes, and combining according to the waiting combination probabilities corresponding to the subsequences;
s5: establishing multi-hop transmission of small message data with a destination node, triggering merging waiting according to the waiting merging probability of each relay node in the transmission process, entering step S6 when triggered, otherwise continuing to transmit until the data message reaches the destination node;
s6: the transmitted small message data waits for L minutes at the node, and if k small message data with the same destination address exist in a buffer queue of the relay node in the waiting time, the k small message data are directly merged; otherwise, after any one of the small message data of all the same destination addresses reaches the waiting time, merging all the small message data at present; recording the merged information vector V;
s7: the merged data message is transmitted to a destination node along a transmission path;
s8: after the target node receives the information, the priority score is updated, the updated priority score is sent to each source node through a confirmation message, and the relay node and the source node store the updated information.
It should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. It will be apparent to those skilled in the art that other variations and modifications can be made on the basis of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.
Claims (10)
1. A small data message merging method facing wireless self-organizing network data synchronization is characterized in that: the method comprises the following steps:
s1: before the data synchronization is established and transmitted, judging whether the data is small message data or not, if the data is small message data, entering a step S2, otherwise, directly transmitting the data;
s2: determining a fixed transmission path from a source node to a destination node according to the known routing information;
s3: calculating the waiting merging probability P corresponding to each relay node N on the path according to the priority score S of each relay node stored in the source node;
s4: sequencing the waiting combination probabilities P of the relay nodes from high to low, screening the first q subsequences with the highest waiting combination probability as the relay nodes, and combining according to the waiting combination probabilities corresponding to the subsequences;
s5: establishing multi-hop transmission of small message data with a destination node, triggering merging waiting according to the waiting merging probability of each relay node in the transmission process, entering step S6 when triggered, or continuing to transmit until the data message reaches the destination node;
s6: the transmitted small message data waits for L minutes at the node, and if k small message data with the same destination address exist in a buffer queue of the relay node in the waiting time, the k small message data are directly merged; otherwise, after any one of the small message data of all the same destination addresses reaches the waiting time, merging all the small message data at present; recording the merged information vector V;
s7: the merged data message is transmitted to a destination node along a transmission path;
s8: after the target node receives the information, the priority score is updated, the updated priority score is sent to each source node through a confirmation message, and the relay node and the source node store the updated information.
2. The method for merging small datagram messages oriented to wireless ad hoc network data synchronization according to claim 1, wherein: the small message data is that the transmission time is required to be 2 minutes or more, and the transmission data does not exceed 2 KB.
3. The method for merging small datagram messages oriented to wireless ad hoc network data synchronization according to claim 2, wherein: the format of the small message data is as follows:
Flag-ip_to-MSGTEXT
wherein, Flag represents a small message data Flag bit, when the data is a small message, Flag is 1, otherwise, Flag is 0;
the ip _ to represents the ip address of the transmission destination node, and the length is 2 bits;
MSGTEXT represents the data carried in the small message.
4. The method for merging small datagram messages oriented to wireless ad hoc network data synchronization according to claim 3, wherein: step S3, in the initial state, the initial scores of the priority scores of all the relay nodes are 100;
wherein, the waiting merging probability Pk of the kth relay node is calculated as follows:
Pk＝(Sk/∑(S1+S2+S3…+Sm))*100％；
where Sk is a priority score of the kth relay node.
5. The method for merging small datagram messages oriented to wireless ad hoc network data synchronization according to claim 4, wherein: the merging information vector V is expressed as follows:
V＝(I,U,T)
wherein, I represents a merging success flag bit, and when merging succeeds, I is 1, and when merging fails, I is 0; u represents the number of the merged data packets, and when merging fails, U is 0; and T represents the longest waiting time in all the small message data, and the unit is s.
6. The method for merging small datagram messages oriented to wireless ad hoc network data synchronization according to claim 5, wherein: in step S6, the merging process includes the following steps:
s601: after the relay node receives the merging waiting request of the small data message, adding the small data message into a buffer queue, and marking the buffer queue with the ip address of the destination node;
s602: after triggering the merging condition, the relay node reads the small data messages from the buffer queue in sequence, adds a destination address at the head of the merged message, and merges the small data messages into information such as a flag bit;
s603: and sending the merged data message according to the destination address.
7. The method for merging small datagram messages oriented to wireless ad hoc network data synchronization according to claim 6, wherein: step S8, specifically, according to the merged information vector V and the priority score Sk of the original relay node k, update the corresponding priority score Sk _ n, and send a confirmation packet carrying the corresponding packet sequence number and the updated node priority score Sk _ n to each source node, where each relay node stores the packet when receiving and forwarding the packet.
8. The method for merging small datagram messages oriented to wireless ad hoc network data synchronization according to claim 7, wherein: in step S8, the process of updating the priority score Sk _ n by the merged information vector V based on the original Sk is as follows:
sk _ n ═ Sk ═ 2/3 (when I ═ 0;
sk _ n ═ Sk (1+ (U/m _ max)) × (1+ T _ area), when I ═ 1;
wherein, U represents the number of the merged data packets; m _ max represents the maximum number of relay nodes passed by a single small data message in all small data messages in the transmission;
wherein T _ area is determined by:
T_area＝1/2，T<1min；
T_area＝1/3，1min≤T<2min；
T_area＝1/4，2min≤T<3min；
T_area＝1/5，3min≤T<4min；
T_area＝1/6，4min≤T<5min；
t represents the longest latency among all small message data.
9. A computer system comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein: the processor, when executing the computer program, performs the steps of the method according to any of claims 1 to 8.
10. A computer-readable storage medium having stored thereon a computer program, characterized in that: the computer program, when executed by a processor, performs the steps of the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110282803.0A CN112996055B (en) | 2021-03-16 | 2021-03-16 | Small data message merging method for wireless ad hoc network data synchronization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110282803.0A CN112996055B (en) | 2021-03-16 | 2021-03-16 | Small data message merging method for wireless ad hoc network data synchronization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112996055A true CN112996055A (en) | 2021-06-18 |
| CN112996055B CN112996055B (en) | 2022-08-16 |
Family
ID=76335998
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110282803.0A Active CN112996055B (en) | 2021-03-16 | 2021-03-16 | Small data message merging method for wireless ad hoc network data synchronization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112996055B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114884881A (en) * | 2022-05-12 | 2022-08-09 | 福建天晴在线互动科技有限公司 | Data compression transmission method and terminal |
| CN117640496A (en) * | 2024-01-26 | 2024-03-01 | 之江实验室 | On-chip network route relay method, equipment and medium for nerve mimicry calculation |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101252534A (en) * | 2008-03-28 | 2008-08-27 | 清华大学 | Method for improving mobile self-organizing network communication capacity through link layer message combination |
| US20110216696A1 (en) * | 2010-03-08 | 2011-09-08 | Giorgio Lippolis | Distributed fluid network system and method |
| CN103345480A (en) * | 2013-06-19 | 2013-10-09 | 西北工业大学 | Method for predicating data flows based on rule merging |
| US10211969B1 (en) * | 2015-07-21 | 2019-02-19 | Kelly Littlepage | Secure system for the synchronized collection and distribution of transactional messages among untrusted geographically distributed users |
| CN110401509A (en) * | 2019-06-12 | 2019-11-01 | 广汽丰田汽车有限公司 | For improving method, equipment, medium and the device of automobile CAN-bus efficiency of transmission |
| CN110519338A (en) * | 2019-08-06 | 2019-11-29 | 中交信息技术国家工程实验室有限公司 | A kind of data transmission mechanism based on communication for coordination |
| CN110691379A (en) * | 2019-10-12 | 2020-01-14 | 湖南智领通信科技有限公司 | Active routing communication method suitable for wireless ad hoc network |
| CN111107000A (en) * | 2019-12-13 | 2020-05-05 | 东南大学 | Content caching method in named data network based on network coding |
| CN111194064A (en) * | 2019-11-06 | 2020-05-22 | 周口师范学院 | Data transmission method and device, computer equipment and storage medium |
-
2021
- 2021-03-16 CN CN202110282803.0A patent/CN112996055B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101252534A (en) * | 2008-03-28 | 2008-08-27 | 清华大学 | Method for improving mobile self-organizing network communication capacity through link layer message combination |
| US20110216696A1 (en) * | 2010-03-08 | 2011-09-08 | Giorgio Lippolis | Distributed fluid network system and method |
| CN103345480A (en) * | 2013-06-19 | 2013-10-09 | 西北工业大学 | Method for predicating data flows based on rule merging |
| US10211969B1 (en) * | 2015-07-21 | 2019-02-19 | Kelly Littlepage | Secure system for the synchronized collection and distribution of transactional messages among untrusted geographically distributed users |
| CN110401509A (en) * | 2019-06-12 | 2019-11-01 | 广汽丰田汽车有限公司 | For improving method, equipment, medium and the device of automobile CAN-bus efficiency of transmission |
| CN110519338A (en) * | 2019-08-06 | 2019-11-29 | 中交信息技术国家工程实验室有限公司 | A kind of data transmission mechanism based on communication for coordination |
| CN110691379A (en) * | 2019-10-12 | 2020-01-14 | 湖南智领通信科技有限公司 | Active routing communication method suitable for wireless ad hoc network |
| CN111194064A (en) * | 2019-11-06 | 2020-05-22 | 周口师范学院 | Data transmission method and device, computer equipment and storage medium |
| CN111107000A (en) * | 2019-12-13 | 2020-05-05 | 东南大学 | Content caching method in named data network based on network coding |
Non-Patent Citations (3)
| Title |
|---|
| JAE SEANG LEE ETC.: "Group Connectivity-Based UAV Positioning and Data Slot Allocation for Tactical MANET", 《IEEE ACCESS》 * |
| 徐哲鑫等: "基于概率及退避等待的车辆安全消息广播机制", 《计算机***应用》 * |
| 林潇等: "基于概率和网络编码的蜂窝中继选择机制", 《现代计算机(专业版)》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114884881A (en) * | 2022-05-12 | 2022-08-09 | 福建天晴在线互动科技有限公司 | Data compression transmission method and terminal |
| CN117640496A (en) * | 2024-01-26 | 2024-03-01 | 之江实验室 | On-chip network route relay method, equipment and medium for nerve mimicry calculation |
| CN117640496B (en) * | 2024-01-26 | 2024-05-17 | 之江实验室 | On-chip network route relay method, equipment and medium for nerve mimicry calculation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112996055B (en) | 2022-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7916666B2 (en) | Reliable broadcast protocol and apparatus for sensor networks | |
| EP2421206B1 (en) | Flooding-based routing protocol having database pruning and rate-controlled state refresh | |
| US9231738B2 (en) | Communication method for relay node and next node of the relay node for network coding | |
| US9450831B2 (en) | Node apparatus and communication method | |
| US8243603B2 (en) | Method and system for improving a wireless communication route | |
| JP6264743B2 (en) | Duplicate packet suppression | |
| CN112996055B (en) | Small data message merging method for wireless ad hoc network data synchronization | |
| US9450830B2 (en) | Node apparatus and communication method | |
| US8787257B2 (en) | Network communication system, node device, routing method and routing program | |
| US8774051B2 (en) | Path notification | |
| US9768917B2 (en) | Communication control method, network system, and communication device | |
| JP2006311495A (en) | Radio communication device, communication route control device, communication route control method, and communication system | |
| US8428059B2 (en) | Network apparatus, edge router, and packet communication system | |
| CN110943918B (en) | Networking method of centerless multi-channel concurrent transmission system | |
| JP2004328749A (en) | Apparatus and method for data packet retransmission in mobile ad hoc network environment | |
| US20150172995A1 (en) | Communication method in a wireless telecommunications network, associated computer program and wireless communication node | |
| JP5720793B2 (en) | Data transfer method and node apparatus using the same | |
| US20150215199A1 (en) | Network device and computer-readable recording medium | |
| CN111385069A (en) | Data transmission method and computer equipment | |
| EP2034669A1 (en) | Method for determining the distance between a route and a node of a possible parallel route for data transmission | |
| CN114499777A (en) | Data transmission method for cluster unmanned system | |
| JP2021125857A (en) | Wireless communication device and wireless communication method | |
| CN106603411B (en) | Routing algorithm based on forwarding probability | |
| Zhong et al. | Research and Implementation of AOMDV Multipath Routing Protocol | |
| Fang et al. | A novel two-timer-based broadcast routing algorithm for vehicular ad-hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |