IEEE Transactions on Parallel and Distributed Systems · 2014 · 266 citations · 46 references
EngineeringElectrical EngineeringInformation TheoryLow-power DesignWireless CommunicationsData CompressionLossy Data CompressionSensor NetworksWireless NetworksWireless Sensor NetworksCompressed SensingCompressibilityCompressive SensingEnergy ConsumptionEstimation ErrorNetwork LifetimeRandom ProjectionRobustness
Data collection is a crucial operation in wireless sensor networks. The design of data collection schemes is challenging due to the limited energy supply and the hot spot problem. Leveraging empirical observations that sensory data possess strong spatiotemporal compressibility, this paper proposes a novel compressive data collection scheme for wireless sensor networks. We adopt a power-law decaying data model verified by real data sets and then propose a random projection-based estimation algorithm for this data model. Our scheme requires fewer compressed measurements, thus greatly reduces the energy consumption. It allows simple routing strategy without much computation and control overheads, which leads to strong robustness in practical applications. Analytically, we prove that it achieves the optimal estimation error bound. Evaluations on real data sets (from the GreenOrbs, IntelLab and NBDC-CTD projects) show that compared with existing approaches, this new scheme prolongs the network lifetime by 1.5X to 2X for estimation error 5-20 percent.
46
Wireless sensor networks: a survey
Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam · Computer Networks · 2002 · 17.4K citations
Nearest neighbor pattern classification
Thomas M. Cover, Peter E. Hart · IEEE Transactions on Information Theory · 1967 · 16.1K citations
The capacity of wireless networks
Piyush Gupta, P. R. Kumar · IEEE Transactions on Information Theory · 2000 · 8.4K citations