ACKNOWLEDGEMENT-BASED ACCESS SCHEME IN A TWO-NODE PACKET-RADIO NETWORK.

Moshe Sidi, Adrian Segall

Research output: Contribution to journalConference articlepeer-review

Abstract

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. We assume that one of the nodes is granted full access rights to the channel, while the other node bases its decisions whether to transmit or not on the acknowledgements it receives about its transmissions. For this access scheme and for general arrival processes we derive the joint generating function of the queue contents at the nodes 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.

Original languageEnglish
Pages (from-to)1333-1337
Number of pages5
JournalConference Record - International Conference on Communications
Volume3
StatePublished - 1983
Externally publishedYes

Fingerprint

Dive into the research topics of 'ACKNOWLEDGEMENT-BASED ACCESS SCHEME IN A TWO-NODE PACKET-RADIO NETWORK.'. Together they form a unique fingerprint.

Cite this