Interference aware routing for minimum frame length schedules in wireless mesh networks

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 a

Similar works

This paper was published in LSE Research Online.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.