TY - GEN
T1 - Distributed node scheduling algorithms for multiple group communications in wireless multi-hop networks
AU - Liu, I. Hsien
AU - Liu, Chuan Gang
AU - Liu, Kun Hsuan
AU - Yu, Shun Hsiung
AU - Su, Zhi Yuan
AU - Li, Jung Shian
N1 - Funding Information:
Acknowledgement. This work was supported in part by the Ministry of Science and Technology, R.O.C. under Grants MOST 103-2221-E-006 -146 -MY3 and MOST 104-2221-E-041-007, Ministry of Education, R.O.C. under Grant 104C-77-016.
Publisher Copyright:
© ICST Institute forComputer Sciences, Social Informatics andTelecommunicationsEngineering 2017.
PY - 2017
Y1 - 2017
N2 - We study the scheduling problem in performing multiple multicast communications in wireless multi-hop networks, it is necessary to ensure that each multicast group can complete one transmission from the source to all the destination nodes without conflict in every frame. The present study proposes two distributed token-based STDMA node scheduling algorithms which not only satisfy this requirement, but also minimize the frame length. In the first algorithm, the multicast groups are scheduled on a group-by-group basis, whereas in the second algorithm, multiple groups are scheduled in each scheduling operation. The first algorithm has the advantages of computational simplicity and a straightforward implementation, while the second algorithm increases the percentage of reused time slots and reduces the number of token forwarding events. The simulation results show that both algorithms achieve a shorter frame length than existing methods.
AB - We study the scheduling problem in performing multiple multicast communications in wireless multi-hop networks, it is necessary to ensure that each multicast group can complete one transmission from the source to all the destination nodes without conflict in every frame. The present study proposes two distributed token-based STDMA node scheduling algorithms which not only satisfy this requirement, but also minimize the frame length. In the first algorithm, the multicast groups are scheduled on a group-by-group basis, whereas in the second algorithm, multiple groups are scheduled in each scheduling operation. The first algorithm has the advantages of computational simplicity and a straightforward implementation, while the second algorithm increases the percentage of reused time slots and reduces the number of token forwarding events. The simulation results show that both algorithms achieve a shorter frame length than existing methods.
UR - http://www.scopus.com/inward/record.url?scp=85028440760&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028440760&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-60717-7_12
DO - 10.1007/978-3-319-60717-7_12
M3 - Conference contribution
AN - SCOPUS:85028440760
SN - 9783319607160
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 120
EP - 128
BT - Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings
A2 - Pack, Sangheon
A2 - Lee, Jong-Hyouk
PB - Springer Verlag
T2 - 12th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2016
Y2 - 7 July 2016 through 8 July 2016
ER -