The authors propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) partitions the network into clusters with controllable diameter and constructs a spanning tree backbone of clusterheads rooted at the sink. At the upper layer, they propose a target tracking algorithm which wakes clusters of nodes by using the estimated trajectory beforehand, which is different from existing studies in which target can be detected only when the nodes close to the target are awake. They provide the simulation results and show the effect of fore-waking operation by comparing error and miss ratios of existing approaches with the proposed target tracking algorithm.