Performance evaluation of service discovery strategies in ad hoc networks

Service discovery is an important and necessary component of ad hoc networks. To fit within the context of such networks, a post-query model with several service discovery strategies named post-query strategies (Barbeau and Kranakis (2003)) have been proposed, which focus on locating services over an ad hoc network. Each strategy consists of a sequence of post-query protocols executed in rounds. These strategies include: the greedy, incremental, uniform memoryless and with memory post-query strategies. Inspired by these proposals, we define the conservative post-query strategy. This paper represents the performance evaluation of these five strategies in combination with the DSR protocol and DSDV protocol: based on the simulation results.