From a network's point of view, a job (application) consists of several numbers of data packets.
The SDC data, as well as several ancillary spacecraft data packets, are also sent to SDCs home institution, the Laboratory for Atmospheric and Space Physics (LASP).
In this specific topology, there are several different multipaths that data packets originating at a specific source node can use to send to the sink node.
Therefore, MMDA (CLFRF) and MMDA (MCBF) need to wait for several mesh DTIM intervals to transmit data packets when traffic load increases, which significantly make the average waiting time increase.
If the expected transmission time for one node pair is longer than Tmax, their data packet will be segment into shorter several data fragments (DFs).
We present an algorithm that can optimally allocate the rate budget between data packets and parity packets, together with several simplified versions that have lower complexity.
Define the data set to be clustered as X = {x1, x2, …, x n }, where each sample x k (1, 2, …, n) has several features, including data transmission rate, average length of data packets, and intervals of data emission.
Each packet has two pilot symbols followed by several data symbols.
To address packet loss, several schemes [2, 3] have been proposed that the corresponding node duplicates the data packets among relevant APs.
In ELBP, multicast packets are transmitted in bursts and several multicast recipients called the ACK-leaders are appointed to be responsible for multicast data packets acknowledging.
