Service discovery is an important and necessary component of ad hoc networks. To fit within the context of ad hoc networks, a Post-query model with several service discovery strategies named Post-query strategies have been proposed, by Barbeau and Kranakis, which focus on locating services over an ad hoc network. Each strategy consists of a sequence of Post-query protocols executed in rounds. They proposed four types of Post-query strategies: the greedy, incremental, uniform memoryless and with memory strategies. Inspired by these proposals, we define the conservative Post-query strategy. We give the detailed design and implementation of these five strategies. We also conduct a simulation of these five strategies in combination with two types of ad hoc routing protocols: Dynamic Source Routing (DSR) (a source initiated on-demand routing protocol) and Destination-Sequenced Distance Vector (DSDV) (a table-driven routing protocol). Through simulation, the performance of the five Post-query strategies when combined with the DSR protocol and DSDV protocol are evaluated, in terms of success rate, number of transmitted messages and average waiting time. (Abstract shortened by UMI.)... |