ABSTRACT
We present an implementation of a system for managing evolving shapes in Wireless Sensor Networks (WSN). A shape is a contiguous region in which the measurements of the sensors detect values above a given threshold. Our system, in its current version, solves two important problems: (1) Detecting and tracking the changes of boundaries; (2) Detecting an occurrence of within distance predicate for two (or more) shapes. A centralized approach (transmitting raw measurements to a dedicated sink) incurs communication overhead, so we developed distributed algorithms for managing the predicates related to evolving shapes. This demo will present the implementation of our solutions in a heterogeneous WSN consisting of TelosB and SunSPOT motes. It will also illustrate the end-user tools: interface for specifying the parameters of the predicates, along with real-time visualization of their evaluation.
- B. Avci, G. Trajcevski, and P. Scheuermann. Managing evolving shapes in sensor networks. In SSDBM, 2014. Google ScholarDigital Library
- S. Duttagupta, K. Ramamritham, and P. Kulkarni. Tracking dynamic boundaries using sensor network. IEEE Trans. PDP, 22(10), Oct 2011. Google ScholarDigital Library
- S. Gandhi, J. Hershberger, and S. Suri. Approximate isocontours and spatial summaries for sensor networks. In IPSN. Google ScholarDigital Library
- S. Madden, M. Franklin, J. Hellerstein, and W. Hong. Tinydb: An acquisitional query processing system for sensor networks. ACM TODS, 30(1), 2005. Google ScholarDigital Library
- R. Szewczyk, A. M. Mainwaring, J. Polastre, J. Anderson, and D. E. Culler. An analysis of a large scale habitat monitoring application. In SenSys, pages 214--226, 2004. Google ScholarDigital Library
Index Terms
- Evolving shapes in wireless sensor networks
Recommendations
Managing evolving shapes in sensor networks
SSDBM '14: Proceedings of the 26th International Conference on Scientific and Statistical Database ManagementThis work addresses the problem of efficient distributed detection and tracking of mobile and evolving/deformable spatial shapes in Wireless Sensor Networks (WSN). The shapes correspond to contiguous regions bounding the locations of sensors in which ...
Sensor scheduling for p-percent coverage in wireless sensor networks
We study sensor scheduling problems of p-percent coverage in this paper and propose two scheduling algorithms to prolong network lifetime due to the fact that for some applications full coverage is not necessary and different subareas of the monitored ...
Relay Node Placement in Wireless Sensor Networks
A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...
Comments