Table of Contents Author Guidelines Submit a Manuscript
Wireless Communications and Mobile Computing
Volume 2018, Article ID 3830285, 12 pages
https://doi.org/10.1155/2018/3830285
Research Article

Speeding Up Exact Algorithms for Maximizing Lifetime of WSNs Using Multiple Cores

Pengyuan Cao1,2,3 and Xiaojun Zhu1,2,3

1College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
2State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China
3Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing 210023, China

Correspondence should be addressed to Xiaojun Zhu; nc.ude.aaun@uhzx

Received 30 January 2018; Revised 18 April 2018; Accepted 8 May 2018; Published 5 June 2018

Academic Editor: Hongyi Wu

Copyright © 2018 Pengyuan Cao and Xiaojun Zhu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Maximizing the lifetime of wireless sensor networks is NP-hard, and existing exact algorithms run in exponential time. These algorithms implicitly use only one CPU core. In this work, we propose to use multiple CPU cores to speed up the computation. The key is to decompose the problem into independent subproblems and then solve them on different cores simultaneously. We propose three decomposition approaches. Two of them are based on the notion that a tree does not contain cycles, and the third is based on the notion that, in any tree, a node has at most one parent. Simulations on an 8-core desktop computer show that our approach can speed up existing algorithms significantly.