Abstract
AbstractWe consider the problem of random access communications over a time slotted channel with feedback of infinitely multiplicity at the beginning of each collision resolution interval (CRI), i.e., users know via instantaneous feedback the number of users involved in that collision. Once this is known, the resolution algorithm (CRA) operates with binary (successful / non successful, s/ns) feedback. The analysis of this simple full feedback sensing window random access algorithm, named ideal window stabilized ALOHA, (IWSA), algorithm, provides a throughput of 0.5052 packets/slot. Its delay is also analyzed and compared with similar algorithms.
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.
