Simulated annealing algorithms for optimal packet scheduling in ad hoc networks

In this paper, we investigate Simulated Annealing Algorithm (SA) capable of optimizing the scheduling tasks in ad hoc networks. They exploit the best features of the two well-known scheduling disciplines Round Robin (RR) and Shortest Distance (SD) based on local information at the nodes in the network. The effectiveness of the SA algorithms, where several cooling strategies are used, is evaluated by comparing system performance under different packet scheduling algorithms including RR and SD. Simulation results show that the proposed algorithms provide an optimized performance and minimize the average buffer size, therefore decreasing the power consumption of the system.