An exact algorithm for maximum lifetime data gathering tree without aggregation in wireless sensor networks
- 338 Downloads
In wireless sensor networks, maximizing the lifetime of a data gathering tree without aggregation has been proved to be NP-complete. In this paper, we prove that, unless P = NP, no polynomial-time algorithm can approximate the problem with a factor strictly greater than 2/3. The result even holds in the special case where all sensors have the same initial energy. Existing works for the problem focus on approximation algorithms, but these algorithms only find sub-optimal spanning trees and none of them can guarantee to find an optimal tree. We propose the first non-trivial exact algorithm to find an optimal spanning tree. Due to the NP-hardness nature of the problem, this proposed algorithm runs in exponential time in the worst case, but the consumed time is much less than enumerating all spanning trees. This is done by several techniques for speeding up the search. Featured techniques include how to grow the initial spanning tree and how to divide the problem into subproblems. The algorithm can handle small networks and be used as a benchmark for evaluating approximation algorithms.
KeywordsWireless sensor networks Data gathering tree Maximum lifetime Exact algorithm Inapproximability
This work was partly supported by the New-Faculty Research Grant of Nanjing University of Aeronautics and Astronautics, China NSF Grants (61321491, 61373130, 61133006), NSF of Jiangsu Province Grant (BK20141319), and China 973 projects (2014CB340303, 2012CB316201).
- 3.Berkelaar, M., Eikland, K., & Notebaert, P. (2010). lp_solve 188.8.131.52. http://lpsolve.sourceforge.net/5.5/. Accessed 2014-3-2.
- 5.Diestel, R. (2006). Graph theory (3rd ed.). Berlin: Springer.Google Scholar
- 10.Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000). Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of ACM MobiCom.Google Scholar
- 12.Kuo, T. W., & Tsai, M. J. (2012). On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: Np-completeness and approximation algorithms. In Proceedings of IEEE INFOCOM.Google Scholar
- 14.Liang, J., Wang, J., Cao, J., Chen, J., & Lu, M. (2010). An efficient algorithm for constructing maximum lifetime tree for data gathering without aggregation in wireless sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- 15.Luo, D., Zhu, X., Wu, X., & Chen, G. (2011). Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- 16.Peng, Y., Li, Z., Qiao, D., & Zhang, W. (2013). I2c: A holistic approach to prolong the sensor network lifetime. In Proceedings of IEEE INFOCOM.Google Scholar
- 18.Shan, M., Chen, G., Luo, D., Zhu, X., & Wu, X. (2014). Building optimal shortest path data aggregation trees in wireless sensor networks. ACM Transactions on Sensor Networks, 11(1). Article No. 11.Google Scholar
- 20.Wikipedia Contributors. (2014). Linear programming. http://en.wikipedia.org/wiki/Linear_programming. Accessed 2014-3-2.
- 23.Xiang, L., Luo, J., & Rosenberg, C. (2013). Compressed data aggregation: Energy efficient and high fidelity data collection. IEEE/ACM Transactions on Networking, 21(6), 1722–1735.Google Scholar