期刊
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
卷 24, 期 9, 页码 1827-1840出版社
IEEE COMPUTER SOC
DOI: 10.1109/TPDS.2013.136
关键词
Energy harvesting sensor networks; monitoring quality maximization; fair rate allocation optimization; time-varying energy replenishment; maximum weighted concurrent flow problem; approximation algorithms; combinatorial optimization problem
资金
- Australian Research Council [DP120102627]
- Natural Science Foundation of China [61173137]
In this paper, we consider an energy harvesting sensor network where sensors are powered by reusable energy such as solar energy, wind energy, and so on, from their surroundings. We first formulate a novel monitoring quality maximization problem that aims to maximize the quality, rather than the quantity, of collected data, by incorporating spatial data correlation among sensors. An optimization framework consisting of dynamic rate weight assignment, fair data rate allocation, and flow routing for the problem is proposed. To fairly allocate sensors with optimal data rates and efficiently route sensing data to the sink, we then introduce a weighted, fair data rate allocation and flow routing problem, subject to energy budgets of sensors. Unlike the most existing work that formulated the similar problem as a linear programming (LP) and solved the LP, we develop fast approximation algorithms with provable approximation ratios through exploiting the combinatorial property of the problem. A distributed implementation of the proposed algorithm is also developed. The key ingredients in the design of algorithms include a dynamic rate weight assignment and a reduction technique to reduce the problem to a special maximum weighted concurrent flow problem, where all source nodes share the common destination. We finally conduct extensive experiments by simulation to evaluate the performance of the proposed algorithm. The experimental results demonstrate that the proposed algorithm is very promising, and the solution to the weighted, fair data rate allocation and flow routing problem is fractional of the optimum.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据