Toward Optimal Distributed Node Scheduling in a Multihop Wireless Network Through Local Voting

Standard

Toward Optimal Distributed Node Scheduling in a Multihop Wireless Network Through Local Voting. / Vergados, Dimitrios J.; Amelina, Natalia; Jiang, Yuming; Kralevska, Katina; Granichin, Oleg.

In: IEEE Transactions on Wireless Communications, Vol. 17, No. 1, 8091101, 01.2018, p. 400-414.

Research output: Contribution to journal › Article › peer-review

Author

Vergados, Dimitrios J. ; Amelina, Natalia ; Jiang, Yuming ; Kralevska, Katina ; Granichin, Oleg. / Toward Optimal Distributed Node Scheduling in a Multihop Wireless Network Through Local Voting. In: IEEE Transactions on Wireless Communications. 2018 ; Vol. 17, No. 1. pp. 400-414.

BibTeX

@article{3f5ece84967b475eae528720b959376f,

title = "Toward Optimal Distributed Node Scheduling in a Multihop Wireless Network Through Local Voting",

abstract = "In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically toward the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance.",

keywords = "Multihop wireless networks, node scheduling algorithm, wireless mesh networks, load balancing, AD-HOC NETWORKS, MESH NETWORKS, ROUTING ALGORITHM, RADIO NETWORKS, POWER-CONTROL, CONSENSUS, CAPACITY, CONNECTIVITY, STABILITY, SYSTEMS",

author = "Vergados, {Dimitrios J.} and Natalia Amelina and Yuming Jiang and Katina Kralevska and Oleg Granichin",

note = "Funding Information: Manuscript received February 24, 2017; revised July 31, 2017; accepted October 10, 2017. Date of publication October 31, 2017; date of current version January 8, 2018. This work was supported in part by RFBR under Grant 15-08-02640 and Grant 16-07-00890 and in part by SPbSU under Grant 6.38.230.2015. The associate editor coordinating the review of this paper and approving it for publication was I. Guvenc. (Corresponding author: Dimitrios J. Vergados.) D. J. Vergados is with the School of Electrical and Computer Engineering, National Technical University of Athens, GR-15780 Zografou, Greece (e-mail: djvergad@gmail.com). Publisher Copyright: {\textcopyright} 2002-2012 IEEE.",

year = "2018",

month = jan,

doi = "10.1109/TWC.2017.2767045",

language = "Английский",

volume = "17",

pages = "400--414",

journal = "IEEE Transactions on Wireless Communications",

issn = "1536-1276",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

RIS

TY - JOUR

T1 - Toward Optimal Distributed Node Scheduling in a Multihop Wireless Network Through Local Voting

AU - Vergados, Dimitrios J.

AU - Amelina, Natalia

AU - Jiang, Yuming

AU - Kralevska, Katina

AU - Granichin, Oleg

N1 - Funding Information: Manuscript received February 24, 2017; revised July 31, 2017; accepted October 10, 2017. Date of publication October 31, 2017; date of current version January 8, 2018. This work was supported in part by RFBR under Grant 15-08-02640 and Grant 16-07-00890 and in part by SPbSU under Grant 6.38.230.2015. The associate editor coordinating the review of this paper and approving it for publication was I. Guvenc. (Corresponding author: Dimitrios J. Vergados.) D. J. Vergados is with the School of Electrical and Computer Engineering, National Technical University of Athens, GR-15780 Zografou, Greece (e-mail: djvergad@gmail.com). Publisher Copyright: © 2002-2012 IEEE.

PY - 2018/1

Y1 - 2018/1

N2 - In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically toward the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance.

AB - In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically toward the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance.

KW - Multihop wireless networks

KW - node scheduling algorithm

KW - wireless mesh networks

KW - load balancing

KW - AD-HOC NETWORKS

KW - MESH NETWORKS

KW - ROUTING ALGORITHM

KW - RADIO NETWORKS

KW - POWER-CONTROL

KW - CONSENSUS

KW - CAPACITY

KW - CONNECTIVITY

KW - STABILITY

KW - SYSTEMS

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

UR - http://www.mendeley.com/research/toward-optimal-distributed-node-scheduling-multihop-wireless-network-through-local-voting

U2 - 10.1109/TWC.2017.2767045

DO - 10.1109/TWC.2017.2767045

M3 - статья

AN - SCOPUS:85032806064

VL - 17

SP - 400

EP - 414

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 1

M1 - 8091101

ER -

ID: 11874045