A Novel scheme for avoidance of packet flooding in MANET?

In mobile Adhoc network flooding is basic operation for supporting various operations and protocols. Many routing protocols rely on flooding for disseminating route detection, route maintenance, topology update packets etc. conventional flooding scheme generates unnecessary redundant packet retransmission however cause unnecessary conflict. Some flooding schemes introduced to avoid this problem but these schemes either require information of its entire neighbour more then 1-hope. Or continuing retransmitting redundant data. In this paper we introduce an efficient flooding algorithm which is based on finding distance of each node to its nearest neighbour. This approach is receiver based. Receiver will decide whether packet should forward or not for uniquely identifying the receiver we have assigned prime no. to each node. In our analysis we have seen that this approach is able to reduce the flooding attacks in network.