资 源 简 介
Event detection for context consistency is challenging in pervasive computing environments,
in which contexts are often noisy owing to fragile connectivity, node frequent movement
and resource constraints. As a recent scheme, CEDA --- Concurrent Event Detection for Asynchronous consistency checking (CEDA) --- concurrently detects context consistency by exploring the emph{happened-before} relation among events. Nevertheless, CEDA suffers from several problems --- unscalable from partial centralized detection manner, heavy computation
complexity and false negative. To this end, we propose in this paper SECA scheme --- asynchronous event detection for context consistency in pervasive computing.
It puts forward a new type logical clock --- snapshot timestamp --- to check event relations, which enables it to be efficient in scenarios where CEDA fails to. Meanwhile, SECA comes up with a lightweight update mechanism for the snapshot clock, which considerably reduces time and space complex
