The impact of user information on power-delay tradeoffs in bursty packetized systems

This paper explores the power-delay tradeoff for a time-slotted multiple user system with random packet arrivals and limited sharing of user queue information. The average power consumption to minimize delay with full and only local queue information, as well as without regards to delay is analyzed. A simple scheme with one bit of global queue information is presented. The scheme uses superposition coding to afford reliably received in the presence of collisions and can achieve power-delay trade-offs between minimizing energy and minimizing delay.