In data gathering wireless sensor network applications, data correlation among the sensor nodes have been utilized to extend network lifetimes. It has been shown that the data correlation also exists between nodes that are far away, contrary to the assumption that correlation decreases as a function of distance. Therefore, it is possible to group the nodes based on the correlation among their data regardless of their location. Given that data from one active node per group is sufficient to reconstruct the sensed data for the remaining sensor nodes, most of the nodes can be kept in low-power sleep mode. However, only few active nodes will usually create a disconnected network, and hence failing the purpose of the deployment. In this paper we formalize this problem, referred to as Sleep-route, of selecting the minimum number of connected active nodes that are sufficient to predict the sensed data for remaining sleeping nodes with high accuracy. We prove that the problem is NP-hard. Thus, we develop a greedy algorithm, Sleep-route heuristic that provides near-optimal solutions. Using Contiki-based simulations, we show that our scheme can extend network lifetime up to 42% as compared to the state-of-the-art solutions.
|Title of host publication||2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems|
|Place of Publication||Piscataway|
|Number of pages||5|
|Publication status||Published - 1 Oct 2014|
|Event||Mass 2014: 11th International Conference on Mobile Ad Hoc and Sensor Systems - Philadelphia, United States|
Duration: 28 Oct 2014 → 30 Oct 2014
|Period||28/10/14 → 30/10/14|