Abstract

Multiple-access algorithms that handle erasures as well as captures are introduced. The algorithms are evaluated according to the maximal throughput that they can support for a Poisson arrival process. An example is given which shows that, in practice, the positive effect of captures compensates the negative effect of erasures. An approach that effectively utilizes the capture phenomena is introduced. This approach incorporates a random power-level-selection scheme that allows each node to choose randomly to transmit in one of several allowable levels of power. Design issues such as number of levels, selection schemes, etc. are discussed. >

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 call

Disclaimer: 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.