In this paper, we investigated the problem of finding an efficient topology for delay-constrained data in WSNs. As we know topology control is one of the important mechanisms designed for decreasing energy consumption in WSNs. Since topology control may increase the end-to-end delay, one of the criteria's should be considered in topology control algorithms is delay constraint. Most existing works utilized hop count criteria for computing delay; yet hop count is not a suitable criterion for delay measurement because each node's delay is dependent on queuing, propagation, transition and processing delay. Here we introduced a proper benchmark for the end-to-end delay computation and presented a sectoring based algorithm which is able to construct a suitable topology by considering less energy consumption and acceptable delay for the application. Simulation results showed our algorithm not only is able to satisfy the delay constraint, but also offers reduced energy consumption compared existing algorithms.
展开▼
