Time slot assignment in Ad hoc is a critical yet NP-hard problem, requiring efficient slot allocation to minimize latency, reduce energy consumption, and avoid data collisions. In this study, a TDMA scheduling scheme based on IBPSO (Improved Binary Particle Swarm Optimization) is proposed for TDMA. First, sort the particles by their fitness values. Then, retain a proportion of pe elite particles directly as the next generation. Finally, update the position, velocity, and fitness of the remaining ordinary particles, selecting the next generation from the current ordinary particles, their individual best solutions (pbest), and the global best solution (gbest). This approach balances elitism and diversity, ensuring high-quality solutions while maintaining evolutionary progress. Simulation results show that the IBPSO algorithm achieves superior performance in terms of fewer frame length, iteration and enhanced channel utilization.