This paper proposes a novel flooding algorithm based on an existing IEEE 802.11 MAC protocol in wireless ad hoc networks. Currently when we use the multi-hop routing algorithm, such as the Ad hoc On-demand Distance Vector (AODV) algorithm, the Cluster-Based Routing Protocol (CBRP) and so on, we frequently use the broadcast packet in order to get the topology information. At this time all nodes receiving the packet try to forward the received packet to other nodes. If a number of nodes are located in the sender's coverage, the channel is busy due to the delivery of the received packet. With respect to the coverage of the IEEE 802.11, the utilization factor of the wireless network is decreased because of occupying the channel to distribute the received packet. Thus we propose the new algorithm to resolve this problem. In this algorithm, each node maintains a table of immediate neighbors as well as each neighbor's neighbors. When each node receiving broadcast packets in the sender's coverage forwards the packets, it decides whether to forward them or not by comparing the neighbor list of receiver with that of sender. The proposed algorithm can increase the network efficiency due to the decrease in frequency of broadcast packets in the multi-hop routing protocol. Finally, we evaluate the improved performance through the simulation.