Efficient group multicast node scheduling schemes in multi-hop wireless networks

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

STDMA networks provide an effective solution for enabling wireless devices to access network resources with fairness and efficiency. When multiple-group communications are implemented in such networks, the scheduling algorithm should generate appropriate schedule assignments for all the transmissions where the objective aims to reduce the schedule length. In this paper, the problem of producing an efficient schedule sequence for multiple-group communications over a STDMA node scheduling network is referred to as an integrated multiple-group communication and traffic-oriented node scheduling (IMCTNS) problem. It is shown that the IMCTNS problem can be formulated as an integer linear programming (ILP) problem. A polynomial-time centralized heuristic scheduling algorithm, designated as Broadcasting Level-by-Level Scheduling (B-LBLS), is proposed for determining the schedule sequence subject to transmission constraints. To enhance the spatial utilization efficiency within each time slot, an advanced version of B-LBLS, designated as Collision-Allowed Level-by-Level Scheduling (CA-LBLS), is proposed based on a modified graph-based interference model. It is shown that compared to existing TDMA- and STDMA-based algorithms, the proposed algorithms provide an effective reduction in the schedule frame length and a significant increase in the spatial utilization within each time slot.

原文English
頁(從 - 到)1247-1258
頁數12
期刊Computer Communications
35
發行號10
DOIs
出版狀態Published - 2012 六月 1

All Science Journal Classification (ASJC) codes

  • 電腦網路與通信

指紋

深入研究「Efficient group multicast node scheduling schemes in multi-hop wireless networks」主題。共同形成了獨特的指紋。

引用此