2016/04/01 by Mehmet Karaca, Karaca, Mehmet, Bjorn Landfeldt +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #cs.IT #cs.NI #math.IT
paper · pdf · doi:10.48550/arxiv.1604.00178
accepted to IEEE Communications Letters
arxiv created 2016/04/01 · arxiv updated 2016/04/04
Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary back-off time we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely-connected interference networks with fading channels. Then, inspired by the proposed algorithm we introduce an implementable distributed algorithm for practical networks with a reservation scheme. We show that the proposed practical algorithm can still achieve the performance of the centralized Max-Weight policy.