Sentence examples for throughput of a node from inspiring English sources

For a given conflict graph, throughput of a node refers to the fraction of time that the node transmits, and the throughput region of the conflict graph refers to the collection of achievable per-node throughputs.

Since a node with a low transmission rate leads to longer transmission time, the throughput X will be decreased significantly as the number of nodes with lower transmission rates increases, which is a well-known performance anomaly problem [6]. Figure 4 shows the throughput of a node when only one node uses 11 Mbps and others use lower rates (1, 2, or 5.5 Mbps).

This dramatically increases the throughput of replicated services, e.g., the throughput of a 4 node Prophecy web service is ~4X the throughput of a 4 node PBFT web service.

Simulations results show that the throughput of a sensor node can be improved up to 50% when compared to a state of the art power management algorithm for solar harvesting WSN.

The total flow in the network, i.e., the network throughput, is equal to the number of sources times y, i.e., 35 × 1.3714 = 48, for both CG approaches, which is equal to the maximum total network flow (maximum network throughput) for a node-degree constraint of 2. In fact, the network throughput achieved is maximum for all node-degree constraints for both CG approaches, as shown in Table 1.

Based on the theoretical model and analysis of the throughput θ i for node v i in (5), the total throughput of all nodes in CRNs is depicted by ∑ i = 1 N θ i in (30).

In (13), we see that S i depends on τ1 and the throughput of a class-i node is equivalent to that of class-1 node.

Keeping in view the abovementioned states, the throughput (in pkts/s) of a node is given as [5] T=frac{tau 1-p)}{T=frac{tau 1-p+ tau p T_{c}{tau 1-pu)(1-b)sigma +(1-tau){bT}{tau 1-p0).

Figure 4 Throughput of an IEEE 802.11b node when only one node uses 11 Mbps and others use lower rates.

Once the saturation point is crossed, RT and BE throughput of both A and B nodes remain similar but with diminished value.

In another extension of the same study [31], they also considered correlated movements of a group of nodes and assume fast mobility with an objective to maximize throughput of individual node.