Abstract
Optimal carrier sense multiple access (CSMA) scheduling algorithms such as Q-CSMA suffer from large delay, mainly due to the strong correlations residing in consecutive link schedules. Some previous works have remedied this issue with multiple instances of the scheduler, but the baseline scheduler (Q-CSMA) itself remains untouched. By noticing the inherent inefficiency in the contention mechanism of Q-CSMA, we propose looks ahead (LA)-CSMA algorithm in which each link LA its state update in advance and utilizes this free information during the contention stage. We show that our algorithm achieves optimal throughput with reduced correlation in the service process, thereby leading to significantly smaller delay without any additional overhead.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
