Joint Routing and Scheduling via Iterative Link Pruning in Wireless Mesh Networks

Vasilis Friderikos, Katerina Papadaki

Published: 25 Nov 2007, Last Modified: 05 May 2026IEEE GLOBECOM 2007 (Wireless Mesh Network Workshop), Washington DC, USA, 26–30 November 2007EveryoneCC BY 4.0

Abstract: The paper addresses routing in Wireless Mesh Networks (WMNs) with the goal of producing Spatial-TDMA (STDMA) schedules that have minimum frame length. The focus is specifically on spanning tree construction. The authors formulate the joint routing, power control, and scheduling problem as a Mixed Integer Linear Program (MILP). Since the problem is NP-complete, they propose an iterative pruning-based routing scheme that incorporates scheduling information into the routing decisions. Numerical results show that the iterative pruning algorithm outperforms previously proposed routing approaches that minimize transmitted power or interference without explicitly accounting for scheduling.