An Algorithm for Incremental Joint Routing and Scheduling in Wireless Mesh Networks


In this paper we explore a fundamental joint routing and scheduling problem in wireless mesh networks (WMNs) that employ time division multiple access (TDMA). The problem, referred to as the minimum cost single flow routing and scheduling (MC-SFRS) problem, deals with incremental update of transmission schedules necessitated by dynamic arrival of new flows… (More)
DOI: 10.1109/WCNC.2010.5506556

7 Figures and Tables


  • Presentations referencing similar topics