A Three-Phase Top-k Query Based Distributed Data Collection Scheme in Wireless Sensor Networks
Author(s) -
Guorui Li,
Jingsha He,
Cong Wang
Publication year - 2015
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2015/856507
Subject(s) - computer science , wireless sensor network , thresholding , algorithm , distributed algorithm , scheme (mathematics) , data mining , compressed sensing , distributed computing , computer network , artificial intelligence , mathematics , mathematical analysis , image (mathematics)
We propose a three-phase top-k query based distributed data collection scheme which is designed for clustered or multisink wireless sensor networks. The proposed scheme consists of a distributed iterative hard thresholding algorithm and a three-phase top-k query algorithm. In the distributed iterative hard thresholding algorithm, the cluster heads or sink nodes reconstruct the compressed data in a distributed and cooperative manner. Meanwhile, the top-k query operation in the above algorithm is realized by pruning unnecessary elements among cluster heads or sink nodes in the three-phase top-k query algorithm. Simulation results show that there is no obvious difference in the performance of data reconstruction between our proposed scheme and existing compressive sensing theory based data collection schemes. However, both the number of interactions and the amount of transmitted data among cluster heads or sink nodes can be effectively reduced in the proposed scheme. The performance of the proposed scheme is analyzed in detail in this paper to support the claims.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom