Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Adaptive compressive sensing based sample scheduling mechanism for wireless sensor networks
Hao J., Zhang B., Jiao Z., Mao S. Pervasive and Mobile Computing22 (C):113-125,2015.Type:Article
Date Reviewed: May 9 2016

Compressed sensing (CS) has matured rapidly and should continue to do so for some time. In CS, a so-called sparse signal is accurately observed using a very small number of samples. Early applications used a fixed sampling scheme, but the need to reduce power consumption and transmission costs in wireless sensor networks (WSNs), among other applications, has led to the idea of an adaptive approach.

Typically, a vector x of dimension N is observed as y = Φ • x, where y has dimension M << N. The sampling rate is then M/N. The authors propose changing M depending on how quickly a signal is changing; a quiescent signal should be sampled at a lower rate. In their application to meteorological data, they contrast relative humidity (RH), which generally changes slowly, with rapidly changing precipitation rate (PR). They conclude that the RH sampling rate can be substantially lower than the PR rate (but see below). One might even wonder if using an error-detecting code might be adequate when the system is in a quiescent state. The authors present good data comparing their scheme to existing schemes.

An intrinsic difficulty with this topic is the proper interpretation of the word “rate.” I think most readers will interpret rate as a time period (in their data 1/120 Hz). But the “sampling rate” in question is actually the ratio of the number of sensors polled to the total number of sensors. Perhaps it would be clearer to call this the “coding rate.”

The example of RH leads one to ask how the proposed system would perform in the event of (effective) discontinuities. While RH generally changes slowly, during frontal passage, it can be effectively discontinuous.

Reviewer:  J. Wolper Review #: CR144391 (1607-0505)
Bookmark and Share
 
Sensor Networks (C.2.1 ... )
 
 
Scheduling (I.2.8 ... )
 
 
Wireless Communication (C.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Sensor Networks": Date
Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks
Nayebi A., Sarbazi-Azad H., Karlsson G. Journal of Systems and Software 83(8): 1310-1317, 2010. Type: Article
Nov 8 2010
Heartbeat of a nest: using imagers as biological sensors
Ko T., Ahmadian S., Hicks J., Rahimi M., Estrin D., Soatto S., Coe S., Hamilton M. ACM Transactions on Sensor Networks 6(3): 1-31, 2010. Type: Article
Jan 10 2011
Efficient clustering-based data aggregation techniques for wireless sensor networks
Jung W., Lim K., Ko Y., Park S. Wireless Networks 17(5): 1387-1400, 2011. Type: Article
May 8 2012
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy