Gossip-based ad hoc routing reduces the overhead of routing protocols by using a probabilistic approach where each node forwards a message with some probability. This method exhibits bimodal behavior in large networks: in some executions, the message dies out quickly, while in others, a large fraction of nodes receive it. Using a gossip probability between 0.6 and 0.8 ensures that almost all nodes receive the message in most executions. This approach can significantly reduce the number of messages compared to flooding, with simulations showing up to 35% fewer messages in large networks. Gossiping can also be combined with optimizations from flooding to further improve performance. When applied to AODV, gossiping improves end-to-end latency, throughput, and routing load, even in small networks with 150 nodes. The bimodal behavior of gossiping is supported by percolation theory, and experiments show that it performs well in both regular and random networks. Additional heuristics, such as adjusting gossip probabilities based on node degree or using zones, can further enhance performance. Overall, gossiping is a promising approach for improving ad hoc routing efficiency.Gossip-based ad hoc routing reduces the overhead of routing protocols by using a probabilistic approach where each node forwards a message with some probability. This method exhibits bimodal behavior in large networks: in some executions, the message dies out quickly, while in others, a large fraction of nodes receive it. Using a gossip probability between 0.6 and 0.8 ensures that almost all nodes receive the message in most executions. This approach can significantly reduce the number of messages compared to flooding, with simulations showing up to 35% fewer messages in large networks. Gossiping can also be combined with optimizations from flooding to further improve performance. When applied to AODV, gossiping improves end-to-end latency, throughput, and routing load, even in small networks with 150 nodes. The bimodal behavior of gossiping is supported by percolation theory, and experiments show that it performs well in both regular and random networks. Additional heuristics, such as adjusting gossip probabilities based on node degree or using zones, can further enhance performance. Overall, gossiping is a promising approach for improving ad hoc routing efficiency.