**3.10 Other Ant-based Algorithms and Techniques**

Other ant-based algorithms for Wireless Multi-Hop Networks include the following:


Other techniques use ants not directly to perform routing but to support the actual routing algorithm. Examples of these are described in the following.

GPSAL: GPS/Ant-Like Routing Algorithm by Câmara and Loureiro [49, 50] is a location based routing algorithm designed for *MANETs* and *WMNs*. Its goal is to use location information to reduce the number of routing messages and speed up route recovery. The assumption is that nodes are equipped with location finding devices like GPS (Global Positioning System). Nodes *ni* keep routing tables which contain *nd*, *loccurr*ð Þ *<sup>d</sup>* , *locprev*ð Þ *<sup>d</sup>* , *TTL locprev*ð Þ *<sup>d</sup>* � �, *type d*ð Þ � � where *nd* is the destination node, *loccurr*ð Þ *d* the current location of *nd*, *locprev*ð Þ *d* the previous location of *nd*, *TTL locprev*ð Þ *<sup>d</sup>* � � the time-to-live of the previous location of *nd*, and *type d*ð Þ the mobility type (mobile, stationary) of *nd*. Ants are only used to collect and seminate location information to the routing tables of the nodes. The actual routing is then calculated on the location entries using a shortest-path algorithm.

