Abstract
The performance of a multistation packet-radio network in which the nodes of the network employ some collision resolution algorithm (CRA) for accessing a shared radio channel is analyzed. The two CRAs considered here are the binary-tree CRA (BTCRA) and the clipped binary-tree CRA (CBTCRA). The exact analysis of a multistation network with these access schemes is intractable. Therefore, the authors present an approximate method that captures the interactions among the nodes of different stations. The mean idea is to view the interference among the nodes of different stations as independent random noises and compute the probabilities of these noises, taking into account the interactions between the nodes. Numerical results of the approximate analysis are presented and compared with the results of simulations. >
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.
