Energy Efficient Data Gathering Schema for Wireless Sensor Network: A Matrix Completion Based Approach

In this paper, we seek to address the data gathering in the continually growing Wireless Sensor Networks (WSNs) with the intention to save the nodes' energy. In order to address usual WSN problems, such as data losses, collisions and retransmissions, a twofold data compression pattern is proposed. We consider that a restricted number of sensor nodes are selected to be active and represent the whole network, while the rest of nodes remain idle and do not participate at all in the data sensing and transmission. Furthermore, the set of active nodes' readings is efficiently reduced, in each time slot, according to the cluster scheduling. Relying on the existing Matrix Completion techniques, the sink node is unable to recover the entire data matrix due to the existence of completely empty rows that correspond to the inactive nodes, which can be considered as absent nodes for a very long period, or nodes that do not exist at all. Thereby, we propose a complementary interpolation technique, based on a minimization problem that benefits from nodes inter-correlation, to guarantee the reconstruction of all the empty rows, despite their large number. The simulations confirm the efficiency of the proposed approach and show that it outperforms the existing one by up to 70.101% of Normalized Mean Absolute Error on all missing elements, when the number of active nodes is of about 10% of the total number of nodes.