| Article ID: | iaor20134071 |
| Volume: | 56 |
| Issue: | 2 |
| Start Page Number: | 559 |
| End Page Number: | 568 |
| Publication Date: | Jun 2013 |
| Journal: | Journal of Global Optimization |
| Authors: | Wu Weili, Pardalos Panos, Du Hongwei, Wu Lidong |
| Keywords: | sensor networks |
A sensor with two active phrases means that active mode has two phases, the full‐active phase and the semi‐active phase, which require different energy consumptions. A full‐active sensor can sense data packets, transmit, receive, and relay the data packets. A semi‐active sensor cannot sense data packets, but it can transmit, receive, and relay data packets. Given a set of targets and a set of sensors with two active phrases, find a sleep/active schedule of sensors to maximize the time period during which active sensors form a connected coverage set. In this paper, this problem is showed to have polynomial‐time 
