Service Discovery Protocol in Wireless Sensor Networks

In the contemporary digital era, the Internet of Things (IoT) and its applications have proliferated extensively, particularly within smart city environments, resulting in increased network traffic and raising the significance of efficient service discovery (SD) mechanisms. The social Internet of Things (SIoT) is an emerging paradigm that enables IoT devices to autonomously establish social relationships based on rules defined by their owners, thereby enhancing services through social relations. Things can interact with others; thus, the huge volume of traffic is increased. Each node or device could select an appropriate peer for the discovery of services, which is thus helpful for human beings. Although numerous service discovery and query processing models have been proposed in the recent literature. However, the existing state-of-the-art approaches often lack a comprehensive analysis of the parameters. Most traditional state-of-the-art models primarily focus on relationships or device similarity. Also neglecting the vital factors, for instance, query processing, efficiency, spatial-temporal dynamics, and service provisioning, etc. Thus, to solve this issue, this research proposes an exhaustive analysis of the main parameters needed to implement service discovery mechanisms for Social IoT and studies their relative importance based on a dataset of real objects. Based on the advanced parameters' selection, an efficient service discovery algorithm is proposed. The proposed model emphasizes efficiency by optimizing the service discovery through reduced social graph traversal (i.e., fewer hops), consideration of the service types, and integration of caching mechanisms. We have conducted a comprehensive analysis of key parameters essential for implementing an effective service discovery mechanism in SIoT, prioritizing based on their importance. Experimental validation demonstrates the superiority of the proposed over state-of-the-art models, confirming its efficacy, scalability.

With the maturation of wireless networks technologies, Telematics service is becoming a new rising and popular network service and application. In this paper, a centralized vehicular Peer-to-Peer Telematics (C-VP2P) service discovery platform is proposed to provide efficient and feasible service discovery. This paper focuses on the issues of developing a Telematics service platform over the vehicular network environment. When a user needs a service on the road, two issues need to be considered: (1) how to have the candidate list of service providers? (2) how to select suitable service providers from the candidate list? In order to tackle these two issues, we propose a C-VP2P-based system service discovery mechanism using the vehicular P2P messaging protocol. In this paper, the vehicular P2P messaging protocol is designed to communicate among Telematics central server, clients and service providers. In addition, a service discovery mechanism in the C-VP2P system is proposed to achieve high precision discovery for service providers. We also exhibit the performance merits of the proposed C-VP2P Telematics service discovery platform in this paper.

Service discovery is very important in realizing the concept of pervasive computing. Consequently, service discovery protocols must be able to work in the heterogeneous environment offered by pervasive computing. Remote service discovery in particular has not been properly achieved so far. In an attempt to remedy this we propose a new architecture for enabling typical (local) service discovery mechanisms (without the ability of remote service discovery) to discover services remotely. Our architecture uses Universal Plug and Play (UPnP) as an example of local service discovery protocols, and Gnutella as an example of peer-to-peer distributed search protocols. We introduce a module called service mirror builder to the UPnP protocol, and a remote communication protocol over a Gnutella network. As a consequence, UPnP networks become able to discover services in remote networks (that is, remote service discovery).

This chapter describes a framework to support runtime service discovery for Grid applications based on service discovery queries in both push and pull modes of query execution. The framework supports six different types of trigger conditions that may prompt service replacement during run-time of grid business application, and evaluates the relevance of a set of candidate services against service discovery queries. The chapter also describes the language used to express service discovery queries and the three types of fitness measurement used to evaluate the candidate services against these queries. Both synchronous (pull) and asynchronous (push) mechanisms for service discovery are presented and shown to be complimentary in dealing with all six service discovery trigger conditions. The chapter is illustrated through examples.

To make the revelation of ubiquity true different kind of network's integration is going on and this assimilation makes service discovery more challenging because different types of service discovery have been develop for the particular network. A Context-Aware Service Discovery for these amalgam networks is different from usual, especially when we talk about 6LoWPANs functioning with IP Networks, as 6LoWPAN are characterized by low power and low bandwidth, short range and low cost that make the challenge hard. Moreover Interworking of 6LoWPAN with IP networks brings in many challenges for Context-Aware based service discovery issues.In this paper we suggest an advanced service discovery architecture and mechanism that assist proximity and Context Aware based service discovery in IP network and LoWPAN interworked environment. The results show that our architecture helps to discover the closest and exact services from inside as well as outside the LoWPAN according to user requirement. It also reduces the traffic overhead for service discovery considerably.

Intelligent Transportation Systems (ITS) are gaining momentum among researchers. ITS encompasses several technologies, including wireless communications, sensor networks, data and voice communication, real-time driving assistant systems, etc. These states of the art technologies are expected to pave the way for a plethora of vehicular network applications. In fact, recently we have witnessed a growing interest in Vehicular Networks from both the research community and industry. Several potential applications of Vehicular Networks are envisioned such as road safety and security, traffic monitoring and driving comfort, just to mention a few. It is critical that the existence of convenience or driving comfort services do not negatively affect the performance of safety services. In essence, the dissemination of safety services or the discovery of convenience applications requires the communication among service providers and service requesters through constrained bandwidth resources. Therefore, service discovery techniques for vehicular networks must efficiently use the available common resources. In this thesis, we focus on the design of bandwidth-efficient and scalable service discovery protocols for Vehicular Networks. Three types of service discovery architectures are introduced: infrastructure-less, infrastructure-based, and hybrid architectures. Our proposed algorithms are network layer based where service discovery messages are integrated into the routing messages for a lightweight discovery. Moreover, our protocols use the channel diversity for efficient service discovery. We describe our algorithms and discuss their implementation. Finally, we present the main results of the extensive set of simulation experiments that have been used in order to evaluate their performance.

A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks

There are descriptions on general high level procedure from IPTV service provider discovery to content selection and acquisition within ITU-T standards. But, we need more specific description to adopt in our domestic standard development. Therefore, we will describe the detail mechanism and metadata for IPTV service provider and service discovery in this paper. We will also describe the considerations on domestic standard development for interoperability between IPTV terminal and IPTV service providers.

Web services are the new paradigm for distributed computing. They offer interoperability of application and integration of large scale distributed systems. Amongst the web service standards, service registry is crucial to the overall utility of web service technology. However, the web services discovery mechanism pertaining with the UDDI [1] registry is inefficient because it only supports keyword-based and category-based matching, leading to irrelevant matches. Therefore, the provision of the scalable, flexible and robust web services publication and discovery system is crucial for the overall utility of web services. In this paper, we develop a scalable, robust and efficient infrastructure for web services publication and discovery amongst domain-based registries. More importantly, a novel algorithm is provided to classify web services into domain-based registries based on their semantic description. Experimental results show that our approach outperforms a centralized approach in terms of service discovery time.

Efficient resource discovery plays a vital role in the effective management of resources and applications in heterogeneous computing environments. Therefore, the knowledge of applications' behavior and resources' usage pattern improves resource discovery decisions. This knowledge can be provided for the resource discovery mechanism by cooperating with the load balancing mechanism. In this paper, we formulate their cooperation by considering some parameters that represent applications' behavior and resources' usage patterns and extract the relation between them to introduce a formula using mathematical methods. Further, the resource discovery mechanism uses the formula to predict resources' load before assigning them new processes and thus it prevents resource overloading which happens frequently in computing environments.

We investigated performance of localized distance-sensitive service discovery algorithm iMesh, which generates information structure in static network, to store the information about nearby actors (service providers). In a network with grid structure, this is achieved by advertising service provider positions in four geographical directions. The propagation of information about remote service providers is restricted by a blocking rule, to reduce the message overhead and provide distance sensitivity. A node requiring service (service consumer) conducts lookup process to obtain information about nearby service providers from the iMesh structure. We modified iMesh to enable its use in dense networks with topologies other than grid by introducing iMesh areas instead of iMesh edges. Our simulations compare performance of modified iMesh with another localized service discovery scheme (quorum) in dense networks with random topologies. We show that iMesh finds the nearest service provider in >95% of cases. It significantly decreases the message overhead compared to quorum, without compromising quality of service discovery.

Service discovery is an essential task in pervasive computing environments. Simple and efficient service discovery enables heterogeneous and pervasive computing devices and services to be easier to use. In this chapter, we discuss the key issues and solutions for service discovery architecture and protocol design for pervasive computing environments. Service design addresses the static and dynamic properties of services. Directory design focuses on scalability, topology, and infrastructure issues. Service integration uses services as building blocks to achieve complex services. Cross-layer design optimizes the performance of the protocols for ad hoc and sensor networks by integrating service discovery processes into lower layers of the network protocols. Security and privacy design protects the information, communication, devices, and services. We also point out the future research issues.

Service discovery (SD) protocols in Wireless Sensor Networks (WSNs) enable the sensor nodes to locate services offered by other nodes in the same or any other network and invoke the services. But it is a crucial task for sensors to perform timely service discovery in a pervasive environment. Also ongoing research in this field is limited with only few SD protocols proposed for some specific use cases. So in order to facilitate the research based on finding the efficient SD schemes, we have discussed many service discovery protocols and architectures by classifying them in different categories. The detailed analysis would help bringing the open research issues to the surface, which needs to be addressed in future.

In this paper, an agent-based cross-layer secure service discovery scheme has been presented. Service discovery in MANET is a critical task and it presents numerous security challenges. These threats can compromise the availability, privacy and integrity of service discovery process and infrastructure. This paper highlights various security challenges prevalent to service discovery in MANET. Then, in order to address these security challenges, the paper proposes a cross-layer, agent based secure service discovery scheme for MANET based on deep neural network. The software agents will monitor the intrusive activities in the network based on an Intrusion Detection System (IDS). The service discovery operation is performed based on periodic dissemination of service, routing and security information. The QoS provisioning is achieved by encapsulating QoS information in the periodic advertisements done by service providers. The proposed approach has been implemented in JIST/ SWANS simulator. The results show that proposed approach provides improved security, scalability, latency, packet delivery ratio and service discovery success ratio, for various simulation scenarios.

As more and more Web services are deployed, Web service's discovery mechanisms become essential. Similar services can have quite different QoS behaviors. For service selection and management purpose, it is necessary to clearly specify QoS constraints and metrics definitions for Web services. We investigate on the semantic QoS specification and introduce our design principles on it. Based on the specification refinement and conformance, we introduce the QoS matchmaking algorithm with multiple matching degrees. The matchmaking prototype is designed to prove the feasibility. Well-defined Metrics can be further utilized by measurement organizations to monitor and evaluate the promised service level objectives.