The publish/subscribe model for communication has proved to be the most suitable in the Internet of things (IoT) environment because of the decoupling provided by this model that supports communication among heterogeneous parties. The standard or common publish/subscribe uses exact model to match events to subscriptions. However, in the IoT environment, an exact match is an extreme requirement because of the diverse and large environment and generation of various forms of Smart data. Therefore, semantically similar events must be considered and returned to subscribers as a possible match. However, matching events approximately to subscriptions is a much more complex task that negatively affects the efficiency of matching. Our proposed algorithm, semantic matching using the tree structure (SMT), provides efficient communication to support time-critical applications. SMT achieved linear time in terms of throughput compared with exponential time achieved in previous work. Combining SMT with taxonomy clustering improved the effectiveness in terms of the F-score, which is an indication of the recall and precision of the results, particularly when 100% of subscriptions were to be semantically matched.

An efficient event matching system for semantic smart data in the Internet of Things (IoT) environment

Fortino, Giancarlo
2019

Abstract

The publish/subscribe model for communication has proved to be the most suitable in the Internet of things (IoT) environment because of the decoupling provided by this model that supports communication among heterogeneous parties. The standard or common publish/subscribe uses exact model to match events to subscriptions. However, in the IoT environment, an exact match is an extreme requirement because of the diverse and large environment and generation of various forms of Smart data. Therefore, semantically similar events must be considered and returned to subscribers as a possible match. However, matching events approximately to subscriptions is a much more complex task that negatively affects the efficiency of matching. Our proposed algorithm, semantic matching using the tree structure (SMT), provides efficient communication to support time-critical applications. SMT achieved linear time in terms of throughput compared with exponential time achieved in previous work. Combining SMT with taxonomy clustering improved the effectiveness in terms of the F-score, which is an indication of the recall and precision of the results, particularly when 100% of subscriptions were to be semantically matched.
Event matching; IoT; Publish/subscribe; Semantic; Software; Hardware and Architecture; Computer Networks and Communications
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/290025
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 10
social impact