In ad hoc networks, wireless devices, simply called nodes, have limited transmission range. Therefore, each node can directly communicate with only those within its transmission range (i.e., its neighbors) and requires other nodes to act as routers in order to communicate with out-of-range destinations. Broadcasting of control packets throughout the entire network is essential for the route discovery, route maintenance and forwarding data packets to every pair of source and destination. Flood routing is a very simple routing strategy that a packet received from a node is copied and transmitted on all outgoing links of that node except for the link that the packet arrived from. After the first transmission, all the routers within one hop receive the packet. After the second transmission, all the routers within two hops receive the packet, and so on. Unless a mechanism stops the transmission, the process continues; as a result, the volume of traffic increases with time cause a serious waste of resources creates broadcast storm problem. In this paper, a new broadcast neighbor discovery routing is implemented to reduce the overhead associated with flooding. A node selects a group of its neighbors for forwarding the packet being broadcast to additional nodes. The performance metrics are analyzed using NS-2 for varying number of data senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group communication. Simulation results show that our scheme performs well in most cases and provides robust performance even with high traffic environments. The simulation experiments show that new method can reduce the overhead for different node mobility speed, as compared with the conventional AODV and DSDV routing protocols.