Before revision:  We show in theory and simulation that our proposed algorithm, named delayed CSMA, adds virtually no additional overhead onto the existing CSMA-based algorithms, achieves the throughput optimality under the usual choice of link weight as a function of local queue length, and also guarantees much better delay performance by effectively ' de-correlating' the link state process (thus removing link starvation) under any arbitrary network topology.
After revision:  We show in theory and simulation that our proposed algorithm, named delayed CSMA, adds virtually no additional overhead onto the existing CSMA-based algorithms, achieves the throughput optimality under the usual choice of link weight as a function of local queue length, and also guarantees much better delay performance by effectively ` de-correlating' the link state process (thus removing link starvation) under any arbitrary network topology.