Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1594187.1594195acmotherconferencesArticle/Chapter ViewAbstractPublication PagesdmsnConference Proceedingsconference-collections
research-article

Adaptive random sensor selection for field reconstruction in wireless sensor networks

Published: 24 August 2009 Publication History

Abstract

Wireless sensor networks (WSNs) allow for the sampling of a physical phenomenon over long periods of time and across extended geographical areas [1]. Once reported to a central collecting unit, the samples may be used to reconstruct the developing of the physical phenomenon of interest -- also referred to as signal or sensor field -- in both time and space. Work in information theory [3] shows that a reliable signal reconstruction is possible if a sufficiently large number of nodes sample the signal at sufficiently close time and space intervals. Clearly, the achievable quality of the reconstruction can be maximized by letting the highest possible number of nodes collect and report samples. However, on typical sensor nodes, sensing and communication modules require the largest amount of energy and their continuous use can rapidly deplete node batteries [1]. Limiting the number of nodes actively participating in sensing and communication is thus the most effective way to increase the lifetime of both single sensor nodes and the network as a whole [2, 5]. Sensor selection algorithms can be used to schedule individual sensing activity in order to balance the accuracy of the reconstruction with energy consumption. In real WSNs deployments, the irregular spatial distribution of the nodes typically produces nonuniform sampling geometries that and reconstruction techniques able to deal with scattered samples must thus be used. In this context, the ACT reconstruction algorithm [3, Chapter 6] is one of the most computationally efficient and robust techniques known in literature and appears as a perfect fit to perform field reconstruction in WSNs. In particular, the ACT can deal with both very irregular sampling geometries and presence of noise in the data. However, the more the sampling geometry resembles a uniform grid, the better the performance of the ACT. With these considerations in mind, we investigate sensor selection strategies able to generate, given the constraints of the physical network topology, sampling geometries providing limited number of samples but still enabling the ACT to work properly. To this scope, we resort to random sensor selection strategies [2] and propose an adaptive method to determine, in a distributed fashion, the probability of activation of single sensor nodes. Our preliminary experimental results show that our approach succeeds in making the ACT able to reconstruct the sensor field with good accuracy, thereby using a lower number of sensors with respect to other random sensor selection strategies.

References

[1]
I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless sensor networks: A survey. Computer Networks, 38(4):393--422, 2002.
[2]
W. Choi and S. K. Das. Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks. Elsevier Computer Communications, 29:3467--3482, March 2006.
[3]
F. Marvasti, editor. Nonuniform Sampling: Theory and Practice. Springer, Berlin / Heidelberg, 2001. ISBN: 978-0-306-46445-4.
[4]
A. Nordio, C.-F. Chiasserini, and E. Viterbo. Performance of linear reconstruction techniques with noise and uncertain sensor locations. IEEE Transactions on Signal Processing, 56(8):3535--3547, August 2008.
[5]
G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks. ACM Transactions on Sensor Networks, 1(1):36--72, 2005.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
DMSN '09: Proceedings of the Sixth International Workshop on Data Management for Sensor Networks
August 2009
54 pages
ISBN:9781605587776
DOI:10.1145/1594187
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • Olsonet, Inc. (Canada)
  • Arch Rock Corporation (USA)
  • Swiss National Center for Mobile Information and Communication Systems (NCCRMICS) (Switzerland)

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 August 2009

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

DMSN '09
Sponsor:

Acceptance Rates

DMSN '09 Paper Acceptance Rate 6 of 16 submissions, 38%;
Overall Acceptance Rate 6 of 16 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 139
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media