Quality, Reliability, Security and Robustness in Heterogeneous Networks. 12th International Conference, QShine 2016, Seoul, Korea, July 7–8, 2016, Proceedings

Research Article

Distributed Node Scheduling Algorithms for Multiple Group Communications in Wireless Multi-hop Networks

Download
177 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-60717-7_12,
        author={I-Hsien Liu and Chuan-Gang Liu and Kun-Hsuan Liu and Shun-Hsiung Yu and Zhi-Yuan Su and Jung-Shian Li},
        title={Distributed Node Scheduling Algorithms for Multiple Group Communications in Wireless Multi-hop Networks},
        proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Networks. 12th International Conference, QShine 2016, Seoul, Korea, July 7--8, 2016, Proceedings},
        proceedings_a={QSHINE},
        year={2017},
        month={8},
        keywords={Group communications Wireless multi-hop networks Node scheduling},
        doi={10.1007/978-3-319-60717-7_12}
    }
    
  • I-Hsien Liu
    Chuan-Gang Liu
    Kun-Hsuan Liu
    Shun-Hsiung Yu
    Zhi-Yuan Su
    Jung-Shian Li
    Year: 2017
    Distributed Node Scheduling Algorithms for Multiple Group Communications in Wireless Multi-hop Networks
    QSHINE
    Springer
    DOI: 10.1007/978-3-319-60717-7_12
I-Hsien Liu1,*, Chuan-Gang Liu2,*, Kun-Hsuan Liu1,*, Shun-Hsiung Yu1,*, Zhi-Yuan Su2,*, Jung-Shian Li1,*
  • 1: National Cheng Kung University
  • 2: Chia-Nan University of Pharmacy and Science
*Contact email: dannyliu@hsnet.ee.ncku.edu.tw, chgliu@mail.cnu.edu.tw, Khliu@hsnet.ee.ncku.edu.tw, sxyu@hsnet.ee.ncku.edu.tw, szj1974@gmail.com, jsli@mail.ncku.edu.tw

Abstract

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.