LP-relaxation based distributed algorithms for scheduling in wireless networks

Chandramani Singh, Angelia Nedich, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

LP relaxations of Maximum Weighted Independent Set (MWIS) problems have been widely studied. A key motivation for this prior work comes from the central role that MWIS plays in designing throughput-optimal algorithms for wireless networks. However, to the best of our knowledge, the actual packet delay performance of these algorithms has not been studied in the context of wireless networks. In this paper, we first present an algorithm for solving the LP relaxation of MWIS which exhibits faster convergence to an optimal solution. Further, we show that one does not have to wait for infinite time for convergence to occur, but a simple rounding technique can be used to identify the ON/OFF states of the wireless links in finite time. As in prior work, such an approach only identifies the optimal MWIS states of some of the links in the network. Therefore, we present a scheme to combine this solution with Q-CSMA. Simulations indicate that the proposed scheme significantly improves the performance of Q-CSMA. Further, the proposed algorithm is shown to perform much better than previously suggested LP relaxation schemes due to its superior convergence properties.

Original languageEnglish (US)
Title of host publicationIEEE INFOCOM 2014 - IEEE Conference on Computer Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1905-1913
Number of pages9
ISBN (Print)9781479933600
DOIs
StatePublished - 2014
Externally publishedYes
Event33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014 - Toronto, ON, Canada
Duration: Apr 27 2014May 2 2014

Other

Other33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014
CountryCanada
CityToronto, ON
Period4/27/145/2/14

Fingerprint

Parallel algorithms
Wireless networks
Scheduling
Carrier sense multiple access
Telecommunication links
Throughput

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Singh, C., Nedich, A., & Srikant, R. (2014). LP-relaxation based distributed algorithms for scheduling in wireless networks. In IEEE INFOCOM 2014 - IEEE Conference on Computer Communications (pp. 1905-1913). [6848130] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2014.6848130

LP-relaxation based distributed algorithms for scheduling in wireless networks. / Singh, Chandramani; Nedich, Angelia; Srikant, R.

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2014. p. 1905-1913 6848130.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Singh, C, Nedich, A & Srikant, R 2014, LP-relaxation based distributed algorithms for scheduling in wireless networks. in IEEE INFOCOM 2014 - IEEE Conference on Computer Communications., 6848130, Institute of Electrical and Electronics Engineers Inc., pp. 1905-1913, 33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014, Toronto, ON, Canada, 4/27/14. https://doi.org/10.1109/INFOCOM.2014.6848130
Singh C, Nedich A, Srikant R. LP-relaxation based distributed algorithms for scheduling in wireless networks. In IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc. 2014. p. 1905-1913. 6848130 https://doi.org/10.1109/INFOCOM.2014.6848130
Singh, Chandramani ; Nedich, Angelia ; Srikant, R. / LP-relaxation based distributed algorithms for scheduling in wireless networks. IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 1905-1913
@inproceedings{df5cc626b9f24b51a9d28a8b3d5bd830,
title = "LP-relaxation based distributed algorithms for scheduling in wireless networks",
abstract = "LP relaxations of Maximum Weighted Independent Set (MWIS) problems have been widely studied. A key motivation for this prior work comes from the central role that MWIS plays in designing throughput-optimal algorithms for wireless networks. However, to the best of our knowledge, the actual packet delay performance of these algorithms has not been studied in the context of wireless networks. In this paper, we first present an algorithm for solving the LP relaxation of MWIS which exhibits faster convergence to an optimal solution. Further, we show that one does not have to wait for infinite time for convergence to occur, but a simple rounding technique can be used to identify the ON/OFF states of the wireless links in finite time. As in prior work, such an approach only identifies the optimal MWIS states of some of the links in the network. Therefore, we present a scheme to combine this solution with Q-CSMA. Simulations indicate that the proposed scheme significantly improves the performance of Q-CSMA. Further, the proposed algorithm is shown to perform much better than previously suggested LP relaxation schemes due to its superior convergence properties.",
author = "Chandramani Singh and Angelia Nedich and R. Srikant",
year = "2014",
doi = "10.1109/INFOCOM.2014.6848130",
language = "English (US)",
isbn = "9781479933600",
pages = "1905--1913",
booktitle = "IEEE INFOCOM 2014 - IEEE Conference on Computer Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - LP-relaxation based distributed algorithms for scheduling in wireless networks

AU - Singh, Chandramani

AU - Nedich, Angelia

AU - Srikant, R.

PY - 2014

Y1 - 2014

N2 - LP relaxations of Maximum Weighted Independent Set (MWIS) problems have been widely studied. A key motivation for this prior work comes from the central role that MWIS plays in designing throughput-optimal algorithms for wireless networks. However, to the best of our knowledge, the actual packet delay performance of these algorithms has not been studied in the context of wireless networks. In this paper, we first present an algorithm for solving the LP relaxation of MWIS which exhibits faster convergence to an optimal solution. Further, we show that one does not have to wait for infinite time for convergence to occur, but a simple rounding technique can be used to identify the ON/OFF states of the wireless links in finite time. As in prior work, such an approach only identifies the optimal MWIS states of some of the links in the network. Therefore, we present a scheme to combine this solution with Q-CSMA. Simulations indicate that the proposed scheme significantly improves the performance of Q-CSMA. Further, the proposed algorithm is shown to perform much better than previously suggested LP relaxation schemes due to its superior convergence properties.

AB - LP relaxations of Maximum Weighted Independent Set (MWIS) problems have been widely studied. A key motivation for this prior work comes from the central role that MWIS plays in designing throughput-optimal algorithms for wireless networks. However, to the best of our knowledge, the actual packet delay performance of these algorithms has not been studied in the context of wireless networks. In this paper, we first present an algorithm for solving the LP relaxation of MWIS which exhibits faster convergence to an optimal solution. Further, we show that one does not have to wait for infinite time for convergence to occur, but a simple rounding technique can be used to identify the ON/OFF states of the wireless links in finite time. As in prior work, such an approach only identifies the optimal MWIS states of some of the links in the network. Therefore, we present a scheme to combine this solution with Q-CSMA. Simulations indicate that the proposed scheme significantly improves the performance of Q-CSMA. Further, the proposed algorithm is shown to perform much better than previously suggested LP relaxation schemes due to its superior convergence properties.

UR - http://www.scopus.com/inward/record.url?scp=84904430600&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904430600&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2014.6848130

DO - 10.1109/INFOCOM.2014.6848130

M3 - Conference contribution

AN - SCOPUS:84904430600

SN - 9781479933600

SP - 1905

EP - 1913

BT - IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -