Download now Free registration required
Scheduling wireless links under the SINR model has attracted increasing attention in the past few years. However, most of previous work did not account for the precedence constraint that might exist among the wireless links. Precedence constraints are common in data aggregation problems where a sensor can not send data to its parent node before it has received data from all of its children. Existing solutions to the so-called minimum latency aggregation scheduling problem mainly focus on specific tree topologies rooted at the sink node. In this paper, the authors study the minimum latency link scheduling problem for arbitrary directed acyclic networks under both precedence and SINR constraints.
- Format: PDF
- Size: 326.1 KB