Time-slot assignment for TDMA-systems
Computing
Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Discrete Mathematics - Topics on domination
Reactive GRASP with path relinking for channel assignment in mobile phone networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A GRASP for Coloring Sparse Graphs
Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
A mixed neural-genetic algorithm for the broadcast scheduling problem
IEEE Transactions on Wireless Communications
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
Broadcast scheduling in packet radio networks using Harmony Search algorithm
Expert Systems with Applications: An International Journal
Energy efficient spatial TDMA scheduling in wireless networks
Computers and Operations Research
DC programming and DCA based cross-layer optimization in multi-hop TDMA networks
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Formal approach to guard time optimization for TDMA
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.00 |
In this paper, we introduce a combinatorial algorithm for the message scheduling problem on Time Division Multiple Access (TDMA) networks. In TDMA networks, time is divided in to slots in which messages are scheduled. The frame length is defined as the total number of slots required for all stations to broadcast without message collisions. The objective is to provide a broadcast schedule of minimum frame length which also provides the maximum throughput. This problem is known to be $\mathcal{NP}$ -hard, thus efficient heuristics are needed to provide solutions to real-world instances. We present a two-phase algorithm which exploits the combinatorial structure of the problem in order to provide high quality solutions. The first phase finds a feasible frame length in which the throughput is maximized in phase two. Computational results are provided and compared with other heuristics in the literature as well as to the optimal solutions found using a commercial integer programming solver. Experiments on 63 benchmark instances show that the proposed method is able to provide optimal frame lengths for all cases with near optimal throughput.