We have developed the Multiple Access Channel Simulator to test our novel deterministic protocols.
Multiple Access Channel environment consists of n stations attached to the shared communication channel.
Time proceeds in discrete rounds.
Each station stores queue of packets to be transmitted.
Each station can transmit one packet from its queue in a round.
If there is exactly one station transmitting its packet in a round then the packet is successfully received by all the stations.
Otherwise, if there are at least two stations transmitting in the same round then collision occurs and none of the packets is successfully received.
Each packet has to be successfully transmitted.
Our goal is to design deterministic distributed protocol that minimizes latency of a packet.
Packets are injected by deterministic adversary.
Adversary injects packets with average injection rate q.
More precisely, adversary can inject at most q*t + b packets in each interval of t rounds and b > 1 is the burstiness.
Our team has developed stable Move Big To Front (MBTF) protocol.
This protocol guarantees that total number of packets in the system is bound O(n^2 + b) in infinite execution against adversary with injection rate 1.
This is the best that can achieved since at most one packet is successfully transmitted in a round.
In our simulator we have implemented number of our novel deterministic protocols (including MBTF) and
classical randomized protocol Binary-Exponential-Backoff (BEB). Our novel protocols outperform BEB significantly.