Article: Asynchronous event detection for context inconsistency in pervasive computing Journal: International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC) 2012 Vol.11 No.4 pp.195 - 205 Abstract: Event detection for context inconsistency is challenging in pervasive computing environments, where contexts are often noisy owing to fragile connectivity, node frequent movement and resource constraints. As a recent scheme, CEDA - Concurrent Event Detection for Asynchronous inconsistency checking (CEDA) - concurrently detects context inconsistency by exploring the happened-before relation among events. Nevertheless, CEDA suffers from several problems - unscalable from partial centralised detection manner, heavy computation complexity and false negative. To address these challenges, we propose in this paper the SECA scheme - asynchronous event detection for context inconsistency in pervasive computing. It puts forward a new type logical clock - snapshot timestamp - to check event relations, which enables it to be efficient in the scenarios where CEDA fails to. Meanwhile, SECA comes up with a lightweight update mechanism for the snapshot clock, which considerably reduces time and space complexity. Extensive experiments have been conducted and results show that SECA surmounts CEDA with respect to detection accuracy and scalability. Inderscience Publishers - linking academia, business and industry through research

Title: Asynchronous event detection for context inconsistency in pervasive computing

Authors: Daqiang Zhang; Zhangbing Zhou; Qin Zou; Tianyi Zhan; Minho Jo

Addresses: School of Computer Science, Nanjing Normal University, Nanjing 210046, China ' School of Information Engineering, 100083, China University of Geosciences (Beijing), China ' School of Computer, Wuhan University, Wuhan 430079, China ' Department of Computer Science, Nanjing University, Nanjing 210032, China ' College of Information and Communications, Korea University, Seoul 136701, South Korea

Abstract: Event detection for context inconsistency is challenging in pervasive computing environments, where contexts are often noisy owing to fragile connectivity, node frequent movement and resource constraints. As a recent scheme, CEDA - Concurrent Event Detection for Asynchronous inconsistency checking (CEDA) - concurrently detects context inconsistency by exploring the happened-before relation among events. Nevertheless, CEDA suffers from several problems - unscalable from partial centralised detection manner, heavy computation complexity and false negative. To address these challenges, we propose in this paper the SECA scheme - asynchronous event detection for context inconsistency in pervasive computing. It puts forward a new type logical clock - snapshot timestamp - to check event relations, which enables it to be efficient in the scenarios where CEDA fails to. Meanwhile, SECA comes up with a lightweight update mechanism for the snapshot clock, which considerably reduces time and space complexity. Extensive experiments have been conducted and results show that SECA surmounts CEDA with respect to detection accuracy and scalability.

Keywords: context inconsistency; context awareness; event detection; snapshot-based timestamp; ubiquitous computing; synchronous events; pervasive computing.

DOI: 10.1504/IJAHUC.2012.050440

International Journal of Ad Hoc and Ubiquitous Computing, 2012 Vol.11 No.4, pp.195 - 205

Received: 10 Oct 2011
Accepted: 13 Apr 2012
Published online: 22 Nov 2012 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Asynchronous event detection for context inconsistency in pervasive computing

Keep up-to-date