Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor Networks

Accelerating energy consumption and increasing data traffic have become prominent in large-scale wireless sensor networks (WSNs). Compressive sensing (CS) can recover data through the collection of a small number of samples with energy efficiency. General CS theory has several limitations when appli...

Full description

Bibliographic Details
Main Authors: Zhi-qiang Zou, Ze-ting Li, Shu Shen, Ru-chuan Wang
Format: Article
Language:English
Published: SAGE Publishing 2016-02-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2016/7256396
id doaj-f4ede3f2f3bf42c08d45d4cac206be83
record_format Article
spelling doaj-f4ede3f2f3bf42c08d45d4cac206be832020-11-25T03:34:12ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772016-02-011210.1155/2016/72563967256396Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor NetworksZhi-qiang Zou0Ze-ting Li1Shu Shen2Ru-chuan Wang3 Department of Geography, University of Wisconsin-Madison, Madison, WI 53706, USA College of Computer, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu 210003, China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, ChinaAccelerating energy consumption and increasing data traffic have become prominent in large-scale wireless sensor networks (WSNs). Compressive sensing (CS) can recover data through the collection of a small number of samples with energy efficiency. General CS theory has several limitations when applied to WSNs because of the high complexity of its l 1 -based conventional convex optimization algorithm and the large storage space required by its Gaussian random observation matrix. Thus, we propose a novel solution that allows the use of CS for compressive sampling and online recovery of large data sets in actual WSN scenarios. The l 0 -based greedy algorithm for data recovery in WSNs is adopted and combined with a newly designed measurement matrix that is based on LEACH clustering algorithm integrated into a new framework called data acquisition framework of compressive sampling and online recovery (DAF_CSOR). Furthermore, we study three different greedy algorithms under DAF_CSOR. Results of evaluation experiments show that the proposed sparsity-adaptive DAF_CSOR is relatively optimal in terms of recovery accuracy. In terms of overall energy consumption and network lifetime, DAF_CSOR exhibits a certain advantage over conventional methods.https://doi.org/10.1155/2016/7256396
collection DOAJ
language English
format Article
sources DOAJ
author Zhi-qiang Zou
Ze-ting Li
Shu Shen
Ru-chuan Wang
spellingShingle Zhi-qiang Zou
Ze-ting Li
Shu Shen
Ru-chuan Wang
Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor Networks
International Journal of Distributed Sensor Networks
author_facet Zhi-qiang Zou
Ze-ting Li
Shu Shen
Ru-chuan Wang
author_sort Zhi-qiang Zou
title Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor Networks
title_short Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor Networks
title_full Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor Networks
title_fullStr Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor Networks
title_full_unstemmed Energy-Efficient Data Recovery via Greedy Algorithm for Wireless Sensor Networks
title_sort energy-efficient data recovery via greedy algorithm for wireless sensor networks
publisher SAGE Publishing
series International Journal of Distributed Sensor Networks
issn 1550-1477
publishDate 2016-02-01
description Accelerating energy consumption and increasing data traffic have become prominent in large-scale wireless sensor networks (WSNs). Compressive sensing (CS) can recover data through the collection of a small number of samples with energy efficiency. General CS theory has several limitations when applied to WSNs because of the high complexity of its l 1 -based conventional convex optimization algorithm and the large storage space required by its Gaussian random observation matrix. Thus, we propose a novel solution that allows the use of CS for compressive sampling and online recovery of large data sets in actual WSN scenarios. The l 0 -based greedy algorithm for data recovery in WSNs is adopted and combined with a newly designed measurement matrix that is based on LEACH clustering algorithm integrated into a new framework called data acquisition framework of compressive sampling and online recovery (DAF_CSOR). Furthermore, we study three different greedy algorithms under DAF_CSOR. Results of evaluation experiments show that the proposed sparsity-adaptive DAF_CSOR is relatively optimal in terms of recovery accuracy. In terms of overall energy consumption and network lifetime, DAF_CSOR exhibits a certain advantage over conventional methods.
url https://doi.org/10.1155/2016/7256396
work_keys_str_mv AT zhiqiangzou energyefficientdatarecoveryviagreedyalgorithmforwirelesssensornetworks
AT zetingli energyefficientdatarecoveryviagreedyalgorithmforwirelesssensornetworks
AT shushen energyefficientdatarecoveryviagreedyalgorithmforwirelesssensornetworks
AT ruchuanwang energyefficientdatarecoveryviagreedyalgorithmforwirelesssensornetworks
_version_ 1724559923903201280