This paper proposes a novel algorithm named IRByTSA, as a scheduling algorithm that is both simpler and faster than TASA, in terms of its speed in generating link-schedule decision. The simplification makes IRByTSA a low-complexity algorithm. The IRByTSA algorithm owes its relatively low complexity to the following procedures: Maximum matching to generate link-schedule; maximization of nodes performing simultaneous transmissions by prioritizing from higher-ranking nodes to leaf node; transmission of all queued data packets in bursts (bursty); and provides each node with a transmission opportunity based solely on turn. The research confirms that the resulting complexity is (formula presented), which indicates that IRByTSA is a low-complexity algorithm. The advantage of using such a fast and low-complexity algorithm is increased network scalability, as the reduction in complexity and increase in speed enable the existing PCE to serve additional networks..
|Number of pages||14|
|Journal||Journal of Theoretical and Applied Information Technology|
|Publication status||Published - 1 May 2019|