Abstract
The authors propose and analyze a stable random access algorithm which is a modification of the two-cell algorithm proposed by M. Paterakis (1984). The authors assume ternary feedback broadcast per slot, and in the presence of capture, identification of the captured packet by all the users in the system. It is also assumed that a successfully received signal transmission cannot be distinguished from a capture in the presence of multiple transmission. The performance of the algorithm is compared to an appropriate modification of J.I Capetanakis' (1979) dynamic algorithm. The proposed algorithm, and in contrast to the latter, it can be easily modified to operate in limited feedback sensing environments.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
