By Topic

An Acknowledgement-Based Access Scheme in a Two-Node Packet-Radio Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sidi, M. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Segall, A.

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.

Published in:

Communications, IEEE Transactions on  (Volume:32 ,  Issue: 6 )