A combined multiple access protocol is investigated, based on the ISA algorithm, which was first introduced for a slotted unframed channel, and later modified to fit a cellular wireless network with distributed handoff [13, 14]. ISA manages the access rights at the beginning of each slot in order to maximize the success probability (one step throughput), based on an independence assumption on the presence of packets at the stations. We extend this concept in the context of a framed channel that has the same basic structure as Packet Reservation Multiple Access (PRMA) [1]. In this case, it is possible to see the frame as a whole bunch of 'parallel channels', over which the overall success probability must be maximized at the beginning of the frame for all free slots. The combined PRMA-ISA algorithm has been developed and investigated by means of simulations, using models previously proposed for data and voice (phone calls) traffic.
PRMA-ISA protocol for multiple access of mixed voice and data traffic
BOLLA, RAFFAELE;DAVOLI, FRANCO;
1994-01-01
Abstract
A combined multiple access protocol is investigated, based on the ISA algorithm, which was first introduced for a slotted unframed channel, and later modified to fit a cellular wireless network with distributed handoff [13, 14]. ISA manages the access rights at the beginning of each slot in order to maximize the success probability (one step throughput), based on an independence assumption on the presence of packets at the stations. We extend this concept in the context of a framed channel that has the same basic structure as Packet Reservation Multiple Access (PRMA) [1]. In this case, it is possible to see the frame as a whole bunch of 'parallel channels', over which the overall success probability must be maximized at the beginning of the frame for all free slots. The combined PRMA-ISA algorithm has been developed and investigated by means of simulations, using models previously proposed for data and voice (phone calls) traffic.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
