Abstract
The resource assignment multiple access (RAMA) protocol was previously proposed for rapidly assigning communication resources (e.g., frequency channels or TDMA time slots) in a wireless PCS (personal communications system). Available resources are auctioned one at a time until either all requests for resources are satisfied or no more resources are available. Barring errors caused by fading and noise, a resource assignment is made in each and every assignment cycle. The authors propose some simple modifications to the RAMA protocol that increase the number of assignments per second and reduce the assignment delay. The proposed tree-search RAMA (TRAMA) protocol is deterministic, and addresses the need for fast and flexible access, handoff, and resource assignment in a future high-capacity wireless PCS, The protocol also has potential applications to local cable access systems. >
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.
