Internet of Things: Security-Based Application Level Lookup Protocol

In the emerging Internet of Things (IOT), lookup service or discovery service plays a critical role, however, current lookup services and discovery services of IoT have not been widely adopted due to some drawbacks or bottlenecks, as well as the item-level lookup service is still missing, moreover, enhancing security and privacy protection does not get enough attention. Therefore, based on the object discovery service architecture (ODSA) a distributed serial number level object discovery service architecture using Chord for the IOT, a security-based application level lookup protocol was provided to enhance the overall security and privacy protection for ODSA. Additionally, some analysis and discussion were given to validate and evaluate our solution. The results show that our solution is available.

IDSA: Chord-Based Discovery Service Architecture for the Internet of Things

Nowadays, the item-level lookup is quickly becoming a key issue in many application scenarios of Internet of Things (IoT). However, as a critical role of IoT, current lookup services and discovery services rely on a centralized or a chain-style framework, thus have some drawbacks, which prevent them from being widely adopted, as well as the item-level lookup service is still missing. Therefore, based on Chord, we presented IDSAa distributed item-level discovery service architecture for IoT, gave its basic framework and some relevant mechanisms to make the lookup services more load-balanced, scalable, and efficient. Additionally, some tests and analysis were given to validate and evaluate our solution. The results show that our solution is available.

HIERARCHICAL PEER-TO-PEER SYSTEMS

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.