Minimum latency link scheduling in TDMA wireless multi-hop networks

The link scheduling problem in Wireless Mesh Networks is addressed, which consists in determining the activation time of the links so as to minimize the end-to-end delay of origin-destination pairs traffic. Sink-tree topology network and constant bit rate traffics are considered. We propose a linear integer model where the non linear best delay bound known from the literature is approximated via a linear combination of the latencies experimented at each link of the network weighted according to some congestion criteria of the links. Two additional variants are presented which are based on the latency delay of origin-destination traffics. Preliminary computational results obtained on randomly generated instances via a off-the-shelf commercial solver are analyzed. More specifically, we observe that minimizing a suitable function of link latency seems to be a key issue in reducing the end-to-end delay of the network.