Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
QoS-constrained core selection for group communication
Computer Communications
On multicast routing in wireless mesh networks
Computer Communications
Approximate dynamic programming for link scheduling in wireless mesh networks
Computers and Operations Research
Delay aware link scheduling for multi-hop TDMA wireless networks
IEEE/ACM Transactions on Networking (TON)
An SPT-based topology control algorithm for wireless ad hoc networks
Computer Communications
Efficient algorithms to solve Broadcast Scheduling problem in WiMAX mesh networks
Computer Communications
Optimal scheduling for link assignment in traffic-sensitive STDMA wireless ad-hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
Hi-index | 0.24 |
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.