{'fraction_non_alphanumeric': 0.017014694508894045, 'fraction_numerical': 0.0, 'mean_word_length': 4.725663716814159, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Trade-off between power consumption and delay in wireless packetized systems

In packetized wireless systems, coding allows correct reception of multiple packets colliding at a receiver. Thus data may not need to incur delays such as those due to backoff schemes in traditional ALOHA systems. However, there is a tradeoff between delay and power consumption. Recent work in this area has considered the case where multiple users are aware of the states of other users’ queues. We consider a time-slotted multiple user system with random packet arrivals. The size of the packets and probability of arrival together represent the burstiness of the system. The time slots are considered to be long enough that capacity can be achieved over a single slot in a sense we define. We consider the difference in average power consumption when average delay is minimized, with and without knowledge of other users’ queues. We also consider the case where average power is minimized without regard for delay. We present and analyze a simple scheme with limited information sharing about queues’ states. Our scheme uses a broadcasttype code for the case of low queue lengths and a multiple-acces scheme in the case of large queue lengths. We show how this scheme allows trade-offs between power and delay.