We consider a distributed multiple access system with bursty arrivals. The transmissions are grouped into slots and the users are frame-synchronized. At the start of each time slot, variable sized packets independently arrive at each of the transmitting terminals. The packets are to be delivered to a common receiver within a certain number of slots specified by a maximum delay constraint on each packet. The key assumption is that each terminal knows only its own arrival process, i.e. the arrivals at the rest of the terminals are unknown to each transmitter. For this interesting distributed multiple access model, we design novel power efficient communication schemes which transport the arriving data without any outage, while ensuring the delay constraints. The proposed schemes are not only optimal from the average transmit sum-power perspective, but also considerably outperform conventional schemes like TDMA.
['Sakshi Kapoor', 'Sreejith Sreekumar', 'Sibi Raj B. Pillai']
Distributed Scheduling in Multiple Access with Bursty Arrivals and Delay Constraints