Implementation of compressive sampling for wireless sensor network applications Online publication date: Wed, 06-Nov-2019
by Nathan A. Ruprecht; Xinrong Li
International Journal of Sensor Networks (IJSNET), Vol. 31, No. 4, 2019
Abstract: Since mid-20th century, Nyquist-Shannon Sampling Theorem is accepted as we need to sample a signal at twice the max frequency component in order to reconstruct it. Compressive sampling (CS) offers a possible solution of sampling sub-Nyquist and reconstructing using convex programming techniques. There has been significant advancements in CS research and development (more notably since mid-2000s in theory and proofs), but still nothing to the advantage of everyday use. There has been little work on hardware in finding realistic constraints of a working CS system used for digital signal processing (DSP) applications. Parameters used in a system are usually assumed based on stochastic models, but not optimised towards a specific application. This paper aims to address a minimal viable platform to implement compressive sensing if applied to a wireless sensor network (WSN), as well as addressing key parameters of CS algorithms to be determined depending on application requirements and constraints.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook