Abstract
This paper presents a periodic heuristic algorithm to solve the timeslots assignment problem of multi-terminals in MF-TDMA system with star topology. The goal is to design an algorithm that allows the processing of a given traffic profile with some constraints and a maximum utilization of the total frequency channel capacity, using the minimum spectrum bandwidth. The MF-TDMA system is viewed as a collection of bins, and then the resource assignment problem for the uplink becomes combinatorialoptimization problem which can be seen as a two-dimensional (2D) dynamic bin-packing problem with additional constraints. In the paper, the RCP-fit and the Best-Fit-Decreasing algorithms are integrated as a basis, which is added some additional restrictions. Through the experiment and simulation compared with existing algorithm, the proposed heuristic algorithm can improve the utilization of limited timeslot resources.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
