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
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
On-demand multicast routing protocol in multihop wireless mobile networks
Mobile Networks and Applications
Foundations of Algorithms Using C++ Pseudocode
Foundations of Algorithms Using C++ Pseudocode
3-approximation algorithm for joint routing and link scheduling in wireless relay networks
IEEE Transactions on Wireless Communications
Properties of a transmission assignment algorithm for multiple-hop packet radio networks
IEEE Transactions on Wireless Communications
A protocol for construction of broadcast transmission schedules in mobile ad hoc networks
IEEE Transactions on Wireless Communications
Robust scheduling in spatial reuse TDMA wireless networks
IEEE Transactions on Wireless Communications - Part 1
Some complexity results about packet radio networks (Corresp.)
IEEE Transactions on Information Theory
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Minimizing the schedule frame length in spatial time division multiple access networks is essential in enhancing the performance of multiplayer interactive applications in multiple-group multicasting environments. In this paper, the joint link scheduling and multiple-group communication problem in such networks is referred to as a real-time multiple-group communication tree scheduling (RMGCTS) problem in which the objective is to minimize the total schedule frame length. It is shown that the RMGCTS problem can be represented as an integer linear programming problem. Two particular RMGCTS problems are considered, namely, back-to-back RMGCTS for applications with a receiving-jitter constraint, and general RMGCTS for applications with a delay constraint. Two heuristic algorithms, designated as back-to-back scheduling and level-by-level scheduling, are proposed to provide efficient solutions of the back-to-back and general RMGCTS problems by maximizing the spatial reuse capability within each time slot, thereby minimizing the schedule frame length. The simulation results show that the proposed schemes yield an effective reduction in the length of the multicast schedule frame compared to that obtained from existing tree-based or pure-color scheduling algorithms. Copyright © 2011 John Wiley & Sons, Ltd.