The handbook of brain theory and neural networks
The nesC language: A holistic approach to networked embedded systems
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
A practical evaluation of radio signal strength for ranging-based localization
ACM SIGMOBILE Mobile Computing and Communications Review
Service discovery in mobile ad hoc networks: A field theoretic approach
Pervasive and Mobile Computing
Location-aware private service discovery in pervasive computing environment
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.