To the best of our knowledge, packet deadline-based scheduling has not been addressed in multiuser settings before.
To calculate the average delay, the knowledge of packet-dropping probability and average packet-dropping time is necessary.
For this reason, as the knowledge of packet reception converges through all the forwarders, the chance of duplicate packet transmissions is very nominal.
But for this virtual system, packet collisions are confined to one slot only, which means that every packet has no knowledge of other packets in its own slot and will possibly select the same channel as others do.
In other words, in S-IDNC, after obtaining a new packet, and with the knowledge of the packets that the receiver already holds, it will always be able to decode a new message that came combined within the newly arrived coded packet.
b Only the packet facade requires knowledge about the packet format.
This algorithm requires accurate knowledge of the packet size where the packet size vary.
That is, given the knowledge of which packets were not received by their intended users, but overheard by others, the authors suggest a MDP approach to identify good coding strategies.
The main problem with this model is that, it assumes that all the nodes have knowledge of the packets received by the higher priority nodes, i.e., it does not consider duplicate retransmissions.
Therein, having knowledge of the packets available at each users, the sender is trying to come up with a sequence of transmissions to satisfy as many users as possible.
After the packet report, each r j has the knowledge of the packet set β i of the destination d i and estimates the corresponding channel response h ji between r j and d i (1 ≤ i ≤ m, 1 ≤ j ≤ l).
