Internetware: a shift of software paradigm
Proceedings of the First Asia-Pacific Symposium on Internetware
Middleware clocks for sensing the physical world
Proceedings of the 5th International Workshop on Middleware Tools, Services and Run-Time Support for Sensor Networks
Immediate detection of predicates in pervasive environments
Proceedings of the 9th International Workshop on Adaptive and Reflective Middleware
A lattice-theoretic approach to runtime property detection for pervasive context
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
Querying context maps using relative timing predicates in pervasive environments
Proceedings of the 6th International Workshop on Middleware Tools, Services and Run-time Support for Networked Embedded Systems
Immediate detection of predicates in pervasive environments
Journal of Parallel and Distributed Computing
Adam: Identifying defects in context-aware adaptation
Journal of Systems and Software
Using request queues for enhancing the performance of operations in smart homes
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Asynchronous event detection for context inconsistency in pervasive computing
International Journal of Ad Hoc and Ubiquitous Computing
Middleware for pervasive computing: A survey
Pervasive and Mobile Computing
Decentralized checking of context inconsistency in pervasive computing environments
The Journal of Supercomputing
Hi-index | 0.00 |
Contexts, the pieces of information that capture the characteristics of computing environments, are often inconsistent in the dynamic and uncertain pervasive computing environments. Various schemes have been proposed to check context consistency for pervasive applications. However, existing schemes implicitly assume that the contexts being checked belong to the same snapshot of time. This limitation makes existing schemes do not work in pervasive computing environments, which are characterized by the asynchronous coordination among computing devices. The main challenge imposed on context consistency checking by asynchronous environments is how to interpret and detect concurrent events. To this end, we propose in this paper the Concurrent Events Detection for Asynchronous consistency checking (CEDA) algorithm. An analytical model, together with corresponding numerical results, is derived to study the performance of CEDA. We also conduct extensive experimental evaluation to investigate whether CEDA is desirable for context-aware applications. Both theoretical analysis and experimental evaluation show that CEDA accurately detects concurrent events in time in asynchronous pervasive computing environments, even with dynamic changes in message delay, duration of events and error rate of context collection.