Centralized joint routing and scheduling algorithm with minimum delay for multi-flow in WMNs with single-transceiver and multi-channel
Pouria Zand, Mohsen Shiva · 2008
In this paper a new algorithm for centralized scheduling and routing in wireless mesh networks (WMNs) is introduced with multi-flow, multi-rate, and backup route. For multicast and unicast routing the Dijkstra algorithm that is suitable for real-time applications where the minimum delay is a constraint, is used. For scheduling the nodes the delay graph is used with a slight change. During the route finding some links may be selected simultaneously by the routes. To resolve the packing problem, we define a new solution. It seems that the greedy algorithm would be an appropriate solution. By using the channel assignment algorithm introduced by us, the secondary interference problem is solved, where it would be possible to activate the two links that are in the interference range of each other.