A New Algorithm for Link Scheduling in MIMO Wireless Mesh Networks with Various Interference Condition by Ant Colony Algorithm

Wireless mesh networks are appropriate and cost-effective infrastructure for Internet but due to the limited scalability and capacity, a lot of research has been doing on new ways to improve these limitations such as optimization of scheduling, routing, etc. In this paper focusing on time division multiple access (TDMA) method, a new algorithm called a</strong>nt colony for l</strong>ink s</strong>cheduling in m</strong>esh networks (ALSM) based on Ant Colony algorithm is proposed which reduces the possibility of collision to zero by scheduling links. In this algorithm, we will try to size super frames and assign each link to a time slot in such a way that limitations are satisfied and finally, the end-to-end latency is minimized. In multi-input multi-output (MIMO) networks, we face two types of interference (weak and strong). In ALSM, the ant colony has been modified in such a way that the optimal timing of the links can be obtained by considering these two types of interferences. Our results show that ALSM algorithm can schedule links with shorter super frames compared to other recent algorithms.