Small data message merging method for data synchronization of wireless ad hoc network
A wireless self-organizing network and data synchronization technology, applied in wireless communication, network topology, network traffic/resource management, etc., can solve problems such as reducing network overhead, wasting broadband resources, and low transmission efficiency, reducing network overhead, increasing The effect of combining frequency and improving efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0070] like figure 1 Shown, a kind of small data packet merging method facing wireless ad hoc network data synchronization, described method step comprises as follows:
[0071] S1: Before the data is synchronized to establish transmission, first judge whether it is small packet data, if it is small packet data, then enter step S2, otherwise directly transmit;
[0072] The small packet data refers to data with low real-time requirements (transmission time requirement of 2 minutes or more), and relatively small data (no more than 2KB);
[0073] S2: Determine the fixed transmission path N={N1, N2, N3...Nm} from the source node to the destination node according to the known routing information;
[0074] Wherein, Nk is the kth node that passes through from the source node on the path, and m is the total number of relay nodes on the transmission path;
[0075] S3: According to the priority score S of each relay node stored in the source node, calculate the waiting merge probabilit...
Embodiment 2
[0120] A computer system, comprising a memory, a processor, and a computer program stored in the memory and operable on the processor, when the processor executes the computer program, the method steps implemented are as follows:
[0121] S1: Before the data is synchronized to establish transmission, first judge whether it is small packet data, if it is small packet data, then enter step S2, otherwise directly transmit;
[0122] S2: Determine the fixed transmission path from the source node to the destination node according to the known routing information;
[0123] S3: According to the priority score S of each relay node stored in the source node, calculate the waiting merge probability P corresponding to each relay node N on the path;
[0124] S4: Sort the waiting merge probability P of each relay node from high to low, filter out the top q subsequences with the highest waiting merge probability as relay nodes, and merge according to the waiting merge probability correspondi...
Embodiment 3
[0130] A computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the method steps implemented are as follows:
[0131] S1: Before the data is synchronized to establish transmission, first judge whether it is small packet data, if it is small packet data, then enter step S2, otherwise directly transmit;
[0132] S2: Determine the fixed transmission path from the source node to the destination node according to the known routing information;
[0133] S3: According to the priority score S of each relay node stored in the source node, calculate the waiting merge probability P corresponding to each relay node N on the path;
[0134] S4: Sort the waiting merge probability P of each relay node from high to low, filter out the top q subsequences with the highest waiting merge probability as relay nodes, and merge according to the waiting merge probability corresponding to the subsequence;
[0135] S5: Establis...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More