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
 · 
52 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: As the size and cost of embedded devices continue to decrease, it becomes economically feasible to densely deploy networks with very large quantities of such nodes, and thus enabling the implementation of networks with increasingly larger number of nodes becomes a relevant problem. In this paper we describe a novel algorithm to obtain the number of live nodes with a very low time-complexity. In particular, we develop a mechanism to estimate the number of nodes or the number of proposed values (COUNT), with a time complexity that increases sublinearly with the number of nodes. The approach we propose is based on the wise exploitation of dominance-based protocols and offers excellent scalability properties for emerging applications in dense Cyber Physical Systems.
    Cyber-Physical Systems, Networks, and Applications (CPSNA), 2013 IEEE 1st International Conference on; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Very dense networks offer a better resolution of the physical world and therefore a better capability of detecting the occurrence of an event; this is of paramount importance for a number of industrial applications. However, the scale of such systems poses huge challenges in terms of interconnectivity and timely data processing. In this paper we will look at efficient scalable data acquisition methods for such densely instrumented cyber-physical systems. Previous research works have proposed approaches for obtaining an interpolation of sensor readings from different sensor nodes. Those approaches are based on dominance protocols, presenting therefore excellent scalability properties for dense instrumented systems. In this paper we propose an important advance to the state-of-the-art. Our novel approach not only incorporates a physical model to enable more accurate approximate interpolations but it also detects and self-adapts to changes in the physical model.
    Industrial Embedded Systems (SIES), 2013 8th IEEE International Symposium on; 01/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In networked control systems, the Try-Once-Discard (TOD) protocol is of high interest because its properties can be characterized by Lyapunov functions. This feature makes it practical to incorporate TOD into Lyapunov-based design of linear and nonlinear control systems, yielding a self-contained theory for system stabilization. In previous work, candidates for TOD realizations for single-hop (wired and wireless) networks have been proposed. However, it has been a hitherto open question whether TOD can be realized in wireless multihop networks. In fact, it is far from obvious how dynamic value-based competition with deterministically bounded maximum delay, as required by TOD, is achievable in wireless multihop networks. In this paper, we give a positive answer to this question, by presenting a functionally complete realization of TOD in wireless multihop networks. Our solution is based on highly accurate multihop tick synchronization, and applies an algorithm for collision-protected network-wide value arbitration with deterministic delay. We provide experimental evidence for the feasibility of our solution on existing micro controller platforms, and assess our TOD realization in a batch reactor scenario.
    IEEE Transactions on Industrial Informatics 01/2014; · 8.79 Impact Factor

Full-text (3 Sources)

View
47 Downloads
Available from
Jun 1, 2014