Checking Behavioral Consistency Constraints for Pervasive Context in Asynchronous Environments

Source: DBLP


Context consistency checking, the checking of specified constraint on properties of contexts, is essential to context-aware applications. In order to delineate and adapt to dynamic changes in the pervasive computing environment, context-aware applications often need to specify and check behavioral consistency constraints over the contexts. This problem is challenging mainly due to the distributed and asynchronous nature of pervasive computing environments. Specifically, the critical issue in checking behavioral constraints is the temporal ordering of contextual activities. The contextual activities usually involve multiple context collecting devices, which are fully-decentralized and interact in an asynchronous manner. However, existing context consistency checking schemes do not work in asynchronous environments, since they implicitly assume the availability of a global clock or relay on synchronized interactions. To this end, we propose the Ordering Global Activity (OGA) algorithm, which detects the ordering of the global activities based on predicate detection in asynchronous environments. The essence of our approach is the message causality and its on-the-fly coding as logic vector clocks in asynchronous environments. We implement the Middleware Infrastructure for Predicate detection in Asynchronous environments (MIPA), over which the OGA algorithm is implemented and evaluated. The evaluation results show the impact of asynchrony on the checking of behavioral consistency constraints, which justifies the primary motivation of our work. They also show that OGA can achieve accurate checking of behavioral consistency constraints in dynamic pervasive computing environments. Comment: 9 pages, 9 figures

Download full-text


Available from: Xianping Tao, Jul 04, 2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. Existing property detection schemes implicitly assume that contexts under detection belong to the same snapshot of time. However, this assumption does not necessarily hold in the asynchronous pervasive computing environments. To cope with the asynchrony, we first model environment behavior based on logical time. One key notion of our model is that all meaningful observations of the environment have the lattice structure. Then we propose the LAT algorithm, which maintains the lattice of meaningful observations at runtime. We also propose the LATPD algorithm, which achieves detection of contextual properties at runtime. We implement algorithms over the open-source context-aware middleware MIPA, and simulations are conducted. The evaluation results show that LAT and LATPD support effective detection of contextual properties in asynchronous environments.
    Full-text · Conference Paper · Oct 2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: A weak conjunctive predicate is a conjunction of local predicates that is evaluated under the Possibly modality. In this study, we have proposed a distributed on-line algorithm for detecting weak conjunctions of unstable predicates in dynamic systems. In the algorithm, a virtual network of a logical ring combined with computation trees is dynamically maintained using local variables to keep track of causality relationships between distributed events. The differential technique is exploited to minimize the size of detection related information. During the execution of the distributed computation, each process maintains a vector containing potential solutions. Detection will be announced when the global predicate is verified. This algorithm does not require extra messages except those for process termination. The detection of a solution may not be announced until the termination of the underlying distributed computation in the case where a process never communicates with others. At each process, storage need is proportional to the number of processes in the system. This demand will increase in some extreme cases, although they are very rare in practice.
    No preview · Conference Paper · Dec 2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Pervasive computing environments are composed of numerous smart entities (objects and human alike) which are interconnected through contextual links in order to create a Web of physical objects. The contextual links can be based on matching context attribute-values (e.g., co-location) or social connections. We call such a Web of smart physical objects as context map. Context maps can be used for context-aware search and browse of the physical world. However, changes of dynamic context values over time may render a context map inconsistent. So, it is important to update contextual links with changes in specific context values. Given the asynchronous nature of pervasive environments, it is non-trivial to detect events generated by contextual changes in real time. We propose two algorithms for instantaneous and periodic detection of events with concurrent timing relations. Our algorithms have low time complexity and they can address the needs of different types of pervasive computing applications. We have evaluated our proposed algorithms through simulations as well as test bed experiments.
    Preview · Conference Paper · Jan 2012