Rate allocation for maximizing lifetime of data gathering tree without aggregation in wireless sensor networks

Different from data aggregation, in the process of transmitting data without aggregation from leaf node to the sink, the size of the integrated data increases. In this paper, we define that the lifetime of the node is the rounds of transmitting integrated data, which includes its own data and the received data from its children, in view of the feature of data gathering without aggregation. For different rate allocation for sensor nodes will result in the different lifetime of the network, we propose the approach on dealing with rate allocation for constructing maximum lifetime data gathering tree without aggregation in wireless sensor networks. Our algorithm, which denotes as RMLTT (Rate allocation for constructing Maximum-Lifetime data gathering Tree wiThout aggregation), approximately allocates the optimal data rates for sensor nodes with the goal to prolong the lifetime of the network as possible as it can. Simulations show that our approach is effective, which is compared with other algorithm.