Stability of Random Access Protocol with Newly Generated Packet Rejection and Retransmission Cut-Off

Abstract

A transmission policy is studied for the random access slotted ALOHA channel in terms of the new packet generation rate, the newly generated packet rejection probability and the number of retransmission attempts. The control of the number of retransmission attempts is not needed if the new packet generation rate from all active users is less than 1/{e(1-alpha)} packets per time slot, where a is the newly generated packet rejection probability. The number of retransmission attempts has to decrease abruptly with the increase of new packet generation rate, when the new packet generation rate exceeds this critical limit. The system becomes unstable even without any retransmission attempts, if the new packet generation rate is equivalent to or greater than 1/(1-alpha) packets per time slot. A complete analysis for the new packet generation rate with the proper adjustment of the number of retransmission attempts and the newly generated packet rejection probability that provides the stable channel throughput is given. The stable operating regions are devised. The total packet rejection probability is also discussed. The access protocol presented here can be used as a pan of ad-doc and sensor networks, because of its stable and distributed nature. It can also be used in future cognitive radio technology, because of its cooperative competition, rather than collision competition. This access protocol can be a potential candidate for future ad-hoc or sensor networks using cognitive radio technology