Take a look at the new version of this page: [ beta version ]. Tell us what you think.

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 , E. Cayirci, Wireless sensor networks: a survey, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.38 n.4, p.393-422, 15 March 2002 [doi>10.1016/S1389-1286(01)00302-4]
• 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: Guoliang Xing , Xiaorui Wang , Yuanfang Zhang , Chenyang Lu , Robert Pless , Christopher Gill, Integrated coverage and connectivity configuration for energy conservation in sensor networks, ACM Transactions on Sensor Networks (TOSN), v.1 n.1, p.36-72, August 2005 [doi>10.1145/1077391.1077394]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Distributed databases

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.m Miscellaneous
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.4 Systems and Software
          Subjects: Distributed systems

General Terms:
Design, Management, Theory