Distributed distance sensitive imesh based service discovery in dense WSAN

Abstract

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. © 2012 Springer-Verlag.