Overall Cost Minimization for Data Aggregation in Energy-Constrained Wireless Sensor Networks

In wireless sensor networks (WSNs), sensor nodes are usually powered by batteries of limited capacity, which results in dynamic changes of available paths for data aggregation due to node failures caused by energy depletion. For transmitting certain amount of data generated by source node, the overall transmission cost is affected by two major factors, using sequence of available paths and amount of data imposed on each path, which becomes a major issue significantly influencing the efficient usage of the networks. To address this issue, we consider the optimization problem of how to minimize the overall transmission cost of given data delivered from the source node to the sink node in the energy-constrained WSN. Specifically, we first describe the problem on the basis of the minimum cost flow theory and derive the upper bound for the data amount in terms of the number of packets that can be successfully transmitted from the source node to the sink node. Then, we propose specific algorithms to derive the optimal paths and their optimal data amounts, and then achieve the minimized overall transmission cost for the certain amount of data. Extensive simulations show that significant performance enhancement can be achieved by using our proposed algorithms.