Optimization of Service Discovery in Wireless Sensor Networks

Abstract

With the advancement of ubiquitous computing, new types of Wireless sensor networks (WSNs) have emerged where sensors perform their tasks even as their surrounding network neighborhood changes, nodes terminate unexpectedly and signal strengths vary dynamically. In such scenarios, it is very important to use efficient service discovery algorithms adapt dynamically network changes. In this paper, we present a two level hierarchy for efficient service discovery. First, Proximal Neighborhood Discovery is prerequisite for service discovery followed by Optimal Service Discovery (OSD) which is based on the set of peers that a node should choose in order to utilize its requirements, instead of implementing all its required services itself. We present OSD algorithm, as a new approach in searching for the efficient service providers to obtain required services. We implement the proposed scheme in nesC and perform simulations using the interference-model in TOSSIM. The results show appreciable improvements over conventional approaches.