Limited feedback sensing algorithms for the packet broadcast channel

Abstract

A slotted packet broadcast channel with an infinite user population is considered. A limited feedback sensing algorithm is proposed and analyzed for collision versus noncollision binary feedback. The algorithm bas maximum throughput equal to <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.42</tex> (packets/slot), has uniformly good delay characteristics within its stability region, and is robust in the presence of feedback errors. A variation of the algorithm, for ternary feedback, attains maximum throughput <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.425</tex> and bas uniformly good delay characteristics within its stability region. In contrast, the highest throughput limited feedback sensing algorithm existing for ternary feedback attains maximum throughput <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.456</tex> , but induces relatively high delays for Poisson intensities below <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.3</tex> .