It checks whether it has an entry for n in its neighbor table. If it does not have an entry, it adds one for node n to its neighbor table. 2. Next it confirms whether it was on a route for destination d . If not, it increments kcount in the RREQ packet. If kcount exceeds the threshold k, it does not broadcast the RREQ packet further. 3. Node intm now waits for tp seconds and during this time period: It Collects all incoming RREQ packets for destination d from s. in table1. It also computes the minus of its neighbor set with the neighborhood information recorded in the RREQ packet. If the result is empty, it will assume that these neighbors have already received a copy of the RREQ packet. Else broadcast the RREQ packet to neighbors were have not received a copy of RREQ packet.