Standard

Local voting : Optimal distributed node scheduling algorithm for multihop wireless networks. / Vergados, Dimitrios J.; Amelina, Natalia; Jiang, Yuming; Kralevska, Katina; Granichin, Oleg.

2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1014-1015 8116537 (IEEE Conference on Computer Communications Workshops).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Vergados, DJ, Amelina, N, Jiang, Y, Kralevska, K & Granichin, O 2017, Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks. in 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017., 8116537, IEEE Conference on Computer Communications Workshops, Institute of Electrical and Electronics Engineers Inc., pp. 1014-1015, 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017, Atlanta, United States, 1/05/17. https://doi.org/10.1109/INFCOMW.2017.8116537

APA

Vergados, D. J., Amelina, N., Jiang, Y., Kralevska, K., & Granichin, O. (2017). Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks. In 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017 (pp. 1014-1015). [8116537] (IEEE Conference on Computer Communications Workshops). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFCOMW.2017.8116537

Vancouver

Vergados DJ, Amelina N, Jiang Y, Kralevska K, Granichin O. Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks. In 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1014-1015. 8116537. (IEEE Conference on Computer Communications Workshops). https://doi.org/10.1109/INFCOMW.2017.8116537

Author

Vergados, Dimitrios J. ; Amelina, Natalia ; Jiang, Yuming ; Kralevska, Katina ; Granichin, Oleg. / Local voting : Optimal distributed node scheduling algorithm for multihop wireless networks. 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 1014-1015 (IEEE Conference on Computer Communications Workshops).

BibTeX

@inproceedings{d9b535801ccb48168ad62f1d7383a3ea,
title = "Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks",
abstract = "An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time or delay is obtained when the load is equalized throughout the network. Simulation results demonstrate that Local Voting achieves better performance in terms of average delay, maximum delay, and fairness compared to several representative scheduling algorithms from the literature. Despite being distributed, Local Voting has a very close performance to a centralized algorithm that is considered to have the optimal performance.",
author = "Vergados, {Dimitrios J.} and Natalia Amelina and Yuming Jiang and Katina Kralevska and Oleg Granichin",
year = "2017",
month = nov,
day = "20",
doi = "10.1109/INFCOMW.2017.8116537",
language = "English",
series = "IEEE Conference on Computer Communications Workshops",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1014--1015",
booktitle = "2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017",
address = "United States",
note = "2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017 ; Conference date: 01-05-2017 Through 04-05-2017",

}

RIS

TY - GEN

T1 - Local voting

T2 - 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017

AU - Vergados, Dimitrios J.

AU - Amelina, Natalia

AU - Jiang, Yuming

AU - Kralevska, Katina

AU - Granichin, Oleg

PY - 2017/11/20

Y1 - 2017/11/20

N2 - An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time or delay is obtained when the load is equalized throughout the network. Simulation results demonstrate that Local Voting achieves better performance in terms of average delay, maximum delay, and fairness compared to several representative scheduling algorithms from the literature. Despite being distributed, Local Voting has a very close performance to a centralized algorithm that is considered to have the optimal performance.

AB - An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time or delay is obtained when the load is equalized throughout the network. Simulation results demonstrate that Local Voting achieves better performance in terms of average delay, maximum delay, and fairness compared to several representative scheduling algorithms from the literature. Despite being distributed, Local Voting has a very close performance to a centralized algorithm that is considered to have the optimal performance.

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

U2 - 10.1109/INFCOMW.2017.8116537

DO - 10.1109/INFCOMW.2017.8116537

M3 - Conference contribution

T3 - IEEE Conference on Computer Communications Workshops

SP - 1014

EP - 1015

BT - 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 1 May 2017 through 4 May 2017

ER -

ID: 32479337