Joint Routing and Scheduling for Centralised Wireless Sensor Networks

We consider a centralised wireless sensor network, where nodes have to send data to a final sink, managing both routing and radio resources assignment. We propose two novel algorithms to jointly assign time slots to links and to define paths connecting nodes to the sink. In contrast with previous works, the proposed algorithms account for a realistic capture effect, where the signal-to-interference-ratio considering the sum of interfering powers is applied. The proposed algorithms, taking inspiration from Dijkstra and graph coloring techniques, are compared to two benchmarks considering a simulated and a real network. It is shown that the proposed algorithms can assign a smaller amount of radio resources with respect to benchmarks, or ensure error-less transmissions in the network.