查看文章

Fast data collection is one of the most important research issues for wireless sensor networks (WSNs). In this paper, a time-division-multiple-access-based energy consumption balancing algorithm is proposed for the general k-hop WSNs, where one data packet is collected in one cycle. The optimal k that achieves the longest network life is obtained through our theoretical analysis. Required timeslots (TSs), maximum energy consumption, and residual network energy are all thoroughly analyzed in this paper. Theoretical analysis and simulation results demonstrate the effectiveness of the proposed algorithm in terms of energy efficiency and TS scheduling.