Please use this identifier to cite or link to this item:
|Web of Science®
|An efficient compressive data gathering routing scheme for large-scale wireless sensor networks
|Computers and Electrical Engineering, 2013; 39(6):1935-1946
|Pergamon-Elsevier Science Ltd
|Xuangou Wu, Yan Xiong, Wenchao Huang, Hong Shen, Mingxi Li
|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.
|© 2013 Elsevier Ltd. All rights reserved.
|Appears in Collections:
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.