Conference Paper

Efficient Aggregate Computations in Large-Scale Dense WSN.

IPP-HURRAY Res. Group CISTER/ISEP, Polytech. Inst. of Porto, Porto
DOI: 10.1109/RTAS.2009.22 Conference: 15th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2009, San Francisco, CA, USA, 13-16 April 2009
Source: IEEE Xplore

ABSTRACT We focus on large-scale and dense deeply embedded systems where, due to the large amount of information generated by all nodes, even simple aggregate computations such as the minimum value (MIN) of the sensor readings become notoriously expensive to obtain. Recent research has exploited a dominance-based medium access control(MAC) protocol, the CAN bus, for computing aggregated quantities in wired systems. For example, MIN can be computed efficiently and an interpolation function which approximates sensor data in an area can be obtained efficiently as well. Dominance-based MAC protocols have recently been proposed for wireless channels and these protocols can be expected to be used for achieving highly scalable aggregate computations in wireless systems. But no experimental demonstration is currently available in the research literature. In this paper, we demonstrate that highly scalable aggregate computations in wireless networks are possible. We do so by (i) building a new wireless hardware platform with appropriate characteristics for making dominance-based MAC protocols efficient, (ii) implementing dominance-based MAC protocols on this platform, (iii) implementing distributed algorithms for aggregate computations (MIN, MAX, Interpolation) using the new implementation of the dominance-based MAC protocol and (iv) performing experiments to prove that such highly scalable aggregate computations in wireless networks are possible.

0 Bookmarks
 · 
59 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses sensor network applications which need to obtain an accurate image of physical phenomena and do so with a high sampling rate in both time and space. We present a fast and scalable approach for obtaining an approximate representation of all sensor readings at high sampling rate for quickly reacting to critical events in a physical environment. This approach is an improvement on previous work in that after the new approach has undergone a startup phase then the new approach can use a very small sampling period.
    11/2011: pages 17-31;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In order to extract detailed information about the environment, a mass of high dimensional nonlinear data information were collected by wireless multimedia sensor network nodes. The analysis and visualization of sensory data is a very important aspect of sensor network application system. In this paper, we propose Locally Linear Approximating (LLA) algorithm. It reaches the aim of locally linear approximating through adopting the way of direct gradients estimation, thus realizes the dimensionality reduction of the high-dimensional nonlinear data. The presented algorithm is proven to satisfy its goals through the computer simulations, and can provide a basis for the complex nonlinear sensory data classification and retrieval.
    Proceedings of the IEEE International Conference on Networking, Sensing and Control, ICNSC 2010, Chicago, IL, USA, 10-12 April 2010; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: WiDom is a wireless prioritized medium access control (MAC) protocol which offers a very large number of priority levels. Hence, it brings the potential for employing non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. One schedulability analysis for WiDom has already been proposed but recent research has created a new version of WiDom with lower overhead (we call it: WiDom with a master node) and for this version of WiDom no schedulability analysis exists. Also, common to the previously proposed schedulability analyses for WiDom is that they cannot analyze message streams with release jitter. Therefore, in this paper we propose a new schedulability analysis for WiDom (with a master node). We also extend the WiDom analyses (with and without master node) to work also for message streams with release jitter.
    01/2010;

Full-text (3 Sources)

View
50 Downloads
Available from
Jun 1, 2014