Abstract
The resource assignment multiple access (RAMA) protocol was recently 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. Here we 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.
Original language | English |
---|---|
Pages (from-to) | 727-732 |
Number of pages | 6 |
Journal | IEEE Transactions on Vehicular Technology |
Volume | 43 |
Issue number | 3 |
DOIs | |
State | Published - Aug 1994 |