The n-ary Stack Algorithm for the Wireless Random Access Channel

        The emergence of wireless and personal communication networks has
        brought random access protocols for packet radio networks back to the
        research forefronts. Most such protocols are based on the ever popular
        ALOHA protocol. Unfortunately, this protocol is inherently unstable and
        requires sophisticated schemes to stabilize it. Another class of random
        access schemes, called limited sensing or stack algorithms, has been
        proposed that is stable and allows for the dynamic incorporation of
        new stations into the network. In this paper, we will review the simple
        to implement n-ary Stack Algorithm, and we will study its performance
        under various system parameters in the presence of capture, and also
        in the presence of feedback errors. Finally, we will investigate its
        maximum throughput for various traffic generation processes.

By: Chatschik Bisdikian

Published in: RC20370 in 1996


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

Questions about this service can be mailed to .