Sentence examples for most one packet from inspiring English sources

Like DCF, a node in delayed DCF transmits at most one packet upon each transmission opportunity.

For decodability purposes, the NC scheme guarantees that, in any coded message, at most one, packet is unknown by each destination.

For the sake of simplicity, we assume that, in each slot, a sensor can generate at most one packet, and we denote by λ ∈ [0, 1] the corresponding probability of packet generation.

Thus, motivated by the smaller computational and memory complexity associated with keeping track only of actual (uncoded) packets decoded by the users, from now on we assume each receiver has k − 1 buffers for storing at most one packet for each other receiver in the system.

Then, the average number of packets that have to be sent in a scheduled timeslot of link l is given by η l in (6) for a global flow load π, which also represents the efficiency of the schedule in terms of link l, where at most one packet can be transmitted per timeslot.

However, from a received packet, a user can decode at most one packet, if received correctly (similar to the uncoded case), so the distribution of the rows either does not change compared to the uncoded case or includes more zero rows.

We focus on strict IDNC (S-IDNC), where each coded packet includes at most one missing packet of every receiver.

A transmitted packet is instantaneously decodable for receiver if it is a linear combination of source packets containing at most one source packet that has not decoded yet.

At most, one data packet is delivered in response to an interest.

The Reno sender retransmits at most one dropped packet per round-trip time.

As a result, the next state can be any state from m - 1 to M. Since the system can transmit at most one data packet in one frame, there is a constraint of s - m ≥ -1.