<P> However, clustering can be used to limit flooding . The latency incurred during route discovery is not significant compared to periodic route update exchanges by all nodes in the network . </P> <P> Example: Ad hoc On - Demand Distance Vector Routing (AODV) </P> <P> Is a simple routing algorithm in which every incoming packet is sent through every outgoing link except the one it arrived on . Flooding is used in bridging and in systems such as Usenet and peer - to - peer file sharing and as part of some routing protocols, including OSPF, DVMRP, and those used in wireless ad hoc networks . </P> <P> This type of protocol combines the advantages of proactive and reactive routing . The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding . The choice of one or the other method requires predetermination for typical cases . The main disadvantages of such algorithms are: </P>

What is ad-hoc (or peer-to-peer) wi-fi networks