The paper introduces a gossip-based routing protocol to reduce the overhead of flooding in ad hoc networks. Gossiping, where each node forwards a message with a certain probability, exhibits bimodal behavior in large networks, meaning that either almost no nodes receive the message or most nodes do. The authors demonstrate that using a gossip probability between 0.6 and 0.8 can ensure that almost every node receives the message in almost every execution, reducing message overhead by up to 35% compared to flooding. They also show that combining gossiping with optimizations of flooding, such as those in AODV, can further improve performance in terms of end-to-end latency and throughput. Simulations indicate significant improvements even in small networks of 150 nodes, with expected enhancements in larger networks. The protocol is simple and can be easily integrated into existing protocols, making it a promising approach for reducing control traffic in ad hoc networks.The paper introduces a gossip-based routing protocol to reduce the overhead of flooding in ad hoc networks. Gossiping, where each node forwards a message with a certain probability, exhibits bimodal behavior in large networks, meaning that either almost no nodes receive the message or most nodes do. The authors demonstrate that using a gossip probability between 0.6 and 0.8 can ensure that almost every node receives the message in almost every execution, reducing message overhead by up to 35% compared to flooding. They also show that combining gossiping with optimizations of flooding, such as those in AODV, can further improve performance in terms of end-to-end latency and throughput. Simulations indicate significant improvements even in small networks of 150 nodes, with expected enhancements in larger networks. The protocol is simple and can be easily integrated into existing protocols, making it a promising approach for reducing control traffic in ad hoc networks.