General Capacity Region for the Fully Connected Three-Node Packet Erasure Network.

This paper studies the capacity region when three nodes \ \mathsf 1, \mathsf 2, \mathsf 3\ communicate with each other by sending packets through unreliable wireless medium. For each time slot, with some probabilities a packet sent by node $i$ may be received by both of the other nodes $j$ and $k$ ; received only by node $j$ (or node $k$ ); or received by neither node. Interference is avoided by enforcing that at most one node can transmit in each time slot. We assume that node $i$ can always reach node $j$ , possibly with the help of the third node $k$ , for any $i \neq j$ pairs (thus the term fully connected). One notable example of this model is any CSMA-based Wi-Fi network with three nodes within the hearing range of each other. [ABSTRACT FROM AUTHOR]