Date Added: Feb 2012
Wireless Sensor Networks (WSNs) consist of low-power and energy-constrained sensor nodes, and a fundamental challenge in the design of WSNs is to maximize the network lifetime. In WSNs, data collected by adjacent sensor nodes usually have spatial-temporal correlations, and data aggregation technique is often used as an effective approach to remove data redundancy. In this paper, the authors consider the problem of maximizing the time at which the first node with data aggregation in wireless sensor networks drains out of energy. They investigate optimal transmission rate allocation, in-network data aggregation and routing for achieving the goal above. The problem is formulated as a non-convex programming problem.