Search performance is still a challenge in peer-to-peer (P2P) systems. The structure of the underlying models has a direct effect on the performance of the search algorithms. In unstructured system like Gnutella, query flooding algorithm suffers from poor scalability and considerable network overhead. In structured systems, algorithms like CAN and CHORD provide better performance, but they need more administrative tasks and have limited functionality in search. Although query flooding suffers from several weaknesses, it is easy to implement and can produce reasonable results when it is run on a proper model. In a proposed model based on social network the effect of model over query flooding is investigated. A simulation of the model shows that if a query is routed to proper nodes it produces less network traffic and better performance than unstructured model.