An efficient compressive data gathering routing scheme for large-scale wireless sensor networks
Date
2013
Authors
Wu, X.
Xiong, Y.
Huang, W.
Shen, H.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Computers and Electrical Engineering, 2013; 39(6):1935-1946
Statement of Responsibility
Xuangou Wu, Yan Xiong, Wenchao Huang, Hong Shen, Mingxi Li
Conference Name
Abstract
Compressive sensing based in-network compression is an efficient technique to reduce communication cost and accurately recover sensory data at the sink. Existing compressive sensing based data gathering methods require a large number of sensors to participate in each measurement gathering, and it leads to waste a lot of energy. In this paper, we present an energy efficient clustering routing data gathering scheme for large-scale wireless sensor networks. The main challenges of our scheme are how to obtain the optimal number of clusters and how to keep all cluster heads uniformly distributed. To solve the above problems, we first formulate an energy consumption model to obtain the optimal number of clusters. Second, we design an efficient deterministic dynamic clustering scheme to guarantee all cluster heads uniformly distributed approximately. With extensive simulation, we demonstrate that our scheme not only prolongs nearly 2× network's lifetime compared with the state of the art compressive sensing based data gathering schemes, but also makes the network energy consumption very uniformly. © 2013 Elsevier Ltd. All rights reserved.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2013 Elsevier Ltd. All rights reserved.