Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/14696
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPuneeth D.
dc.contributor.authorKulkarni M.
dc.date.accessioned2021-05-05T10:15:40Z-
dc.date.available2021-05-05T10:15:40Z-
dc.date.issued2020
dc.identifier.citationProcedia Computer Science , Vol. 171 , , p. 2242 - 2251en_US
dc.identifier.urihttps://doi.org/10.1016/j.procs.2020.04.242
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/14696-
dc.description.abstractData gathering in an energy efficient way, is one of the crucial concerns in Wireless Sensor Networks (WSNs). With incorporation of Compressive Sensing (CS), as a data aggregation scheme the information contained in the signal, is safely maintained through its projections, which can be reconstructed later. Inclusion of CS, for an energy efficient routing technique further enhances the lifetime of the network. To improve network lifetime, CS has been employed at level 1 (at the leaf nodes). The dimensionality reduction at the transmitter is done, using a measurement matrix. At the receiver, data is recovered using greedy based methods. Greedy based method offers low complexity, and low implementation cost. The success rate of greedy method, depends on the sparsity of the data. Performance evaluation of greedy based method is analyzed, by considering varying sparsity and plotted against number of measurements, required to reconstruct the signal. At the same time, reconstruction error of every method has been evaluated by varying sparsity of the signal. The same is analyzed by considering real temperature, and humidity data sets. © 2020 The Authors. Published by Elsevier B.V.en_US
dc.titleData Aggregation using Compressive Sensing for Energy Efficient Routing Strategyen_US
dc.typeConference Paperen_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.