Efficient Multi-Keyword Based Service Discovery Routing in Peer-to-Peer IoT Networks

In this paper, we consider semantic based routing for IoT service discovery in peer-to-peer IoT networks. Due to the memory constraints on IoT and edge devices, we focus on the design of routing tables to achieve space-efficient as well as informative routing. To achieve the goal, we develop a scheme to enable routing information summarization, which is commonly used in IP based routing, but has not been done successfully in semantic based routing where keywords are the basis for addressing and lookup query specification. We combine ontology and Bloom filter to achieve summarization of IoT capabilities. To support summarization and reduce the space requirements for routing table indexing, we further developed a coding scheme, OnBF, to represent each IoT capability. Based on OnBF, we design the routing table, the summarization algorithm for the routing table, etc., to achieve efficient, multi-keyword based service discovery in IoT networks. We analytically and experimentally explore our proposed solution and the results show that our solution yields better routing, i.e., lower network traffic and almost optimal routing time (hops) for any given memory constraints for the routing table.