TY - JOUR
T1 - An Acknowledgment-Based Access Scheme in a Two-Node Packet-Radio Network
AU - Segall, Adrian
AU - Sidi, Moshe
PY - 1984/6
Y1 - 1984/6
N2 - A two-node packet-radio network with infinite buffers at the nodes is considered. The two nodes transmit data packets to a common station through a shared radio channel. One of the two nodes is granted full access rights to the channel, while the other node bases its decisions whether to transmit or not on the acknowledgments it receives about its transmissions. For this acknowledgment-based access scheme and for general arrival processes, we derive the joint generating function of the queue contents in steady state, as well as the condition for steady state. From the generating function, any moment can be derived, as well as average time delays. Numerical results are presented for independent Bernoulli arrival processes.
AB - A two-node packet-radio network with infinite buffers at the nodes is considered. The two nodes transmit data packets to a common station through a shared radio channel. One of the two nodes is granted full access rights to the channel, while the other node bases its decisions whether to transmit or not on the acknowledgments it receives about its transmissions. For this acknowledgment-based access scheme and for general arrival processes, we derive the joint generating function of the queue contents in steady state, as well as the condition for steady state. From the generating function, any moment can be derived, as well as average time delays. Numerical results are presented for independent Bernoulli arrival processes.
UR - http://www.scopus.com/inward/record.url?scp=0021439734&partnerID=8YFLogxK
U2 - 10.1109/tcom.1984.1096129
DO - 10.1109/tcom.1984.1096129
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
SN - 0090-6778
VL - 32
SP - 741
EP - 744
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 6
ER -