CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Unbalanced Expander Based Compressive Data Gathering in Clustered Wireless Sensor Networks
Authors
X Li
G Mao
X Tao
Publication date
1 January 2017
Publisher
'Institute of Electrical and Electronics Engineers (IEEE)'
Doi
Cite
Abstract
© 2013 IEEE. CConventional compressive sensing-based data gathering (CS-DG) algorithms require a large number of sensors for each compressive sensing measurement, thereby resulting in high energy consumption in clustered wireless sensor networks (WSNs). To solve this problem, we propose a novel energy-efficient CS-DG algorithm, which exploits the better reconstruction accuracy of the adjacency matrix of an unbalanced expander graph. In the proposed CS-DG algorithm, each measurement is the sum of a few sensory data, which are jointly determined by random sampling and random walks. Through theoretical analysis, we prove that the constructedM×N sparse binary sensing matrix is the adjacency matrix of a (k; ") unbalanced expander graph whenM=D O(N=k) and t=D O.Nc=(kq) for WSNs with Nc clusters, where 0 ≤q≤1 and Nc > k. Simulation results show our proposed CS-DG has better performance than existing algorithms in terms of reconstruction accuracy and energy consumption. When hybrid energy-efficient distributed clustering algorithm is used, to achieve the same reconstruction accuracy, our proposed CS-DG can save energy by at least 27:8%
Similar works
Full text
Available Versions
OPUS - University of Technology Sydney
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:opus.lib.uts.edu.au:10453/...
Last time updated on 18/10/2019