Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks

Vasilis Friderikos, Katerina Papadaki

    Research output: Contribution to journalArticlepeer-review

    9 Citations (Scopus)

    Abstract

    The focus of this paper is on routing in wireless mesh networks (WMNs) that results in spatial TDMA (STDMA) schedules with minimum frame length. In particular, the emphasis is on spanning tree construction; and we formulate the joint routing, power control, and scheduling problem as a mixedinteger linear program (MILP). Since this is an N P-complete problem, we propose a low-complexity iterative pruning-based routing scheme that utilizes scheduling information to construct the spanning tree. A randomized version of this scheme is also discussed and numerical investigations reveal that the proposed iterative pruning algorithms outperform previously proposed routing schemes that aim to minimize the transmitted power or interference produced in the network without explicitly taking into account scheduling decisions.
    Original languageEnglish
    Article number817876
    JournalEurasip Journal On Wireless Communications And Networking
    Volume2008
    Publication statusPublished - 2008

    Fingerprint

    Dive into the research topics of 'Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks'. Together they form a unique fingerprint.

    Cite this