Routing aware space-time compressive sensing for Wireless Sensor Networks

Kortas, Manel; Meghdadi, Vahid; Bouallègue, Ammar; Ezzeddine, Tahar; Habachi, Oussama; Cances, Jean-Pierre

doi:10.1109/pimrc.2017.8292355

Cited by 5 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to handle the under-determined linear systems, efficient convex relaxation and greedy pursuit-based solvers have been proposed, such as NESTA [ 12 ], L1-MAGIC [ 13 ], and orthogonal matching pursuit (OMP) [ 14 ]. Over the past years, plenty of papers have addressed the data gathering problems in WSNs by the integration of the CS theory, which had made appealing progress in the network energy consumption [ 15 , 16 , 17 , 18 , 19 , 20 , 21 ].…”

Section: Related Workmentioning

confidence: 99%

Robust Data Recovery in Wireless Sensor Network: A Learning-Based Matrix Completion Framework

Kortas

Habachi

Bouallègue

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

In this paper, we are interested in the data gathering for Wireless Sensor Networks (WSNs). In this context, we assume that only some nodes are active in the network, and that these nodes are not transmitting all the time. On the other side, the inactive nodes are considered to be inexistent or idle for a long time period. Henceforth, the sink should be able to recover the entire data matrix whie using the few received measurements. To this end, we propose a novel technique that is based on the Matrix Completion (MC) methodology. Indeed, the considered compression pattern, which is composed of structured and random losses, cannot be solved by existing MC techniques. When the received reading matrix contains several missing rows, corresponding to the inactive nodes, MC techniques are unable to recover the missing data. Thus, we propose a clustering technique that takes the inter-nodes correlation into account, and we present a complementary minimization problem based-interpolation technique that guarantees the recovery of the inactive nodes’ readings. The proposed reconstruction pattern, combined with the sampling one, is evaluated under extensive simulations. The results confirm the validity of each building block and the efficiency of the whole structured approach, and prove that it outperforms the closest scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

Robust Data Recovery in Wireless Sensor Network: A Learning-Based Matrix Completion Framework

Kortas

Habachi

Bouallègue

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…The presented MCbased approach requires a fewer number of sensor nodes' readings compared to the algorithms of comparison and hence achieves a longer lifespan for the network. In [17], a Routing-Aware Space-Time Compressive Sensing approach has been proposed in order to improve the trade-off between the network energy saving and the data reconstruction accuracy. However, the issue of energy load balancing between nodes was not addressed in [17] and has been left as a perspective.…”

Section: Related Workmentioning

confidence: 99%

“…In [17], a Routing-Aware Space-Time Compressive Sensing approach has been proposed in order to improve the trade-off between the network energy saving and the data reconstruction accuracy. However, the issue of energy load balancing between nodes was not addressed in [17] and has been left as a perspective. Likewise, Li et al, in [18], have combined the CS and the routing scheme and proposed a Multi-Strip Data Gathering approach for Green data collecting.…”

Section: Related Workmentioning

confidence: 99%

The Energy-Aware Matrix Completion-Based Data Gathering Scheme for Wireless Sensor Networks

et al. 2020

Self Cite

View full text Add to dashboard Cite

In the Wireless Sensor Networks (WSNs), ensuring long-term survival of the sensor devices is crucial, especially for non-energy harvesting networks where the sensors have to deal with the available limited power. Thus, there is a huge need to efficiently select, in each time-slot, a small set of source nodes to monitor the network area and deliver their data to the sink. Note that there is a trade-off between energy efficiency, achieved through data-compression, and the informative quality received by the sink. Moreover, although applying a high data compression ratio extremely reduces the overall network energy consumption, the network lifetime is not necessarily extended due to the uneven energy depletion of the nodes' batteries. To this end, in this paper, we propose the Energy-Aware Matrix Completion based data gathering approach (EAMC), which designates the active nodes according to their residual energy levels. To collect data readings, the proposed EAMC relies on a nodes clustering phase and a MC based data sampling. Then, the interpolation of all the missing data is performed by the sink thanks to a Three-stage MC based recovery framework. Since we are interested in high data loss scenarios, the limited amount of delivered data must be sufficient in terms of informative quality it holds in order to reach a satisfactory recovery accuracy for the entire data. Hence, the EAMC selects the nodes depending on their inter-correlation as well as the network energy efficiency, with the use of a combined energy-aware and correlation-based metric. This introduced active node cost function changes with the type of application one wants to perform with the intention to reach a longer lifespan for the network. Therewith, the numerical results show that the EAMC achieves an attractive and competitive trade-off between the data reconstruction quality and the network lifetime for all the investigated scenarios.

show abstract

“…However, this is a burdensome task since the wireless resources as well as sensors' capabilities are limited. A motivating proposal, Compressive Sensing (CS), has been proposed to reduce the number of active agents at a given time slot, while remaining capable to recover the missing data [1]. Generally, Wireless Sensor Networks (WSNs) consist of a large set of sensor nodes that are self-organising and geographically distributed across the network area.…”

Section: Introductionmentioning

confidence: 99%

“…Indeed, reducing the number of transmitting sensors, using methods such as CS, is not only useful to avoide the collisions but also crucial for sensors who need to sleep to prolong their lifetimes. Over the past years, a plenty of works has managed the data gathering problems in wireless networks by the integration of the CS technique, which made attractive progress in the network energy consumption [1]- [4]. Recently, it has been proven that the integration of Matrix Completion (MC), as an extension of CS, has significantly enhanced WSNs' performances.…”

Section: Introductionmentioning

confidence: 99%

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

Kortas

Habachi

Bouallègue

et al. 2019

2019 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)

Self Cite

View full text Add to dashboard Cite

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 re-transmissions, 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 (MC) 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 sensor 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 missed elements, when the number of active nodes is of about 10% of the total number of sensor nodes.

show abstract

Routing aware space-time compressive sensing for Wireless Sensor Networks

Cited by 5 publications

References 14 publications

Robust Data Recovery in Wireless Sensor Network: A Learning-Based Matrix Completion Framework

Robust Data Recovery in Wireless Sensor Network: A Learning-Based Matrix Completion Framework

The Energy-Aware Matrix Completion-Based Data Gathering Scheme for Wireless Sensor Networks

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

Contact Info

Product

Resources

About